2011 | OriginalPaper | Chapter
Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security
Authors : Marc Fischlin, Benoît Libert, Mark Manulis
Published in: Advances in Cryptology – ASIACRYPT 2011
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We present the first provably secure constructions of universally composable (UC) commitments (in pairing-friendly groups) that simultaneously combine the key properties of being
non-interactive
, supporting commitments to
strings
(instead of bits only), and offering
re-usability of the common reference string
for multiple commitments. Our schemes are also
adaptively secure
assuming reliable erasures.