We study the black-box complexity of non-malleable encryption and statistically hiding commitments. We present a black-box construction of a non-malleable encryption scheme from any semantically secure one, and a lower bound on the round complexity of a class of black-box constructions of statistically hiding commitments from one-way permutations.
Title
Black-Box Complexity of Encryption and Commitment
Published
2007-12-06
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
EECS-2007-144
Type
Text
Extent
60 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
