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. © 2014 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Allender, E., & Das, B. (2014). Zero knowledge and circuit minimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8635 LNCS, pp. 25–32). Springer Verlag. https://doi.org/10.1007/978-3-662-44465-8_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
