Go to main content

PDF

Description

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.

Details

Files

Statistics

from
to
Export
Download Full History
Formats
Format
BibTeX
MARCXML
TextMARC
MARC
DublinCore
EndNote
NLM
RefWorks
RIS