Local zero knowledge

Silvio Micali*, Rafael Pass

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 P = NP.

Original languageEnglish
Title of host publicationSTOC'06
Subtitle of host publicationProceedings of the 38th Annual ACM Symposium on Theory of Computing
PublisherAssociation for Computing Machinery (ACM)
Pages306-315
Number of pages10
ISBN (Print)1595931341, 9781595931344
DOIs
StatePublished - 2006
Externally publishedYes
Event38th Annual ACM Symposium on Theory of Computing, STOC'06 - Seattle, WA, United States
Duration: 21 May 200623 May 2006

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
Volume2006
ISSN (Print)0737-8017

Conference

Conference38th Annual ACM Symposium on Theory of Computing, STOC'06
Country/TerritoryUnited States
CitySeattle, WA
Period21/05/0623/05/06

Keywords

  • Cryptography
  • Zero Knowledge

Cite this