Title :
5-Round Computational Zero-Knowledge Proof with Negligible Error Probability for Any NP from Any One-Way Permutation
Author :
Tang, Chunming ; Pei, Dingyi ; Yao, Zheng-an
Author_Institution :
Sch. of Math. & Inf. Sci., Guangzhou Univ., Guangzhou
Abstract :
We will construct a perfectly hiding commitment in two rounds from any one-way permutation, which is a negation of this result that O(n/(log n)) rounds is the tight lower bound on the rounds complexity of perfectly hiding commitments from any one-way permutation. Based on our commitments, we will construct a computational zero-knowledge proof for any NP that achieves negligible error probability in 5 rounds of interaction, assuming only the existence of a one-way permutation.
Keywords :
computational complexity; cryptography; error statistics; optimisation; computational zero-knowledge proof; error probability; one-way permutation; perfectly hiding commitment; Atomic measurements; Costs; Cryptographic protocols; Electronic commerce; Error probability; Information security; Mathematics; Polynomials; computational zero-knowledge proof; one-way permutation; perfectly hiding commitment;
Conference_Titel :
Electronic Commerce and Security, 2008 International Symposium on
Conference_Location :
Guangzhou City
Print_ISBN :
978-0-7695-3258-5
DOI :
10.1109/ISECS.2008.88
