Local zero knowledge

DOI10.1145/1132516.1132561MaRDI QIDQ2931395zbMATHOpenAlexFDO

Authors Silvio Micali, Rafael Pass

Publication date 25 November 2014

Published in Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1132516.1132561

zbMATH Keywords

cryptographyzero knowledge

Mathematics Subject Classification ID

Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Authentication, digital signatures and secret sharing (94A62)

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

(17)

• Resettably Secure Computation
• Noninterference with Local Policies
• Precise time and space simulatable zero-knowledge
• How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge
• SPARKs: succinct parallelizable arguments of knowledge
• Fine-Grained Cryptography
• On sequential composition of precise zero-knowledge
• Precise zero-knowledge arguments with poly-logarithmic efficiency
• Concurrent zero knowledge, revisited
• Zero-knowledge proofs of proximity
• Eye for an eye: efficient concurrent zero-knowledge in the timing model
• Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
• 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
• A framework for non-interactive instance-dependent commitment schemes (NIC)
• Cryptography using \texttt{CAPTCHA} puzzles
• On expected polynomial runtime in cryptography

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)