scientific article; zbMATH DE number 177820
From MaRDI portal
Publication:4038698
zbMATH Open0766.68033MaRDI QIDQ4038698FDOQ4038698
Authors: Oded Goldreich, Hugo Krawczyk 
Publication date: 18 May 1993
Title of this publication is not available (Why is that?)
Recommendations
sequential compositionparallel compositionblack-box simulation zero- knowledgeconstant-round Arthur-Merlin proofs
Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)
Cited In (27)
- On Monotone Formula Composition of Perfect Zero-Knowledge Languages
- On the Composition of Zero-Knowledge Proof Systems
- Random walks and concurrent zero-knowledge
- From weak to strong zero-knowledge and applications
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages
- Composable long-term security with rewinding
- Zero Knowledge and Soundness Are Symmetric
- Zero-knowledge systems from MPC-in-the-head and oblivious transfer
- The knowledge tightness of parallel zero-knowledge
- Mathematical problems in cryptology
- Hybrid commitments and their applications to zero-knowledge proof systems
- On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes
- On the Composition of Public-Coin Zero-Knowledge Protocols
- Continuous verifiable delay functions
- On the communication complexity of zero-knowledge proofs
- Definitions and properties of zero-knowledge proof systems
- A uniform-complexity treatment of encryption and zero-knowledge
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
- Zero knowledge in the random oracle model, revisited
- Non-interactive zero-knowledge proofs for composite statements
- An almost-constant round interactive zero-knowledge proof
- A language-dependent cryptographic primitive
- Composition of zero-knowledge proofs with efficient provers
- Constant-round perfect zero-knowledge computationally convincing protocols
- Which languages have 4-round zero-knowledge proofs?
- Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
- From private simultaneous messages to zero-information Arthur-Merlin protocols and back
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)
