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 systemsencryptionzero-knowledgecommitment schemesprobabilistic polynomial-time machinesuniform complexity measures

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (19)

High-threshold AVSS with optimal communication complexity ⋮ Random oracles and non-uniformity ⋮ Enhancements of trapdoor permutations ⋮ Mathematical problems in cryptology ⋮ NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion ⋮ Secure integration of asymmetric and symmetric encryption schemes ⋮ On expected polynomial runtime in cryptography ⋮ AC-RRNS: anti-collusion secured data sharing scheme for cloud storage ⋮ Cryptography and cryptographic protocols ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Lower bounds for non-black-box zero knowledge ⋮ Language Modeling and Encryption on Packet Switched Networks ⋮ Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles ⋮ A Leakage-Resilient Mode of Operation ⋮ Authenticated encryption: relations among notions and analysis of the generic composition paradigm ⋮ Cryptographic pseudorandom generators can make cryptosystems problematic ⋮ On publicly-accountable zero-knowledge and small shuffle arguments ⋮ On the Existence of Extractable One-Way Functions ⋮ Composition of Zero-Knowledge Proofs with Efficient Provers

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

This page was built for publication: A uniform-complexity treatment of encryption and zero-knowledge