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

Computationally-Fair Group and Identity-Based Key-Exchange

Andrew Chi-Chih Yao, Yunlei Zhao

Published Jan 1, 2012• 2 citations
Publisher
DOI
10.1007/978-3-642-29952-0_26

Related papers

Identity-based fair multi-party exchange protocol

Mei-mei FAN, Changgen Peng

Journal of Computer Applications•Apr 7, 2009•1 citation

Group-oriented fair exchange of signatures

Qiong Huang, Duncan S. Wong, Willy Susilo

Information Sciences•Apr 13, 2011•19 citations

Attribute-Based Key Exchange with Optimal Efficiency

Liqun Chen, Long Meng, Mark Manulis +2 more

Lecture notes in computer science•Nov 12, 2025•0 citations

An identity-based scheme of fair exchange of digital signatures

Yong Hong Yu, Bo Yang, Yang Guoqing

Fair exchange of digital signatures is an important tool for signing digital contracts, e-payment and other electronic commerce actions. An ID-based scheme of fair exchange of digital signature is proposed in this paper. The protocol relies on a trusted third party, but is “optimistic”, in that the third party is only needed in cases where one player attempts to cheat or simply crashes. The proposed scheme has properties of short signature, low computation and verification cost. It can realize exchange of digital signatures fairly and efficiently. A key feature of our scheme is that it is identity-based, which needs no certificates and has a simple key management. To our best knowledge, this is the first identity-based scheme of fair exchange of digital signatures.

Wuhan University Journal of Natural Sciences•Nov 1, 2006•3 citations

Identity-Based Key Agreement

Colin Boyd, Anish Mathuria, Douglas Stebila

Information security and cryptography•Nov 6, 2019•2 citations

Identity-based constant round group key exchange protocol via secret-share

Chunjie Cao, Jugurta Montalvão

Abstract: Group key management is one of the basic building blocks in securing group communication. A number of solutions to group key exchange have been proposed, but most of them are not scalable and require a number of rounds linear in the number of group members. We formally present a constant-round Identity-based protocol with forward secrecy for group key exchange, which is provably secure in the security model introduced by Bresson et al. Our protocol focuses on round efficiency and the number of communication round is only two. And, the protocol provides a batch verification technique, which simultaneously verifies the validity of messages from other group participants and greatly improves computational efficiency. Moreover, in our protocol, it is no necessary of always-online key generation center during the execution of the protocol compared to other Identity-based protocols. Key-Words:- provable security, identity-based, group key exchange, constant round, secret-share. 1

WSEAS TRANSACTIONS on SYSTEMS archive•Jan 1, 2008•6 citations
Fair exchange of digital signatures is an important tool for signing digital contracts, e-payment and other electronic commerce actions. An ID-based scheme of fair exchange of digital signature is proposed in this paper. The protocol relies on a trusted third party, but is “optimistic”, in that the third party is only needed in cases where one player attempts to cheat or simply crashes. The proposed scheme has properties of short signature, low computation and verification cost. It can realize exchange of digital signatures fairly and efficiently. A key feature of our scheme is that it is identity-based, which needs no certificates and has a simple key management. To our best knowledge, this is the first identity-based scheme of fair exchange of digital signatures.
Abstract: Group key management is one of the basic building blocks in securing group communication. A number of solutions to group key exchange have been proposed, but most of them are not scalable and require a number of rounds linear in the number of group members. We formally present a constant-round Identity-based protocol with forward secrecy for group key exchange, which is provably secure in the security model introduced by Bresson et al. Our protocol focuses on round efficiency and the number of communication round is only two. And, the protocol provides a batch verification technique, which simultaneously verifies the validity of messages from other group participants and greatly improves computational efficiency. Moreover, in our protocol, it is no necessary of always-online key generation center during the execution of the protocol compared to other Identity-based protocols. Key-Words:- provable security, identity-based, group key exchange, constant round, secret-share. 1