We introduce weaker models for non-interactive zero knowledge, in which the dealer is not restricted to deal a truly random string and may also have access to the input to the protocol (i.e. the statement to prove). We show in these models a non-interactive statistical zero-knowledge proof for every language that has (interactive) statistical zero-knowledge proof, and a computational zero-knowledge proof for every language in NP. We also show how to change the latter proof system to fit the model of non-interactive computational zero-knowledge with preprocessingto improve existing results in term of the number of bit commitments that are required for the protocol to work.
|Original language||American English|
|Title of host publication||Advances in Cryptology - ASIACRYPT 2000 - 6th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings|
|Number of pages||14|
|ISBN (Electronic)||3540414045, 9783540414049|
|State||Published - 2000|
|Event||6th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2000 - Kyoto, Japan|
Duration: 3 Dec 2000 → 7 Dec 2000
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||6th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2000|
|Period||3/12/00 → 7/12/00|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 2000.