Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
Black-Box Constructions of Two-Party Protocols from One-Way Functions
verfasst von : Rafael Pass, Hoeteck Wee
Erschienen in: Theory of Cryptography
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.