The following pages link to Local zero knowledge (Q2931395):
Displaying 17 items.
- A framework for non-interactive instance-dependent commitment schemes (NIC) (Q500985) (← links)
- Precise zero-knowledge arguments with poly-logarithmic efficiency (Q615245) (← links)
- On sequential composition of precise zero-knowledge (Q615298) (← links)
- SPARKs: succinct parallelizable arguments of knowledge (Q2055636) (← links)
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust (Q2104237) (← links)
- On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits (Q2267359) (← links)
- Concurrent zero knowledge, revisited (Q2442650) (← links)
- How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge (Q2516524) (← links)
- On expected polynomial runtime in cryptography (Q2695649) (← links)
- Fine-Grained Cryptography (Q2829959) (← links)
- Noninterference with Local Policies (Q2849922) (← links)
- Precise Time and Space Simulatable Zero-Knowledge (Q3092346) (← links)
- Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model (Q3408213) (← links)
- Resettably Secure Computation (Q3627427) (← links)
- Cryptography Using Captcha Puzzles (Q4916003) (← links)
- Zero-Knowledge Proofs of Proximity (Q4993282) (← links)
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance (Q6637522) (← links)
