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

A Framework for Universally Composable Non-committing Blind Signatures

Masayuki Abe, Miyako Ohkubo

Published Jan 1, 2009• 46 citations
Publisher
DOI
10.1007/978-3-642-10366-7_26

Related papers

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

Round-Optimal Composable Blind Signatures in the Common Reference String Model

Marc Fischlin

Lecture notes in computer science•Jan 1, 2006•163 citations

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 and Universally Composable Committed Oblivious Transfer and Applications

Juan A. Garay, PHILIP D. MACKENZIE, Ke Yang

Lecture notes in computer science•Jan 1, 2004•60 citations

Efficient and Universally Composable Committed Oblivious Transfer and Applications

Juan A. Garay, PHILIP D. MACKENZIE, Ke Yang

Springer eBooks•Jan 26, 2007•2 citations