4-Round Resettably-Sound Zero Knowledge

  • Kai-Min Chung
  • Rafail Ostrovsky
  • Rafael Pass
  • Muthuramakrishnan Venkitasubramaniam
  • Ivan Visconti
Conference paper

DOI: 10.1007/978-3-642-54242-8_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8349)
Cite this paper as:
Chung KM., Ostrovsky R., Pass R., Venkitasubramaniam M., Visconti I. (2014) 4-Round Resettably-Sound Zero Knowledge. In: Lindell Y. (eds) Theory of Cryptography. TCC 2014. Lecture Notes in Computer Science, vol 8349. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© International Association for Cryptologic Research 2014

Authors and Affiliations

  • Kai-Min Chung
    • 1
  • Rafail Ostrovsky
    • 2
  • Rafael Pass
    • 3
  • Muthuramakrishnan Venkitasubramaniam
    • 4
  • Ivan Visconti
    • 5
  1. 1.Academia SinicaTaiwan
  2. 2.UCLALos AngelesUSA
  3. 3.Cornell UniversityIthacaUSA
  4. 4.University of RochesterRochesterUSA
  5. 5.University of SalernoItaly

Personalised recommendations