scientific article; zbMATH DE number 4191106
From MaRDI portal
Publication:3210166
zbMATH Open0722.68045MaRDI QIDQ3210166FDOQ3210166
Publication date: 1990
Title of this publication is not available (Why is that?)
Recommendations
Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25)
Cited In (55)
- On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes
- Zero-knowledge proof systems for QMA
- Auditable attribute-based credentials scheme and its application in contact tracing
- Adaptively secure distributed public-key systems.
- Title not available (Why is that?)
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- The Knowledge Complexity of Interactive Proof Systems
- On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Concurrent knowledge extraction in public-key models
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World
- A note on constant-round zero-knowledge proofs of knowledge
- A black-box approach to post-quantum zero-knowledge in constant rounds
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages
- Strong Proofs of Knowledge
- Composition of Zero-Knowledge Proofs with Efficient Provers
- Efficient non-malleable commitment schemes
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations
- Communication efficient Zero-knowledge Proofs of knowledge
- On the existence of three round zero-knowledge proofs
- Precise Time and Space Simulatable Zero-Knowledge
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
- Constant-round leakage-resilient zero-knowledge from collision resistance
- Magic Adversaries Versus Individual Reduction: Science Wins Either Way
- Statistical zero-knowledge languages can be recognized in two rounds
- Hybrid commitments and their applications to zero-knowledge proof systems
- Precise zero-knowledge arguments with poly-logarithmic efficiency
- Handling expected polynomial-time strategies in simulation-based security proofs
- Practic zero-knowledge proofs: Giving hints and using deficiencies
- Zaps and Their Applications
- Protocols for collusion-secure asymmetric fingerprinting
- Title not available (Why is that?)
- On the Power of Secure Two-Party Computation
- Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP
- Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?
- Lower bounds for non-black-box zero knowledge
- Existence of 3-round zero-knowledge proof systems for NP
- On the Exact Round Complexity of Self-composable Two-Party Computation
- Round-optimal zero-knowledge proofs of knowledge for NP
- An almost-constant round interactive zero-knowledge proof
- On the power of secure two-party computation
- A framework for non-interactive instance-dependent commitment schemes (NIC)
- Private Coins versus Public Coins in Zero-Knowledge Proof Systems
- Individual simulations
- A language-dependent cryptographic primitive
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
- 3-Message Zero Knowledge Against Human Ignorance
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Constant-round perfect zero-knowledge computationally convincing protocols
- Concurrent composition of differential privacy
- Which languages have 4-round zero-knowledge proofs?
- Constant-round adaptive zero-knowledge proofs for NP
- New Constructions of Efficient Simulation-Sound Commitments Using Encryption and Their Applications
- Efficient non-malleable commitment schemes
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 Q3210166)
