Pages that link to "Item:Q3210166"
From MaRDI portal
The following pages link to Zero knowledge proofs of knowledge in two rounds (Q3210166):
Displaying 50 items.
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- Round-optimal zero-knowledge proofs of knowledge for NP (Q362163) (← links)
- A note on constant-round zero-knowledge proofs of knowledge (Q380963) (← links)
- Which languages have 4-round zero-knowledge proofs? (Q421047) (← links)
- A framework for non-interactive instance-dependent commitment schemes (NIC) (Q500985) (← links)
- Precise zero-knowledge arguments with poly-logarithmic efficiency (Q615245) (← links)
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer (Q656920) (← links)
- A language-dependent cryptographic primitive (Q676829) (← links)
- Constant-round perfect zero-knowledge computationally convincing protocols (Q808240) (← links)
- Statistical zero-knowledge languages can be recognized in two rounds (Q808692) (← links)
- Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP (Q893613) (← links)
- Constant-round adaptive zero-knowledge proofs for NP (Q903613) (← links)
- Handling expected polynomial-time strategies in simulation-based security proofs (Q1021232) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- Practic zero-knowledge proofs: Giving hints and using deficiencies (Q1180509) (← links)
- An almost-constant round interactive zero-knowledge proof (Q1198029) (← links)
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages (Q1391315) (← links)
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations (Q1629411) (← links)
- On the existence of three round zero-knowledge proofs (Q1653072) (← links)
- Adaptively secure distributed public-key systems. (Q1853497) (← links)
- How to construct constant-round zero-knowledge proof systems for NP (Q1924196) (← links)
- Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? (Q2055669) (← links)
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust (Q2104237) (← links)
- A black-box approach to post-quantum zero-knowledge in constant rounds (Q2120081) (← links)
- Constant-round leakage-resilient zero-knowledge from collision resistance (Q2135523) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- Existence of 3-round zero-knowledge proof systems for NP (Q2425854) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- Individual simulations (Q2691606) (← links)
- Concurrent composition of differential privacy (Q2697876) (← links)
- On the Power of Secure Two-Party Computation (Q2829222) (← links)
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
- New Constructions of Efficient Simulation-Sound Commitments Using Encryption and Their Applications (Q2890001) (← links)
- Strong Proofs of Knowledge (Q3088175) (← links)
- Precise Time and Space Simulatable Zero-Knowledge (Q3092346) (← links)
- 3-Message Zero Knowledge Against Human Ignorance (Q3179352) (← links)
- Composition of Zero-Knowledge Proofs with Efficient Provers (Q3408217) (← links)
- Private Coins versus Public Coins in Zero-Knowledge Proof Systems (Q3408218) (← links)
- On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation (Q3449562) (← links)
- The Knowledge Complexity of Interactive Proof Systems (Q3833627) (← links)
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (Q4302852) (← links)
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications (Q4916004) (← links)
- Protocols for collusion-secure asymmetric fingerprinting (Q5048941) (← links)
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World (Q5066952) (← links)
- Communication efficient Zero-knowledge Proofs of knowledge (Q5096802) (← links)
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries (Q5445504) (← links)
- (Q5465361) (← links)
- On the Exact Round Complexity of Self-composable Two-Party Computation (Q5738974) (← links)
- Magic Adversaries Versus Individual Reduction: Science Wins Either Way (Q5738980) (← links)
- (Q5750398) (← links)
