Arrow Research search
Back to STOC

STOC 2006

Local zero knowledge

Conference Paper Session 7B Algorithms and Complexity ยท Theoretical Computer Science

Abstract

We put forward the notion of Local Zero Knowledge and provide its first implementations in a variety of settings under standard complexity assumptions.Whereas the classical notion of Zero Knowledge guarantees the secrecy only of information that is hard to compute, the new one meaningfully guarantees the secrecy of any information (in case of perfect zero-knowledge, and asymptotically in all other cases). Consequently, Local Zero Knowledge remains very meaningful even if DP = NP.

Authors

Keywords

  • cryptography
  • zero knowledge

Context

Venue
ACM Symposium on Theory of Computing
Archive span
1969-2025
Indexed papers
4364
Paper id
269364420743970890
v2026.09.13