Recommendations
- Localised multisecret sharing
- Precise Concurrent Zero Knowledge
- scientific article; zbMATH DE number 94166
- Zero-Knowledge Proofs
- Zero‐Knowledge Proofs
- scientific article; zbMATH DE number 1775426
- Zero knowledge and circuit minimization
- Zero knowledge and circuit minimization
- scientific article; zbMATH DE number 5485433
- Leakage-resilient zero knowledge
Cited in
(18)- SPARKs: succinct parallelizable arguments of knowledge
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits
- Concurrent zero knowledge, revisited
- How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge
- On expected polynomial runtime in cryptography
- Fine-Grained Cryptography
- Noninterference with Local Policies
- Precise time and space simulatable zero-knowledge
- Eye for an eye: efficient concurrent zero-knowledge in the timing model
- Resettably Secure Computation
- Cryptography using \texttt{CAPTCHA} puzzles
- Zero-knowledge proofs of proximity
- A framework for non-interactive instance-dependent commitment schemes (NIC)
- Precise zero-knowledge arguments with poly-logarithmic efficiency
- On sequential composition of precise zero-knowledge
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
- Post-quantum zero-knowledge with space-bounded simulation
This page was built for publication: Local zero knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931395)
