An elliptic curve secret sharing key management scheme for mobile <i>ad hoc</i> networks

Dahshan, Hisham; Irvine, James

doi:10.1002/sec.270

Cited by 3 publications

(1 citation statement)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on Shamir's scheme and Elliptic Curve, Hua & Aimin (2010) and Binu & Sreekumar (2017) have both published a method where a set of secrets are shared by Shamir's polynomial coefficients using elliptic curves bilinear pairing and a cryptographic hash function. Moreover, to study key management for MANETs, Dahshan & Irvine (2011) put forward a new scheme for sharing a matrix of secrets among mobile nodes using Lagrange Polynomial Interpolation and ECDLP. His method is divided in two main parts, an offline initialization phase where a central authority distributes pairs of long term public/private keys for each node, and an online phase in which the node with the largest identity number considered as a dealer, generates session keys using his own long term private key, then collects public session keys to reconstruct secrets by interpolation.…”

Section: Related Workmentioning

confidence: 99%

A New Approach to Verifying and Sharing a Secret QR Code using Elliptic Curves

Errahmani

Ikni

2020

myjcam

View full text Add to dashboard Cite

One of the modern applications of cryptography is the sharing of secrets in occurrence keys. Indeed, the need to establish a shared secret key in a multi-user system clearly remains a major problem of trust between users. Therefore, one solution is to share this secret key between users seamlessly. New technologies embedded systems such as sensor networks provide an ideal platform for sharing secrets. In addition, elliptic curves offer an adequate solution for reducing the size of keys, which is suitable for embedded systems. In this article, we propose an approach for sharing a secret leaked in a QR code adapted for a multiuser system, where each user has the ability to verify its share by an access structure. The system allows a recovery without loss of data in this case the QR code used.

show abstract

Section: Related Workmentioning

confidence: 99%

A New Approach to Verifying and Sharing a Secret QR Code using Elliptic Curves

Errahmani

Ikni

2020

myjcam

View full text Add to dashboard Cite

show abstract

Key Management for Beyond 5G Mobile Small Cells: A Survey

et al. 2019

View full text Add to dashboard Cite

The highly anticipated 5G network is projected to be introduced in 2020. 5G stakeholders are unanimous that densification of mobile networks is the way forward. The densification will be realized by means of small cell technology, and it is capable of providing coverage with a high data capacity. The EU-funded H2020-MSCA project ''SECRET'' introduced covering the urban landscape with mobile small cells, since these take advantages of the dynamic network topology and optimizes network services in a cost-effective fashion. By taking advantage of the device-to-device communications technology, large amounts of data can be transmitted over multiple hops and, therefore, offload the general network. However, this introduction of mobile small cells presents various security and privacy challenges. Cryptographic security solutions are capable of solving these as long as they are supported by a key management scheme. It is assumed that the network infrastructure and mobile devices from network users are unable to act as a centralized trust anchor since these are vulnerable targets to malicious attacks. Security must, therefore, be guaranteed by means of a key management scheme that decentralizes trust. Therefore, this paper surveys the state-of-the-art key management schemes proposed for similar network architectures (e.g., mobile ad hoc networks and ad hoc device-to-device networks) that decentralize trust. Furthermore, these key management schemes are evaluated for adaptability in a network of mobile small cells. INDEX TERMS 5G, beyond 5G, decentralized systems, device-to-device communication, key management, mobile small cells, security, small cells, wireless ad hoc networks.

show abstract

Verifiable Self-Selecting Secret Sharing Based on Elliptic Curves

Errahmani

Ikni

2020

International Journal of Software Innovation

View full text Add to dashboard Cite

In distributed systems, as any network architecture, cryptography has a vital role in communication security, and sharing a secret represents a jump in this field where the secret depends on a group instead of a single person. In this article, the authors propose a method to share a multi secrets matrix represented by an image, that could be reconstructed without any loss by an access structure over a distributed system. The presented approach has a verifiable property, where each candidate possesses the advantage to verify the validity of his shadow. The security level of the scheme is based on elliptic curve discrete logarithm problem and the opportunity of allowing each side to generate a private sub-secret key for the sharing. The benefit of this method is justified by the absence of information loss and a lower timing results.

show abstract

An elliptic curve secret sharing key management scheme for mobile ad hoc networks

Cited by 3 publications

References 17 publications

A New Approach to Verifying and Sharing a Secret QR Code using Elliptic Curves

A New Approach to Verifying and Sharing a Secret QR Code using Elliptic Curves

Key Management for Beyond 5G Mobile Small Cells: A Survey

Verifiable Self-Selecting Secret Sharing Based on Elliptic Curves

Contact Info

Product

Resources

About