A suite of algorithms for key distribution and authentication in centralized secure multicast environments

Naranjo, J. A. M.; Antequera, N.; Casado, Leocadio G.; López-Ramos, J. A.

doi:10.1016/j.cam.2011.02.015

Cited by 28 publications

(47 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, it also increases the workload of key server by allowing the key server to find a common group key by using CRT for ' n ' number of congruential equations. Naranjo et al [5] presented a key management scheme for three sample applications to provide security and privacy. Vijayakumar et al [21] proposed a ternary tree-based key distribution protocol, which substantially reduced the communication and computation complexities of the key server and the respective group members during the update operations in their key values.…”

Section: Literature Surveymentioning

confidence: 99%

See 1 more Smart Citation

An efficient group key agreement protocol for secure P2P communication

Vijayakumar¹,

Naresh²,

Deborah³

et al. 2016

Security Comm Networks

View full text Add to dashboard Cite

The efficient design of a distributed group key management for a peer to peer (P2P) network with minimal computation complexity in dynamic secure group communication is a challenging issue. This is because of the absence of a centralized coordinator. In order to provide this facility, a self-composed distributed group key management framework is proposed for secure P2P communication. In this proposed work, group key computation is performed using Chinese remainder theorem and secure communication is performed through RSA encryption algorithm. This self-composed key management is a one round protocol in which a shared group key is generated using the public key of each individual user, and it is derived from the respective private key. The main advantage of the group key management scheme proposed in this paper is that it reduces the computation complexity of the peer users to O(1). This reduction in computation complexity is achieved by performing one addition and multiplication operation during a single member join and one subtraction operation during a single member leave operation. The proposed algorithm has been implemented and analyzed with well-known existing distributed group key management protocols and observed that it reduces the computation complexity significantly.

show abstract

Section: Literature Surveymentioning

confidence: 99%

“…In the proposed key management scheme, we require that all the m i values selected are prime numbers [19,20,5], [12]. The Initialization block of the sponsor user generates the m i value and provides these values to the other corresponding peer users in a secure manner.…”

Section: (A) Proposed Group Key Management Protocolmentioning

confidence: 99%

An efficient group key agreement protocol for secure P2P communication

Vijayakumar¹,

Naresh²,

Deborah³

et al. 2016

Security Comm Networks

View full text Add to dashboard Cite

show abstract

“…The fact that the user sends H 1 (T ) instead of T is basically due to the ticket T is private and it should not be known by anyone else since it will be used to access the session key (cf. [6], [12] or [17] for example) but it is necessary to know H 1 (T ) in order to check validity of the license.…”

Section: Service Requestmentioning

confidence: 99%

“…The server broadcasts a new K S that will allow the user to get the service, encrypted using this new private ticket T and the user will get K S as usual in any secure multicast protocol ( [2,21] or [6,12] and [17] for a specific case).…”

Section: Service Requestmentioning

confidence: 99%

See 1 more Smart Citation

A blind signature-based protocol for tracing traitors

Álvarez

Lodroman

López-Ramos

2014

International Journal of Computer Mathematics

Self Cite

View full text Add to dashboard Cite

We introduce a protocol based on blind signatures using elliptic curves that allows to trace those users of any service, traitors, that share their legitimate license with other people, avoiding the abuse or the unauthorized use of legal licenses. We show that our protocol is incapable of implicating innocent users in the illegal distribution of licenses and that tracing produces indisputable proof for the implication of the traitors. We also show that our protocol provides anonymity to users unless they share their private information and compare it to other existing schemes. We also provide an implementation showing its practical application.

show abstract

ECDSEC: An Efficient Group Key Management Scheme for Secure Data Sharing Among Mobile Users in Cloud Environments

Ganesh¹,

Manikandan

2020

Second International Conference on Computer Networks and Communication Technologies

View full text Add to dashboard Cite

A suite of algorithms for key distribution and authentication in centralized secure multicast environments

Cited by 28 publications

References 15 publications

An efficient group key agreement protocol for secure P2P communication

An efficient group key agreement protocol for secure P2P communication

A blind signature-based protocol for tracing traitors

ECDSEC: An Efficient Group Key Management Scheme for Secure Data Sharing Among Mobile Users in Cloud Environments

Contact Info

Product

Resources

About