Concurrent non-malleable zero knowledge with adaptive inputs

Huijia Lin; Rafael Pass

doi:https://doi.org/10.1007/978-3-642-19571-6_17

Concurrent non-malleable zero knowledge with adaptive inputs

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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.

Original language	English
Title of host publication	Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Proceedings
Pages	274-292
Number of pages	19
DOIs	https://doi.org/10.1007/978-3-642-19571-6_17
State	Published - 2011
Externally published	Yes
Event	8th Theory of Cryptography Conference, TCC 2011 - Providence, United States Duration: 28 Mar 2011 → 30 Mar 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6597 LNCS

Conference

Conference	8th Theory of Cryptography Conference, TCC 2011
Country/Territory	United States
City	Providence
Period	28/03/11 → 30/03/11

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

https://doi.org/10.1007/978-3-642-19571-6_17

Cite this

Lin, H., & Pass, R. (2011). Concurrent non-malleable zero knowledge with adaptive inputs. In Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Proceedings (pp. 274-292). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6597 LNCS). https://doi.org/10.1007/978-3-642-19571-6_17

@inproceedings{d05e7f5eb56946d8ac5aae398d9b951e,

title = "Concurrent non-malleable zero knowledge with adaptive inputs",

abstract = "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.",

author = "Huijia Lin and Rafael Pass",

year = "2011",

doi = "https://doi.org/10.1007/978-3-642-19571-6_17",

language = "الإنجليزيّة",

isbn = "9783642195709",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "274--292",

booktitle = "Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Proceedings",

note = "8th Theory of Cryptography Conference, TCC 2011 ; Conference date: 28-03-2011 Through 30-03-2011",

}

Lin, H & Pass, R 2011, Concurrent non-malleable zero knowledge with adaptive inputs. in Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6597 LNCS, pp. 274-292, 8th Theory of Cryptography Conference, TCC 2011, Providence, United States, 28/03/11. https://doi.org/10.1007/978-3-642-19571-6_17

Concurrent non-malleable zero knowledge with adaptive inputs. / Lin, Huijia; Pass, Rafael.
Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Proceedings. 2011. p. 274-292 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6597 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 - https://doi.org/10.1007/978-3-642-19571-6_17

DO - https://doi.org/10.1007/978-3-642-19571-6_17

M3 - منشور من مؤتمر

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

T2 - 8th Theory of Cryptography Conference, TCC 2011

Y2 - 28 March 2011 through 30 March 2011

ER -

Lin H, Pass R. Concurrent non-malleable zero knowledge with adaptive inputs. In Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Proceedings. 2011. p. 274-292. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: https://doi.org/10.1007/978-3-642-19571-6_17

Concurrent non-malleable zero knowledge with adaptive inputs

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this