scientific article; zbMATH DE number 4191106
From MaRDI portal
Publication:3210166
zbMATH Open0722.68045MaRDI QIDQ3210166FDOQ3210166
Authors: Adi Shamir, Uriel Feige 
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 (56)
- 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
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Concurrent knowledge extraction in public-key models
- 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
- Efficient non-malleable commitment schemes
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations
- On the existence of three round zero-knowledge proofs
- Constant-round leakage-resilient zero-knowledge from collision resistance
- Statistical zero-knowledge languages can be recognized in two rounds
- Hybrid commitments and their applications to zero-knowledge proof systems
- Private coins versus public coins in 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
- 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
- 3-message zero knowledge against human ignorance
- Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?
- Magic adversaries versus individual reduction: science wins either way
- Lower bounds for non-black-box zero knowledge
- Communication efficient zero-knowledge proofs of knowledge (with applications to electronic cash)
- Existence of 3-round zero-knowledge proof systems for NP
- New constructions of efficient simulation-sound commitments using encryption and their applications
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- On non-black-box simulation and the impossibility of approximate obfuscation
- 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)
- Individual simulations
- A language-dependent cryptographic primitive
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
- Composition of zero-knowledge proofs with efficient provers
- 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?
- Two-message, oblivious evaluation of cryptographic functionalities
- Strong proofs of knowledge
- Constant-round adaptive zero-knowledge proofs for NP
- Protocols for collusion-secure asymmetric fingerprinting (extended abstract)
- Zero-knowledge proofs via polynomial representations
- Efficient non-malleable commitment schemes
- Precise time and space simulatable zero-knowledge
- On the exact round complexity of self-composable two-party computation
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)
