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

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

Marc Fischlin, Benoît Libert, Mark Manulis

Published Jan 1, 2011• 46 citations
Publisher
DOI
10.1007/978-3-642-25385-0_25

Related papers

Adaptive and Composable Non-interactive String-Commitment Protocols

Huafei Zhu, Tadashi Araragi, Takashi Nishide +1 more

Communications in computer and information science•Jan 1, 2012•0 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

Universally Composable Non-committing Encryptions in the Presence of Adaptive Adversaries

Huafei Zhu, Tadashi Araragi, Takashi Nishide +1 more

Communications in computer and information science•Jan 1, 2012•3 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

Adaptive and Composable Non-committing Encryptions

Huafei Zhu, Tadashi Araragi, Takashi Nishide +1 more

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

A Framework for Universally Composable Non-committing Blind Signatures

Masayuki Abe, Miyako Ohkubo

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