An unbounded simulation-sound non-interactive zero-knowledge proof system for NP

Authors:
Hongda Li;Bao Li
Affiliations:
State Key Lab of Information Security, Graduate School of Chinese Academy of Sciences, Beijing, China;State Key Lab of Information Security, Graduate School of Chinese Academy of Sciences, Beijing, China
Venue:
CISC'05 Proceedings of the First SKLOIS conference on Information Security and Cryptology
Year:
2005

Citing 13
Cited 1

How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Non-interactive zero-knowledge and its applications

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems

SIAM Journal on Computing
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
Noninteractive zero-knowledge

SIAM Journal on Computing
Concurrent zero-knowledge

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Foundations of Cryptography: Basic Tools

Foundations of Cryptography: Basic Tools
Nonmalleable Cryptography

SIAM Journal on Computing
Robust Non-interactive Zero Knowledge

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Multiple non-interactive zero knowledge proofs based on a single random string

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Zero-knowledge proofs of knowledge without interaction

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Strengthening zero-knowledge protocols using signatures

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques

Computational soundness of symbolic zero-knowledge proofs: weaker assumptions and mechanized verification

POST'13 Proceedings of the Second international conference on Principles of Security and Trust

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we use strong one-time signatures schemes and adaptive Non-Interactive Zero-Knowledge (NIZK) proof systems to construct an efficient unbounded simulation-sound NIZK proof system, assuming the existence of one-way permutation and pseudorandom generator. Furthermore, we can obtain an unbounded non-malleable NIZK proof system when replacing the adaptive NIZK proof systems in our construction with adaptive NIZK proof of knowledge.