Title :
Perfect Zero-Knowledge Argument of Knowledge with Negligible Error Probability in Two-Round for NP from Any One-Way Permutation
Author :
Tang, Chunming ; Hao, Zhifeng
Author_Institution :
Sch. of Math. & Inf. Sci., Guangzhou Univ., Guangzhou, China
Abstract :
Based on the interactive proof of Hamiltonian Cycle (HC) of large directed graph, which is a ¿-protocol, we construct a perfectly hiding and computationally binding trapdoor commitment in 2-round from any one-way permutation. Then, based on this trapdoor commitment, we construct perfect zero-knowledge argument of knowledge with negligible error probability in 2-round for NP, assuming only the existence of a one-way permutation.
Keywords :
computational complexity; directed graphs; error statistics; optimisation; Hamiltonian cycle; NP problems; any one-way permutation; computationally binding trapdoor commitment; directed graph; error probability; interactive proof; zero-knowledge argument; Cryptographic protocols; Error probability; Information science; Information security; Laboratories; Mathematics; Mobile communication; Mobile computing; Polynomials; $Sigma$-protocol; Perfect zero-knowledge argument; one-way permutation; perfectly hiding trapdoor commitment;
Conference_Titel :
Communications and Mobile Computing (CMC), 2010 International Conference on
Conference_Location :
Shenzhen
Print_ISBN :
978-1-4244-6327-5
Electronic_ISBN :
978-1-4244-6328-2
DOI :
10.1109/CMC.2010.281
