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. © Springer-Verlag Berlin Heidelberg 2001.
CITATION STYLE
Micali, S., & Reyzin, L. (2001). Soundness in the public-key model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2139 LNCS, pp. 542–565). Springer Verlag. https://doi.org/10.1007/3-540-44647-8_32
Mendeley helps you to discover research relevant for your work.