Paper 2011/180 Original: eprint.iacr.org/2011/180 ↗
Highly-Efficient Universally-Composable Commitments based on the DDH Assumption
Abstract
Universal composability (or UC security) provides very strong security guarantees for protocols that run in complex real-world environments. In particular, security is guaranteed to hold when the protocol is run concurrently many times with other secure and possibly insecure protocols. Commitment schemes are a basic building block in many cryptographic constructions, and as such universally composable commitments are of great importance in constructing UC-secure protocols. In this paper, we construct highly efficient UC-secure commitments from the standard DDH assumption, in the common reference string model. Our commitment stage is non-interactive, has a common reference string with $O(1)$ group elements, and has complexity of $O(1)$ exponentiations for committing to a group element (to be more exact, the effective cost is that of $23\frac{1}{3}$ exponentiations overall, for both the commit and decommit stages). Our scheme is secure in the presence of static adversaries.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2013-03-05: last updated
- 2011-04-08: published
- Short URL
- https://ia.cr/2011/180
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2011/180,
author = {Yehuda Lindell},
title = {Highly-Efficient Universally-Composable Commitments based on the DDH Assumption},
howpublished = {Cryptology {ePrint} Archive, Paper 2011/180},
year = {2011},
url = {https://eprint.iacr.org/2011/180}
}