Chapter

Automata, Languages and Programming

Volume 1443 of the series Lecture Notes in Computer Science pp 784-795

Date:

Image density is complete for non-interactive-SZK

Extended abstract
  • A. De SantisAffiliated withDipartimento di Informatica ed Applicazioni, Università di Salerno
  • , G. Di CrescenzoAffiliated withComputer Science Department, University of Califonia
  • , G. PersianoAffiliated withDipartimento di Informatica ed Applicazioni, Università di Salerno
  • , M. YungAffiliated withCertCo BTEC

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We show that the class NISZK of languages that admit non-interactive statistical zero-knowledge proof system has a natural complete promise problem. This characterizes statistical zero-knowledge in the public random string model without reference to the public random string or to zero knowledge.

Building on this result we are able to show structural properties of NISZK such as closure under OR composition and closure under complement.