Skip to main content
Conference ProceedingsOPEN ACCESS

Non-interactive and re-usable universally composable string commitments with adaptive security

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 7073 LNCS 468-485
DOI: 10.1007/978-3-642-25385-0_25
33Citations
Citations of this article
37Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2011 International Association for Cryptologic Research.

Cite

CITATION STYLE

APA

Fischlin, M., Libert, B., & Manulis, M. (2011). Non-interactive and re-usable universally composable string commitments with adaptive security. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7073 LNCS, pp. 468–485). https://doi.org/10.1007/978-3-642-25385-0_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free