Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security

  • Marc Fischlin
  • Benoît Libert
  • Mark Manulis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7073)

Abstract

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.

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

  • Marc Fischlin
    • 1
  • Benoît Libert
    • 2
  • Mark Manulis
    • 1
  1. 1.TU Darmstadt & CASEDGermany
  2. 2.ICTEAM InstituteUniversité catholique de LouvainBelgium

Personalised recommendations