On Verifying Anonymity of Security Protocols with Formal Methods
| Project/Area Number |
19700018
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Aichi Institute of Technology (2008-2009)
NTT Communication Science Laboratories (2007) |
|---|
Principal Investigator |
KAWABE Yoshinobu Aichi Institute of Technology, 情報科学部, 准教授 (80396184)
|
|---|
| Project Period (FY) |
2007 – 2009
|
| Project Status |
Completed (Fiscal Year 2009)
|
| Budget Amount *help |
¥3,380,000 (Direct Cost: ¥2,900,000、Indirect Cost: ¥480,000)
Fiscal Year 2009: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2008: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2007: ¥1,300,000 (Direct Cost: ¥1,300,000)
|
|---|
| Keywords | 暗号系 / セキュリティ検証 / 匿名性 / フォーマルメソッド / 定理証明 / 形式検証 / I / O-オートマトン / 0-オートマトン |
|---|
| Research Abstract |
This study proposed a new method to prove the anonymity of security protocols. We employ a formal method ; specifically, we extended our "anonymous simulation method"to deal with probabilistic protocols and stronger adversaries. In this study, we demonstrated the anonymity verification for Crowds. Also, we proved the receipt-freeness property of an e-voting protocol.
|
Report
(4 results)
Research Products
(21 results)
