A uniform-complexity treatment of encryption and zero-knowledge

DOI10.1007/BF02620230zbMath0795.68069MaRDI QIDQ1207696

Oded Goldreich

Publication date: 16 May 1993

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

zbMATH Keywords

proof systems; encryption; zero-knowledge; commitment schemes; probabilistic polynomial-time machines; uniform complexity measures

Mathematics Subject Classification ID

68Q45: Formal languages and automata

94A60: Cryptography

68P25: Data encryption (aspects in computer science)

Related Items

Authenticated encryption: relations among notions and analysis of the generic composition paradigm, Mathematical problems in cryptology, Secure integration of asymmetric and symmetric encryption schemes, Enhancements of trapdoor permutations, Lower bounds for non-black-box zero knowledge, Composition of Zero-Knowledge Proofs with Efficient Provers, Language Modeling and Encryption on Packet Switched Networks, Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles, A Leakage-Resilient Mode of Operation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constant-round perfect zero-knowledge computationally convincing protocols
• Probabilistic encryption
• Minimum disclosure proofs of knowledge
• Definitions and properties of zero-knowledge proof systems
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Communication Theory of Secrecy Systems*
• An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
• Zero-Knowledge Simulation of Boolean Circuits
• The Notion of Security for Probabilistic Cryptosystems
• The Knowledge Complexity of Interactive Proof Systems
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems