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

Lecture notes in computer science

Equivocable and Extractable Commitment Schemes

Giovanni Di Crescenzo

Published Jan 1, 2003• 12 citations
Publisher
DOI
10.1007/3-540-36413-7_6

Related papers

Long-Term Secure Commitments via Extractable-Binding Commitments

Ahto Buldas, Matthias Geihs, Johannes A Buchmann

Lecture notes in computer science•Jan 1, 2017•7 citations

Non-interactive Equivocable Commitment from Lossy Encryption

Weiwei Sun -, Bo Yang, Ximing Li

Journal of Convergence Information Technology•May 24, 2012•1 citation

Input-Aware Equivocable Commitments and UC-secure Commitments with Atomic Exchanges

Ioana Boureanu, Serge Vaudenay B

Lecture notes in computer science•Jan 1, 2013•2 citations

DL-Extractable UC-Commitment Schemes

Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa +2 more

Lecture notes in computer science•Jan 1, 2019•8 citations

Efficient Non-malleable Commitment Schemes

Marc Fischlin, Roger Fischlin

Lecture notes in computer science•Jan 1, 2000•84 citations

Adaptive and composable multi-media transcoders

Huafei Zhu

In this paper, a new construction of adaptive and composable transcoders from universally composabley secure (the uc-security) commitments is introduced and analyzed. Our transcoder is built on the top of scalable video coding standard, known as H.264/SVC. The idea behind of our implementation is simple: a base layer of streams is encoded by an extractable key while an enhanced layer of streams is encoded by an equivocable key of the underlying universally composable commitment scheme. We show that our construction reaches the UC-security in the presence of adaptive adversaries in the common reference string model assuming that the underlying Paillier's public-key encryption scheme is semantically secure and the Damgård-Fazio-Nicolosi's non-interactive protocol is zero-knowledge in the registered public-key model. Furthermore, if the underlying Paillier's public-key encryption scheme is replaced by Damgård-Jurik's length-flexible public key encryption scheme, then the derived adaptive and composable transcoder is length-flexible as well.

IEEE International Conference on Ubi-Media Computing•Jul 1, 2010•1 citation
In this paper, a new construction of adaptive and composable transcoders from universally composabley secure (the uc-security) commitments is introduced and analyzed. Our transcoder is built on the top of scalable video coding standard, known as H.264/SVC. The idea behind of our implementation is simple: a base layer of streams is encoded by an extractable key while an enhanced layer of streams is encoded by an equivocable key of the underlying universally composable commitment scheme. We show that our construction reaches the UC-security in the presence of adaptive adversaries in the common reference string model assuming that the underlying Paillier's public-key encryption scheme is semantically secure and the Damgård-Fazio-Nicolosi's non-interactive protocol is zero-knowledge in the registered public-key model. Furthermore, if the underlying Paillier's public-key encryption scheme is replaced by Damgård-Jurik's length-flexible public key encryption scheme, then the derived adaptive and composable transcoder is length-flexible as well.