Practic zero-knowledge proofs: Giving hints and using deficiencies

DOI10.1007/BF00196727zbMath0755.68044MaRDI QIDQ1180509

Katalin Friedl, Joan. Boyar, Carstent Lund

Publication date: 27 June 1992

Published in: Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

efficiencyzero-knowledge proofnumber-theoretic problems

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (6)

The knowledge complexity of quadratic residuosity languages ⋮ The graph clustering problem has a perfect zero-knowledge interactive proof ⋮ Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages ⋮ A language-dependent cryptographic primitive ⋮ Generic Fully Simulatable Adaptive Oblivious Transfer ⋮ Round-optimal perfect zero-knowledge proofs

Cites Work

• Probabilistic encryption
• Does co-NP have short interactive proofs ?
• Zero-knowledge proofs of identity
• Approximate formulas for some functions of prime numbers
• The complexity of promise problems with applications to public-key cryptography
• How to Generate Factored Random Numbers
• The Knowledge Complexity of Interactive Proof Systems
• Probabilistic Algorithms in Finite Fields
• Greatest of the Least Primes in Arithmetic Progressions Having a Given Modulus
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Factoring Polynomials Over Large Finite Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Practic zero-knowledge proofs: Giving hints and using deficiencies