Pages that link to "Item:Q5445522"
From MaRDI portal
The following pages link to An Equivalence Between Zero Knowledge and Commitments (Q5445522):
Displayed 18 items.
- Which languages have 4-round zero-knowledge proofs? (Q421047) (← links)
- A framework for non-interactive instance-dependent commitment schemes (NIC) (Q500985) (← links)
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer (Q656920) (← links)
- Public-coin statistical zero-knowledge batch verification against malicious verifiers (Q2056790) (← links)
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust (Q2104237) (← links)
- Statistical difference beyond the polarizing regime (Q2175943) (← links)
- On the relationship between statistical zero-knowledge and statistical randomized encodings (Q2281251) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge (Q2516524) (← links)
- On the Power of Secure Two-Party Computation (Q2829222) (← links)
- On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings (Q2829956) (← links)
- Private Coins versus Public Coins in Zero-Knowledge Proof Systems (Q3408218) (← links)
- Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks (Q3519535) (← links)
- Zero-Knowledge Proofs of Proximity (Q4993282) (← links)
- (Q5121911) (← links)
- Structure Versus Hardness Through the Obfuscation Lens (Q5149758) (← links)
- One-Way Functions and (Im)perfect Obfuscation (Q5885583) (← links)
- General properties of quantum bit commitments (extended abstract) (Q6134002) (← links)