Advertisement

Journal of Cryptology

, Volume 11, Issue 2, pp 87–108 | Cite as

Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation

  • Moni Naor
  • Rafail Ostrovsky
  • Ramarathnam Venkatesan
  • Moti Yung
Article

Abstract.

``Perfect zero-knowledge arguments'' is a cryptographic primitive which allows one polynomial-time player to convince another polynomial-time player of the validity of an NP statement, without revealing any additional information (in the information-theoretic sense). Here the security achieved is on-line: in order to cheat and validate a false theorem, the prover must break a cryptographic assumption on-line during the conversation, while the verifier cannot find (ever) any information unconditionally. Despite their practical and theoretical importance, it was only known how to implement zero-knowledge arguments based on specific algebraic assumptions.

In this paper we show a general construction which can be based on any one-way permutation. The result is obtained by a construction of an information-theoretic secure bit-commitment protocol. The protocol is efficient (both parties are polynomial time) and can be based on any one-way permutation.

Key words. Computer security, Interative protocols, Cryptography. 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© International Association for Cryptologic Research 1998

Authors and Affiliations

  • Moni Naor
    • 1
  • Rafail Ostrovsky
    • 2
  • Ramarathnam Venkatesan
    • 3
  • Moti Yung
    • 4
  1. 1.Department of Applied Mathematics and Computer ScienceWeizmann Institute of ScienceRehovotIsrael
  2. 2.Math and Cryptography Research Group, BellcoreMorristownU.S.A.
  3. 3.Microsoft Research, One Microsoft WayRedmondU.S.A.
  4. 4.IBM Research, T.J. Watson Research Center, Yorktown HeightsU.S.A.

Personalised recommendations