loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 International Symposium on Electronic Commerce and Security
5-Round Computational Zero-Knowledge Proof with Negligible Error Probability for Any NP from Any One-Way Permutation
August 03-August 05
ISBN: 978-0-7695-3258-5
ASCII Text
x 
 
Chunming Tang, Dingyi Pei, Zheng-an Yao, "5-Round Computational Zero-Knowledge Proof with Negligible Error Probability for Any NP from Any One-Way Permutation," Electronic Commerce and Security, International Symposium, pp. 407-411, 2008 International Symposium on Electronic Commerce and Security, 2008.
 
 
BibTex
x
 
@article{ 10.1109/ISECS.2008.88,
author = {Chunming Tang and Dingyi Pei and Zheng-an Yao},
title = {5-Round Computational Zero-Knowledge Proof with Negligible Error Probability for Any NP from Any One-Way Permutation},
journal ={Electronic Commerce and Security, International Symposium},
volume = {0},
year = {2008},
isbn = {978-0-7695-3258-5},
pages = {407-411},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISECS.2008.88},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Electronic Commerce and Security, International Symposium
TI - 5-Round Computational Zero-Knowledge Proof with Negligible Error Probability for Any NP from Any One-Way Permutation
SN - 978-0-7695-3258-5
SP407
EP411
A1 - Chunming Tang,
A1 - Dingyi Pei,
A1 - Zheng-an Yao,
PY - 2008
KW - computational zero-knowledge proof
KW - perfectly hiding commitment
KW - one-way permutation
VL - 0
JA - Electronic Commerce and Security, International Symposium
ER -
 
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.
Index Terms:
computational zero-knowledge proof, perfectly hiding commitment, one-way permutation
Citation:
Chunming Tang, Dingyi Pei, Zheng-an Yao, "5-Round Computational Zero-Knowledge Proof with Negligible Error Probability for Any NP from Any One-Way Permutation," isecs, pp.407-411, 2008 International Symposium on Electronic Commerce and Security, 2008
Usage of this product signifies your acceptance of the Terms of Use.