scientific article; zbMATH DE number 177820

MaRDI QIDQ4038698zbMATH OpenFDO

Authors Oded Goldreich, Hugo Krawczyk

Publication date 18 May 1993

zbMATH Keywords

black-box simulation zero- knowledgeconstant-round Arthur-Merlin proofsparallel compositionsequential composition

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• On the Composition of Zero-Knowledge Proof Systems
• scientific article; zbMATH DE number 176551
• Composition of zero-knowledge proofs with efficient provers
• scientific article; zbMATH DE number 1304087
• The knowledge tightness of parallel zero-knowledge

Cited in

(33)

• Hybrid commitments and their applications to zero-knowledge proof systems
• An almost-constant round interactive zero-knowledge proof
• A uniform-complexity treatment of encryption and zero-knowledge
• On the communication complexity of zero-knowledge proofs
• Definitions and properties of zero-knowledge proof systems
• Practical proofs of knowledge without relying on theoretical proofs of membership on languages
• Mathematical problems in cryptology
• Continuous verifiable delay functions
• Random walks and concurrent zero-knowledge
• From private simultaneous messages to zero-information Arthur-Merlin protocols and back
• The knowledge tightness of parallel zero-knowledge
• On Monotone Formula Composition of Perfect Zero-Knowledge Languages
• Composition of zero-knowledge proofs with efficient provers
• Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
• Zero knowledge in the random oracle model, revisited
• Which languages have 4-round zero-knowledge proofs?
• scientific article; zbMATH DE number 1304087 (Why is no real title available?)
• On the Composition of Zero-Knowledge Proof Systems
• From weak to strong zero-knowledge and applications
• Zero Knowledge and Soundness Are Symmetric
• On the Composition of Public-Coin Zero-Knowledge Protocols
• On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes
• Composable long-term security with rewinding
• Zero-knowledge systems from MPC-in-the-head and oblivious transfer
• Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
• A language-dependent cryptographic primitive
• CDLS: proving knowledge of committed discrete logarithms with soundness
• Almost-total puzzles and their applications
• Is it even possible? On the parallel composition of asynchronous MPC protocols
• On the impossibility of actively secure distributed samplers
• Non-interactive zero-knowledge proofs for composite statements
• Constant-round perfect zero-knowledge computationally convincing protocols
• Relativized perfect zero knowledge is not BPP

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4038698)