Local zero knowledge
From MaRDI portal
Publication:2931395
DOI10.1145/1132516.1132561zbMath1301.94123OpenAlexW2069549542MaRDI QIDQ2931395
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
Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Authentication, digital signatures and secret sharing (94A62)
Related Items
Precise zero-knowledge arguments with poly-logarithmic efficiency, On sequential composition of precise zero-knowledge, On expected polynomial runtime in cryptography, Concurrent zero knowledge, revisited, Zero-Knowledge Proofs of Proximity, A framework for non-interactive instance-dependent commitment schemes (NIC), Cryptography Using Captcha Puzzles, On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits, How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge, Resettably Secure Computation, SPARKs: succinct parallelizable arguments of knowledge, Precise Time and Space Simulatable Zero-Knowledge, Fine-Grained Cryptography, Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model, New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
