Hoe Teck Wee

EECS Department, University of California, Berkeley

Technical Report No. UCB/EECS-2007-144

December 6, 2007

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2007/EECS-2007-144.pdf

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.

Advisors: Luca Trevisan

---

BibTeX citation:

@phdthesis{Wee:EECS-2007-144,
    Author= {Wee, Hoe Teck},
    Title= {Black-Box Complexity of Encryption and Commitment},
    School= {EECS Department, University of California, Berkeley},
    Year= {2007},
    Month= {Dec},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2007/EECS-2007-144.html},
    Number= {UCB/EECS-2007-144},
    Abstract= {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.},
}

EndNote citation:

%0 Thesis
%A Wee, Hoe Teck 
%T Black-Box Complexity of Encryption and Commitment
%I EECS Department, University of California, Berkeley
%D 2007
%8 December 6
%@ UCB/EECS-2007-144
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2007/EECS-2007-144.html
%F Wee:EECS-2007-144