Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Communications in computer and information science

Adaptive and Composable Non-interactive String-Commitment Protocols

Huafei Zhu, Tadashi Araragi, Takashi Nishide, Kouichi Sakurai

Published Jan 1, 2012• 0 citations
Publisher
DOI
10.1007/978-3-642-25206-8_15

Related papers

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

Marc Fischlin, Benoît Libert, Mark Manulis

Lecture notes in computer science•Jan 1, 2011•46 citations

Efficient Non-interactive Universally Composable String-Commitment Schemes

Ryo Nishimaki, Eiichiro Fujisaki, Keisuke Tanaka

Lecture notes in computer science•Jan 1, 2009•17 citations

Adaptive and Composable Non-committing Encryptions

Huafei Zhu, Tadashi Araragi, Takashi Nishide +1 more

Lecture notes in computer science•Jan 1, 2010•5 citations

Fast and Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security.

Megha Byali, Arpita Patra, Divya Ravi +1 more

•Jan 1, 2017•12 citations

Improved Non-committing Encryption with Applications to Adaptively Secure Protocols

Seung Geol Choi, Dana Dachman-Soled, Tal Malkin +1 more

Lecture notes in computer science•Jan 1, 2009•77 citations

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

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 1 exponentiations overall, for both the commit and decommit stages). We present 3 a construction that is secure in the presence of static adversaries, and a construction that is secure in the presence of adaptive adversaries with erasures, where the latter construction has an effective additional cost of just 5 1 3 exponentiations. 1

•Jan 1, 2011•0 citations
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 1 exponentiations overall, for both the commit and decommit stages). We present 3 a construction that is secure in the presence of static adversaries, and a construction that is secure in the presence of adaptive adversaries with erasures, where the latter construction has an effective additional cost of just 5 1 3 exponentiations. 1