Name
Abstract | ||
|---|---|---|
The public-key model for interactive proofs has proved to be quite effective in improving protocol efficiency [CGGM00]. We argue, however, that its soundness notion is more subtle and complex than in the classical model, and that it should be better understood to avoid designing erroneous protocols. Specifically, for the public-key model, we - identify four meaningful notions of soundness; - prove that, under minimal complexity assumptions, these four notions are distinct; - identify the exact soundness notions satisfied by prior interactive protocols; and - identify the round complexity of some of the new notions. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1007/3-540-44647-8_32 | CRYPTO |
Keywords | Field | DocType |
prior interactive protocol,classical model,meaningful notion,soundness notion,erroneous protocol,public-key model,exact soundness notion,interactive proof,minimal complexity assumption,round complexity,public key | Round complexity,Computer science,Cryptography,Theoretical computer science,Mathematical proof,Soundness,Security parameter,Public-key cryptography,Communications protocol | Conference |
ISBN | Citations | PageRank |
3-540-42456-3 | 59 | 1.99 |
References | Authors | |
16 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Silvio Micali | 1 | 11434 | 2581.31 |
| Leonid Reyzin | 2 | 2640 | 132.67 |