Advances in Cryptology – ASIACRYPT 2011

Volume 7073 of the series Lecture Notes in Computer Science pp 468-485

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

  • Marc FischlinAffiliated withTU Darmstadt & CASED
  • , Benoît LibertAffiliated withICTEAM Institute, Université catholique de Louvain
  • , Mark ManulisAffiliated withTU Darmstadt & CASED


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.