2011 | OriginalPaper | Buchkapitel
Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security
verfasst von : Marc Fischlin, Benoît Libert, Mark Manulis
Erschienen in: Advances in Cryptology – ASIACRYPT 2011
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 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.