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

Journal of Computer Applications

Universally composable security of identity-based signature schemes

Zecheng Wang

Published Mar 21, 2011• 0 citations
Publisher
DOI
10.3724/sp.j.1087.2011.00118

Related papers

Universal composable security of multi-signature schemes

Zecheng Wang, Zhibin Li

Journal of Computer Applications•Dec 14, 2010•0 citations

Universally Composable Identity-Based Signature

Dingfeng Ye

Idea Functionality is the core and basic unit of Universally Composable(UC) security protocols.The first step of designing the protocols,within the UCsecurity framework,is to extract an ideal functionality from the expected functionalities of the protocols.To appropriately define an ideal functionality we should not only protect the security of the definition,but also consider the realizability.This study investigates the security of identity-based signature(IBS) within the UCframework,defines a realizable identity-based signature functionality FIBS,proves that UC-secure IBS is equivalent to conventionally-secure(EUF-CMIA-secure) IBS.As a result,we are able to make sure that the EUFCMIA scheme can be a module in designing a complex protocol that satisfies the UCrequirement.

Dianzi xuebao•Jan 1, 2011•0 citations

Universally Composable Identity-Based Encryption

Ryo Nishimaki, Yoshifumi Manabe, Tatsuaki Okamoto

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

Tightly Secure Identity-Based Signature from Cryptographic Group Actions

Xuan Thanh Khuc, Willy Susilo, Dung Hoang Duong +3 more

Lecture notes in computer science•Jan 1, 2025•0 citations

Universally Composable Group Signature Protocol

ZHAO Chen,YU Huifang,LI Jianmin

At present,most group signature is only secure in the standard alone.Its security becomes weak in multiple protocol environment.In view of this,the security of group signature protocol is studied in the multiple concurrent execution under the universally composable framework.Since the protocol can be analyzed modularly under the universally composable framework,an ideal function of group signature protocol is defined in this framework.Then a group signature protocol is proposed to realize the ideal function,and its universally composable security as well as unforgeability is also proved.Furthermore,a concrete instance of this universally composable group signature protocol is given.Analysis results show that this protocol security is suitable for applications in multiple concurrent environment.

•Mar 1, 2017•0 citations

Universally Composable Undeniable Signature.

Kaoru Kurosawa, Jun Furukawa

Abstract. How to define the security of undeniable signature schemes is a challenging task. This paper presents two security definitions of undeniable signature schemes which are more useful or natural than the existing definition. It then proves their equivalence. We first define the UC-security, where UC means universal composability. We next show that there exists a UC-secure undeniable signature scheme which does not satisfy the standard definition of security that has been believed to be adequate so far. More precisely, it does not satisfy the invisibility defined by [10]. We then show a more adequate definition of invisibility which captures a wider class of (naturally secure) undeniable signature schemes. We finally prove that the UC-security against non-adaptive adversaries is equivalent to this definition of invisibility and the strong unforgeability in FZK-hybrid model, where FZK is the ideal ZK functionality. Our result of equivalence implies that all the known proven secure undeniable signature schemes (including Chaum’s scheme) are UC-secure if the confirmation/disavowal protocols are both UC zero-knowledge.

•Jan 1, 2008•2 citations
Idea Functionality is the core and basic unit of Universally Composable(UC) security protocols.The first step of designing the protocols,within the UCsecurity framework,is to extract an ideal functionality from the expected functionalities of the protocols.To appropriately define an ideal functionality we should not only protect the security of the definition,but also consider the realizability.This study investigates the security of identity-based signature(IBS) within the UCframework,defines a realizable identity-based signature functionality FIBS,proves that UC-secure IBS is equivalent to conventionally-secure(EUF-CMIA-secure) IBS.As a result,we are able to make sure that the EUFCMIA scheme can be a module in designing a complex protocol that satisfies the UCrequirement.
At present,most group signature is only secure in the standard alone.Its security becomes weak in multiple protocol environment.In view of this,the security of group signature protocol is studied in the multiple concurrent execution under the universally composable framework.Since the protocol can be analyzed modularly under the universally composable framework,an ideal function of group signature protocol is defined in this framework.Then a group signature protocol is proposed to realize the ideal function,and its universally composable security as well as unforgeability is also proved.Furthermore,a concrete instance of this universally composable group signature protocol is given.Analysis results show that this protocol security is suitable for applications in multiple concurrent environment.
Abstract. How to define the security of undeniable signature schemes is a challenging task. This paper presents two security definitions of undeniable signature schemes which are more useful or natural than the existing definition. It then proves their equivalence. We first define the UC-security, where UC means universal composability. We next show that there exists a UC-secure undeniable signature scheme which does not satisfy the standard definition of security that has been believed to be adequate so far. More precisely, it does not satisfy the invisibility defined by [10]. We then show a more adequate definition of invisibility which captures a wider class of (naturally secure) undeniable signature schemes. We finally prove that the UC-security against non-adaptive adversaries is equivalent to this definition of invisibility and the strong unforgeability in FZK-hybrid model, where FZK is the ideal ZK functionality. Our result of equivalence implies that all the known proven secure undeniable signature schemes (including Chaum’s scheme) are UC-secure if the confirmation/disavowal protocols are both UC zero-knowledge.