Abstract
While 4-round constructions of zero-knowledge arguments are known based on the existence of one-way functions, constuctions of resettably-sound zero-knowledge arguments require either stronger assumptions (the existence of a fully-homomorphic encryption scheme), or more communication rounds. We close this gap by demonstrating a 4-round resettably-sound zero-knowledge argument for NP based on the existence of one-way functions. © 2014 International Association for Cryptologic Research.
Cite
CITATION STYLE
Chung, K. M., Ostrovsky, R., Pass, R., Venkitasubramaniam, M., & Visconti, I. (2014). 4-round resettably-sound zero knowledge. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8349 LNAI, pp. 192–216). Springer Verlag. https://doi.org/10.1007/978-3-642-54242-8_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
