Abstract
In this work, we study simultaneously resettable arguments of knowledge. As our main result, we show a construction of a constant-round simultaneously resettable witness-indistinguishable argument of knowledge (simres AoK, for short) for any NP language. We also show two applications of simres AoK: the first constant-round simultaneously resettable zero-knowledge argument of knowledge in the Bare Public-Key Model; and the first simultaneously resettable identification scheme which follows the knowledge extraction paradigm. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Cho, C., Ostrovsky, R., Scafuro, A., & Visconti, I. (2012). Simultaneously resettable arguments of knowledge. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7194 LNCS, pp. 530–547). https://doi.org/10.1007/978-3-642-28914-9_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
