International Conference on the Theory and Application of Cryptology and Information Security

ASIACRYPT 2011: Advances in Cryptology – ASIACRYPT 2011 pp 468-485

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

  • Marc Fischlin
  • Benoît Libert
  • Mark Manulis
Conference paper

DOI: 10.1007/978-3-642-25385-0_25

Volume 7073 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Fischlin M., Libert B., Manulis M. (2011) Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security. In: Lee D.H., Wang X. (eds) Advances in Cryptology – ASIACRYPT 2011. ASIACRYPT 2011. Lecture Notes in Computer Science, vol 7073. Springer, Berlin, Heidelberg

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.

Download to read the full conference paper text

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