Zero knowledge and circuit minimization

Eric Allender, Bireswar Das

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Scopus citations

Abstract

We show that every problem in the complexity class SZK (Statistical Zero Knowledge) is efficiently reducible to the Minimum Circuit Size Problem (MCSP). In particular Graph Isomorphism lies in RP MCSP. This is the first theorem relating the computational power of Graph Isomorphism and MCSP, despite the long history these problems share, as candidate NP-intermediate problems.

Original languageEnglish (US)
Title of host publicationMathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings
PublisherSpringer Verlag
Pages25-32
Number of pages8
EditionPART 2
ISBN (Print)9783662444641
DOIs
StatePublished - Jan 1 2014
Externally publishedYes
Event39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014 - Budapest, Hungary
Duration: Aug 25 2014Aug 29 2014

Publication series

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

Other

Other39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014
CountryHungary
CityBudapest
Period8/25/148/29/14

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Zero knowledge and circuit minimization'. Together they form a unique fingerprint.

Cite this