Perfect zero knowledge: New upperbounds and relativized separations

Peter Dixon, Sutanu Gayen, A. Pavan, N. V. Vinodchandran

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

1 Scopus citations

Abstract

We investigate the complexity of problems that admit perfect zero-knowledge interactive protocols and establish new unconditional upper bounds and oracle separation results. We establish our results by investigating certain distribution testing problems: computational problems over high-dimensional distributions represented by succinct Boolean circuits. A relatively less-investigated complexity class SBP emerged as significant in this study. The main results we establish are: (1)A unconditional inclusion that NIPZK ⊆ CoSBP.(2)Construction of a relativized world in which there is a distribution testing problem that lies in NIPZK but not in SBP, thus giving a relativized separation of NIPZK (and hence PZK) from SBP.(3)Construction of a relativized world in which there is a distribution testing problem that lies in PZK but not in CoSBP, thus giving a relativized separation of PZK from CoSBP. Results (1) and (3) imply an oracle separating PZK from NIPZK. Our results refine the landscape of perfect zero-knowledge classes in relation to traditional complexity classes.

Original languageEnglish
Title of host publicationTheory of Cryptography - 18th International Conference, TCC 2020, Proceedings
EditorsRafael Pass, Krzysztof Pietrzak
PublisherSpringer Science and Business Media Deutschland GmbH
Pages684-704
Number of pages21
ISBN (Print)9783030643744
DOIs
StatePublished - 1 Jan 2020
Externally publishedYes
Event18th International Conference on Theory of Cryptography, TCCC 2020 - Durham, United States
Duration: 16 Nov 202019 Nov 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12550 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference18th International Conference on Theory of Cryptography, TCCC 2020
Country/TerritoryUnited States
CityDurham
Period16/11/2019/11/20

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Perfect zero knowledge: New upperbounds and relativized separations'. Together they form a unique fingerprint.

Cite this