Non-Interactive and Re-Usable Universally Composable String Commitments with Adaptive Security

M Fischlin; B Libert; M Manulis

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

Back

Conference presentation

Non-Interactive and Re-Usable Universally Composable String Commitments with Adaptive Security

M Fischlin, B Libert and M Manulis

Lecture Notes in Computer Science: Advances in Cryptology – ASIACRYPT 2011, Vol.7073, pp.468-485

17th International Conference on the Theory and Application of Cryptology and Information Security (Seoul, South Korea, 04/12/2011 - 08/12/2011)

28/03/2017

DOI: https://doi.org/10.1007/978-3-642-25385-0_25

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.

Metrics

27 Record Views

See more details

Details

Title: Non-Interactive and Re-Usable Universally Composable String Commitments with Adaptive Security
Creators: M Fischlin
B Libert
M Manulis
Contributors: Springer (null)
Publication Details: Lecture Notes in Computer Science: Advances in Cryptology – ASIACRYPT 2011, Vol.7073, pp.468-485
Conference: 17th International Conference on the Theory and Application of Cryptology and Information Security (Seoul, South Korea, 04/12/2011 - 08/12/2011)
Date submitted: 12/02/2013
Identifiers: 99516753502346
Academic Unit: University of Surrey
Resource Type: Conference presentation

Non-Interactive and Re-Usable Universally Composable String Commitments with Adaptive Security

Abstract

Metrics

Details

Usage Policy