TY - GEN

T1 - Black-box constructions of two-party protocols from one-way functions

AU - Pass, Rafael

AU - Wee, Hoeteck

PY - 2009

Y1 - 2009

N2 - We exhibit constructions of the following two-party cryptographic protocols given only black-box access to a one-way function: constant-round zero-knowledge arguments (of knowledge) for any language in NP; constant-round trapdoor commitment schemes; constant-round parallel coin-tossing. Previous constructions either require stronger computational assumptions (e.g. collision-resistant hash functions), non-black-box access to a one-way function, or a super-constant number of rounds. As an immediate corollary, we obtain a constant-round black-box construction of secure two-party computation protocols starting from only semi-honest oblivious transfer. In addition, by combining our techniques with recent constructions of concurrent zero-knowledge and non-malleable primitives, we obtain black-box constructions of concurrent zero-knowledge arguments for NP and non-malleable commitments starting from only one-way functions.

AB - We exhibit constructions of the following two-party cryptographic protocols given only black-box access to a one-way function: constant-round zero-knowledge arguments (of knowledge) for any language in NP; constant-round trapdoor commitment schemes; constant-round parallel coin-tossing. Previous constructions either require stronger computational assumptions (e.g. collision-resistant hash functions), non-black-box access to a one-way function, or a super-constant number of rounds. As an immediate corollary, we obtain a constant-round black-box construction of secure two-party computation protocols starting from only semi-honest oblivious transfer. In addition, by combining our techniques with recent constructions of concurrent zero-knowledge and non-malleable primitives, we obtain black-box constructions of concurrent zero-knowledge arguments for NP and non-malleable commitments starting from only one-way functions.

KW - Black-box constructions

KW - Non-malleable commitments

KW - Parallel coin-tossing

KW - Secure two-party computation

KW - Trapdoor commitments

KW - Zero-knowledge arguments

UR - http://www.scopus.com/inward/record.url?scp=70350623264&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-00457-5_24

DO - 10.1007/978-3-642-00457-5_24

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:70350623264

SN - 3642004563

SN - 9783642004568

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 403

EP - 418

BT - Theory of Cryptography - 6th Theory of Cryptography Conference, TCC 2009, Proceedings

T2 - 6th Theory of Cryptography Conference, TCC 2009

Y2 - 15 March 2009 through 17 March 2009

ER -