A conference key distribution system

Ingemarsson, Ingemar; Tang, Deng; Wong, Ching

doi:10.1109/tit.1982.1056542

Cited by 446 publications

(240 citation statements)

References 3 publications

Supporting

Mentioning

238

Contrasting

Unclassified

Order By: Relevance

“…In [1] the CKDS concept was first introduced. In [2] a CKDS with user anonymity based on an algebraic approach was proposed with the use of one-way hash functions to hide the identities of the attendants.…”

Section: Review Of Related Workmentioning

confidence: 99%

SAnoVS: Secure anonymous voting scheme for clustered ad hoc networks

Komninos

Tselikis

Douligeris

2013

2013 IEEE Symposium on Computers and Communications (ISCC)

View full text Add to dashboard Cite

Abstract-In this paper we propose a secure anonymous voting scheme (SAnoVS) for re-clustering in the ad-hoc network. SAnoVS extends our previous work of degree-based clustering algorithms by achieving anonymity and confidentiality of the voting procedure applied to select new cluster heads. The security of SAnoVS is based on the difficulty of computing discrete logarithms over elliptic curves, the intractability of inverting a one-way hash function and the fact that only neighboring nodes contribute to the generation of a shared secret. Furthermore, we achieve anonymity since our scheme does not require any identification information as we make use of a polynomial equation system combined with pseudo-random coordinates. The security analysis of our scheme is demonstrated with several attacks scenarios.examined with several attack scenarios and experimental results.

show abstract

Section: Review Of Related Workmentioning

confidence: 99%

SAnoVS: Secure anonymous voting scheme for clustered ad hoc networks

Komninos

Tselikis

Douligeris

2013

2013 IEEE Symposium on Computers and Communications (ISCC)

View full text Add to dashboard Cite

show abstract

“…He showed how to compile the so-called family of Group Diffie-Hellman protocols, i.e. protocols such as [13,16,19,24,25,[30][31][32] which extend the classical Diffie-Hellman method to the group setting, in such a way, that at the end of the protocol any pair of users can derive their own p2p key on-demand and without subsequent communication. The main building block of his GKE+P compiler is the parallel Diffie-Hellman key exchange (PDHKE) in which each user broadcasts a value of the form g x and uses x for the derivation of different p2p keys.…”

Section: Related Workmentioning

confidence: 99%

Flexible Group Key Exchange with On-demand Computation of Subgroup Keys

Abdalla

Chevalier

Manulis

et al. 2010

Progress in Cryptology – AFRICACRYPT 2010

View full text Add to dashboard Cite

Abstract. Modern multi-user communication systems, including popular instant messaging tools, social network platforms, and cooperative-work applications, offer flexible forms of communication and exchange of data. At any time point concurrent communication sessions involving different subsets of users can be invoked. The traditional tool for achieving security in a multi-party communication environment are group key exchange (GKE) protocols that provide participants with a secure group key for their subsequent communication. Yet, in communication scenarios where various user subsets may be involved in different sessions the deployment of classical GKE protocols has clear performance and scalability limitations as each new session should be preceded by a separate execution of the protocol. The motivation of this work is to study the possibility of designing more flexible GKE protocols allowing not only the computation of a group key for some initial set of users but also efficient derivation of independent secret keys for all potential subsets. In particular we improve and generalize the recently introduced GKE protocols enabling on-demand derivation of peer-to-peer keys (so called GKE+P protocols). We show how a group of users can agree on a secret group key while obtaining some additional information that they can use on-demand to efficiently compute independent secret keys for any possible subgroup. Our security analysis relies on the Gap Diffie-Hellman assumption and uses random oracles.

show abstract

“…The group KE protocols proposed by Ingemarsson et al [43], Burmester and Desmedt [29], and Steiner et al [58] may be the most well-known. Among them, Burmester-Desmedt protocol has been shown to be secure against passive eavesdropping in the standard model by Katz and Yung [48].…”

Section: Group Key Exchangementioning

confidence: 99%

“…A number of works have considered extending the 2-party Diffie-Hellman protocol [36] to the multi-party setting [43,57,29,58,10,50,51]. Among them, the works of Ingemarsson et al [43], Burmester and Desmedt [29], and Steiner et al [58] may be the most well-known. They are merely key exchange (KE) protocols, intended to be secure against a passive adversary only.…”

Section: Introductionmentioning

confidence: 99%

ID-Based Group Password-Authenticated Key Exchange

Tso

Okamoto

2009

Advances in Information and Computer Security

View full text Add to dashboard Cite

Abstract-Password-authenticated key exchange (PAKE) protocols are designed to be secure even when the secret key used for authentication is a human-memorable password. In this paper, we consider PAKE protocols in the group scenario, in which a group of clients, each of them shares a password with an "honest but curious" server, intend to establish a common secret key (i.e., a group key) with the help of the server. In this setting, the key established is known to the clients only and no one else, including the server. Each client needs to remember passwords only while the server keeps passwords in addition to private keys related to his identity. Towards our goal, we present a compiler that transforms any group key exchange (KE) protocol secure against a passive eavesdropping to a group PAKE which is secure against an active adversary who controls all communication in the network. This compiler is built on any group KE protocol (e.g., the Burmester-Desmedt protocol), any identity-based encryption (IBE) scheme (e.g., Gentry's scheme), and any identity-based signature (IBS) scheme (e.g., Paterson-Schuldt scheme). It adds only two rounds and O(1) communication (per client) to the original group KE protocol. As long as the underlying group KE protocol, IBE scheme and an IBS scheme have provably security without random oracles, a group PAKE constructed by our compiler can be proven to be secure without random oracles.

show abstract

A conference key distribution system

Cited by 446 publications

References 3 publications

SAnoVS: Secure anonymous voting scheme for clustered ad hoc networks

SAnoVS: Secure anonymous voting scheme for clustered ad hoc networks

Flexible Group Key Exchange with On-demand Computation of Subgroup Keys

ID-Based Group Password-Authenticated Key Exchange

Contact Info

Product

Resources

About