TY - GEN
T1 - Concurrent non-malleable zero knowledge with adaptive inputs
AU - Lin, Huijia
AU - Pass, Rafael
PY - 2011
Y1 - 2011
N2 - Concurrent non-malleable zero-knowledge (CNMZK) considers the concurrent execution of zero-knowledge protocols in a setting where the attacker can simultaneously corrupt multiple provers and verifiers. We provide the first construction of a CNMZK protocol that, without any trusted set-up, remains secure even if the attacker may adaptively select the statements to receive proofs of; previous works only handle scenarios where the statements are fixed at the beginning of the execution, or chosen adaptively from a restricted set of statements.
AB - Concurrent non-malleable zero-knowledge (CNMZK) considers the concurrent execution of zero-knowledge protocols in a setting where the attacker can simultaneously corrupt multiple provers and verifiers. We provide the first construction of a CNMZK protocol that, without any trusted set-up, remains secure even if the attacker may adaptively select the statements to receive proofs of; previous works only handle scenarios where the statements are fixed at the beginning of the execution, or chosen adaptively from a restricted set of statements.
UR - http://www.scopus.com/inward/record.url?scp=79953204934&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-19571-6_17
DO - 10.1007/978-3-642-19571-6_17
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:79953204934
SN - 9783642195709
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 274
EP - 292
BT - Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Proceedings
PB - Springer Verlag
T2 - 8th Theory of Cryptography Conference, TCC 2011
Y2 - 28 March 2011 through 30 March 2011
ER -