Concurrent non-malleable zero knowledge with adaptive inputs

Huijia Lin*, Rafael Pass

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationTheory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Proceedings
PublisherSpringer Verlag
Pages274-292
Number of pages19
ISBN (Print)9783642195709
DOIs
StatePublished - 2011
Externally publishedYes
Event8th Theory of Cryptography Conference, TCC 2011 - Providence, United States
Duration: 28 Mar 201130 Mar 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6597 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference8th Theory of Cryptography Conference, TCC 2011
Country/TerritoryUnited States
CityProvidence
Period28/03/1130/03/11

Fingerprint

Dive into the research topics of 'Concurrent non-malleable zero knowledge with adaptive inputs'. Together they form a unique fingerprint.

Cite this