[Resource Topic] 2011/180: Highly-Efficient Universally-Composable Commitments based on the DDH Assumption

Welcome to the resource topic for 2011/180

Highly-Efficient Universally-Composable Commitments based on the DDH Assumption

Authors: Yehuda Lindell


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.

ePrint: https://eprint.iacr.org/2011/180

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .