TY - GEN
T1 - Point obfuscation and 3-round zero-knowledge
AU - Bitansky, Nir
AU - Paneth, Omer
PY - 2012
Y1 - 2012
N2 - We construct 3-round proofs and arguments with negligible soundness error satisfying two relaxed notions of zero-knowledge (ZK): weak ZK and witness hiding (WH). At the heart of our constructions lie new techniques based on point obfuscation with auxiliary input (AIPO). It is known that such protocols cannot be proven secure using black-box reductions (or simulation). Our constructions circumvent these lower bounds, utilizing AIPO (and extensions) as the "non-black-box component" in the security reduction.
AB - We construct 3-round proofs and arguments with negligible soundness error satisfying two relaxed notions of zero-knowledge (ZK): weak ZK and witness hiding (WH). At the heart of our constructions lie new techniques based on point obfuscation with auxiliary input (AIPO). It is known that such protocols cannot be proven secure using black-box reductions (or simulation). Our constructions circumvent these lower bounds, utilizing AIPO (and extensions) as the "non-black-box component" in the security reduction.
UR - http://www.scopus.com/inward/record.url?scp=84858320408&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84858320408&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-28914-9_11
DO - 10.1007/978-3-642-28914-9_11
M3 - Conference contribution
AN - SCOPUS:84858320408
SN - 9783642289132
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 189
EP - 207
BT - Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Proceedings
T2 - 9th Theory of Cryptography Conference, TCC 2012
Y2 - 19 March 2012 through 21 March 2012
ER -