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

International Conference on Security and Cryptography

UNIVERSALLY COMPOSABLE NON-COMMITTING ENCRYPTIONS IN THE PRESENCE OF ADAPTIVE ADVERSARIES

Huafei Zhu, Tadashi Araragi, Takashi Nishide, Kouichi Sakurai

Published Jan 1, 2010• 0 citations
Publisher
DOI
10.5220/0002985003890398

Related papers

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

ADAPTIVE AND COMPOSABLE NON-INTERACTIVE STRING-COMMITMENT PROTOCOLS

Huafei Zhu, Tadashi Araragi, Takashi Nishide +1 more

International Conference on Security and Cryptography•Jan 1, 2010•1 citation

UNIVERSALLY COMPOSABLE BLIND SIGNATURE FUNCTIONALITY

Shirley Cheung, C. H. LEE, Yunlei Zhao

Blind signatures play a critical role in digital cash systems. In this paper, we investigate the blind signature functionality in the framework of universally composable (UC) security — the strongest security guarantees up to now for cryptographic protocols over the Internet. We present the universally composable blind signature functionality, [Formula: see text]. Our approach is based on a new UC signature functionality [Formula: see text], which is a modified version of the original signature functionality [Formula: see text] presented by Canetti. We also prove that [Formula: see text] and [Formula: see text] are actually equivalent with respect to non-adaptive adversaries. Our result is of both theoretical and practical consequence to future research studies and practical implementations of digital cash systems with universally composable security.

International Journal of Information Technology & Decision Making•Dec 1, 2004•0 citations

Public-Key Encryptions Tolerating Adaptive and Composable Adversaries

Huafei Zhu

Lecture notes in computer science•Jan 1, 2011•0 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

WHAT IF QUANTUM MECHANICS IS UNIVERSALLY VALID?

Peter Mittelstaedt

•Nov 1, 2001•1 citation
Blind signatures play a critical role in digital cash systems. In this paper, we investigate the blind signature functionality in the framework of universally composable (UC) security — the strongest security guarantees up to now for cryptographic protocols over the Internet. We present the universally composable blind signature functionality, [Formula: see text]. Our approach is based on a new UC signature functionality [Formula: see text], which is a modified version of the original signature functionality [Formula: see text] presented by Canetti. We also prove that [Formula: see text] and [Formula: see text] are actually equivalent with respect to non-adaptive adversaries. Our result is of both theoretical and practical consequence to future research studies and practical implementations of digital cash systems with universally composable security.