An authenticated group key distribution mechanism using theory of numbers

Liu, Yanjun; Harn, Lein; Chang, Chin‐Chen

doi:10.1002/dac.2569

Cited by 13 publications

(6 citation statements)

References 29 publications

(51 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Determine i 0 by 4Step 3. Determine D L by (8) Step 4. Select two unordered secrets s 1 , s 2 satisfying 9Step 5.…”

Section: □ Remarkmentioning

confidence: 99%

“…It shows that the secret can be recovered by any no less than t shares, while the recovery failure with fewer than t shares. Besides this kind of SS scheme, there are many other types, such as Mignotte's scheme [6], the Chinese Remainder eorem-(CRT-) based Asmuth-Bloom scheme [7] and its generalizations [8,9], and ramp secret-sharing scheme [10,11].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Unordered Multisecret Sharing Based on Generalized Chinese Remainder Theorem

Chen

Liu

et al. 2020

Security and Communication Networks

Self Cite

View full text Add to dashboard Cite

Multisecret sharing schemes have been widely used in the area of information security, such as cloud storage, group authentication, and secure parallel communications. One of the issues for these schemes is to share and recover multisecret from their shareholders. However, the existing works consider the recovery of multisecret only when the correspondences between the secrets and their shares are definite. In this paper, we propose a multisecret sharing scheme to share and recover two secrets among the participants based on the generalized Chinese Remainder Theorem (GCRT), where the multisecret and their shares are unordered. To overcome the leakage of information, we propose an improved scheme including the improved sharing phase and the recovery phase. The improved scheme has not only a more secure performance but also a lower computation complexity. The conditions for recovery failure and success are also explored.

show abstract

“…Determine i 0 by 4Step 3. Determine D L by (8) Step 4. Select two unordered secrets s 1 , s 2 satisfying 9Step 5.…”

Section: □ Remarkmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Unordered Multisecret Sharing Based on Generalized Chinese Remainder Theorem

Chen

Liu

et al. 2020

Security and Communication Networks

Self Cite

View full text Add to dashboard Cite

show abstract

“…x S , are needed to recover a polynomial of degree t-1 in (t, n)-SSS. This scheme has been proven to be unconditionally secure [13][14][15], and it is used extensively in many applications of information security, such as group key distribution protocols [16][17][18], group authentication [19], and data outsourcing systems [9][10][11]. The following example illustrates the execution of a (3, 3)-SSS.…”

Section: Secret Reconstruction Proceduresmentioning

confidence: 99%

A Fast and Secure Scheme for Data Outsourcing in the Cloud

2014

KSII TIIS

View full text Add to dashboard Cite

Data outsourcing in the cloud (DOC) is a promising solution for data management at the present time, but it could result in the disclosure of outsourced data to unauthorized users. Therefore, protecting the confidentiality of such data has become a very challenging issue. The conventional way to achieve data confidentiality is to encrypt the data via asymmetric or symmetric encryptions before outsourcing. However, this is computationally inefficient because encryption/decryption operations are time-consuming. In recent years, a few DOC schemes based on secret sharing have emerged due to their low computational complexity. However, Dautrich and Ravishankar pointed out that most of them are insecure against certain kinds of collusion attacks. In this paper, we proposed a novel DOC scheme based on Shamir's secret sharing to overcome the security issues of these schemes. Our scheme can allow an authorized data user to recover all data files in a specified subset at once rather than one file at a time as required by other schemes that are based on secret sharing. Our thorough analyses showed that our proposed scheme is secure and that its performance is satisfactory.

show abstract

“…3,4 This is because most broadcast environments allow any user to receive the broadcast information. 3,4 This is because most broadcast environments allow any user to receive the broadcast information.…”

Section: Introductionmentioning

confidence: 99%

“…With the increasing popularity of group-oriented applications 1,2 such as broadcast transmission systems, there is a growing demand for security services to achieve secure group communication. 3,4 This is because most broadcast environments allow any user to receive the broadcast information. 5,6 A common way to ensure secure group communication is to encrypt the messages using a key, 5 called group key.…”

Section: Introductionmentioning

confidence: 99%

A novel self‐healing key distribution scheme based on vector space access structure and MDS codes

Vadlamudi

Vadlamudi²

2019

Int J Communication

View full text Add to dashboard Cite

Self-healing group key distribution protocols are useful in applications that have a dynamic group structure. These include broadcast transmission systems and multicast networks such as pay-per-view television, embedded and sensor networks, and cellular and wireless networks. To cater to the requirements of these applications, several self-healing group key distribution protocols are proposed in the literature. Many of these schemes are vulnerable to polynomial factorization or insider replay attacks. Some other schemes impose constraints on the users joining the group or revoked from the group. Motivated by these and other shortcomings of the existing schemes, we hereby propose a novel self-healing group key distribution protocol. Some of the features of this scheme include that (a) the number and the set of revoked users is not constrained, (b) the communication group can consist of any set of users, and (c) a revoked user is allowed to rejoin the group in any of the later sessions. The scheme is analyzed for its security, and it is found to provide anywise forward and backward secrecy. It is also found to resist anywise collusion attack. Communication and computation complexity of the scheme is analyzed; while doing so, various possible realizations of the scheme is discussed. In addition to the theoretical analysis, the proposed scheme is experimentally verified for its correctness using OMNET++ network simulator. KEYWORDSgroup key distribution, MDS codes, self-healing, vector space access structure Int J Commun Syst. 2019;32:e4088.wileyonlinelibrary.com/journal/dac Wireless networks, especially mobile wireless ad hoc networks, are likely to be unreliable and highly dynamic in the sense that the nodes may move in and out of range frequently and sometimes be completely separate from the network. Also, an adversary may intentionally disrupt the wireless communication using various methods. 5 A good group key mechanism should be resilient to this dynamic nature of the network as well as to the said attacks of the adversary. So, a specialized group key distribution protocols, known as self-healing group key distribution protocols, have been proposed in the literature. 7-15 These are useful in several settings such as group keys needed to be used for a short period because of frequent changes in the group structure. 12,14,16 In these protocols, group lifetime is divided into epochs called sessions, 7,8,12,17 where each session has a unique group key. At the beginning of each session, the GM transmits a broadcast message in order to provide a common key, called the session key, to each member of the group. 12,16 Every user belonging to the group computes the group key using the message and some private information.Using self-healing key distribution schemes, users, in a large and dynamic group communication over an unreliable network, can recover lost session keys on their own, even if some previous key distribution messages are lost, without requesting additional transmissions from the GM. 7,8,14,16,18,19 That is,...

show abstract

An authenticated group key distribution mechanism using theory of numbers

Cited by 13 publications

References 29 publications

Unordered Multisecret Sharing Based on Generalized Chinese Remainder Theorem

Unordered Multisecret Sharing Based on Generalized Chinese Remainder Theorem

A Fast and Secure Scheme for Data Outsourcing in the Cloud

A novel self‐healing key distribution scheme based on vector space access structure and MDS codes

Contact Info

Product

Resources

About