Authenticated logarithmic-order supersingular isogeny group key exchange

Hougaard, Hector B.; Miyaji, Atsuko

doi:10.1007/s10207-021-00549-4

Cited by 5 publications

(5 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The protocol presented in [1] by Fujioka et al is based on the problem of finding isogeny mappings between two supersingular elliptic curves with the same number of points. In the same line, Hougaard and Miyaji presented in [2] several designs based on isogenies. The authenticated protocols are named A-SIT and A-P2P-SIT, with the latter being the peer-to-peer version of A-SIT, which means that it reduces the protocol complexity in terms of communication and memory.…”

Section: A Related Workmentioning

confidence: 94%

“…As far as we now, our protocol is the only existing GAKE that simultaneously satisfy the two following properties: can be implemented from any KEM, offers security in the post-quantum setting and does not make use of post-quantum signatures. To justify this fact, note that among the protocols enumerated in Table 1, [1], [2], [3], [4], [5], [6], [7], [11] use specific KEMs or post-quantum mathematical problems, [8] makes use of a post-quantum signature and [9], [10] depart from a two-party key exchange protocol, not from a KEM. As every NIST finalist must include a KEM, this allows us to provide full and working implementations of our GAKE with all the finalists.…”

Section: B Our Contributionmentioning

confidence: 99%

“…It provides all the finalist implementations submitted to the NIST standardization process. 2 It has been developed by the Open Quantum Safe project, which aims at prototyping and experimenting with post-quantum cryptography, but as of today, it is not production-ready. It is written in C99 and its advantages include:…”

Section: A Building Blocks 1) Kemmentioning

confidence: 99%

See 2 more Smart Citations

Design and Implementation of a Post-Quantum Group Authenticated Key Exchange Protocol With the LibOQS Library: A Comparative Performance Analysis From Classic McEliece, Kyber, NTRU, and Saber

2022

View full text Add to dashboard Cite

Group authenticated key exchange protocols (GAKE) are cryptographic tools enabling a group of several users communicating through an insecure channel to securely establish a common shared highentropy key. In the last years, the need to design cryptographic tools which provide security in the presence of attackers with access to quantum resources has become unquestionable; the field dealing with these types of protocols is usually referred to as Post-Quantum Cryptography. The U.S. National Institute for Standards and Technology (NIST) launched in 2017 an open call to find suitable post-quantum public-key algorithms for standardization. In this work, we design a GAKE that can be instantiated with any key encapsulation mechanism (KEM) that satisfies the strong security notion IND-CCA, matching NIST's requirements for this primitive. We have implemented our GAKE with the four finalist KEMs from the NIST process: Classic McEliece, Kyber, NTRU, and Saber, making use of the open-source library LibOQS where these algorithms are provided. We have conducted a detailed comparative performance analysis of the resulting GAKE protocols, taking into account all the parameter sets proposed in the submissions. We have also made a performance analysis of all the involved building pieces, including the four finalist KEMs. Finally, we also compare our GAKE with a previous proposal implemented with Kyber.

show abstract

Section: A Related Workmentioning

confidence: 94%

Section: B Our Contributionmentioning

confidence: 99%

See 1 more Smart Citation

Design and Implementation of a Post-Quantum Group Authenticated Key Exchange Protocol With the LibOQS Library: A Comparative Performance Analysis From Classic McEliece, Kyber, NTRU, and Saber

2022

View full text Add to dashboard Cite

show abstract

“…Building on the hardness of Diffie-Hellman-like problems related to isogenies, a first construction called SIBD is proposed in [11], which only considers passive adversaries. Building upon this, several tree-based constructions, including an authenticated design can be found in [12]. In particular, the proposal A-SIT and its peer-to-peer version, A-P2P-SIT, resist active attacks, as group members are authenticated through a post-quantum signature scheme.…”

Section: Related Work Post-quantum Group Key Exchangementioning

confidence: 99%

Secure post‐quantum group key exchange: Implementing a solution based on Kyber

Pablos¹,

Vasco²

2023

IET Communications

View full text Add to dashboard Cite

Quantum computing poses fascinating challenges for current cryptography, threatening the security of many schemes and protocols widely used today. To adapt to this reality, the U.S. National Institute for Standards and Technology (NIST) is currently running a standardization process in search of post-quantum (classical, yet resistant to quantum attacks) cryptographic tools, focusing on signature schemes and key encapsulation mechanisms. Many of the competing proposals also include designs for two-party key exchange, which can be combined in different ways to fit scenarios involving n ≥ 2 parties, that is, yielding group key exchange protocols. However, very few implementations of such group protocols are available to practitioners, which face a non-trivial challenge when deciding how to implement a protocol for establishing secure group sessions in this new post-quantum scenario. With this in mind, the authors report on the implementation of a secure postquantum group key exchange protocol in the so-called Quantum Random Oracle Model. The protocol decided to implement is based on a KEM called Kyber, which is one of the finalists of the NIST competition. Not only this group construction is the only one available in the literature using a NIST finalist, but also, among all post-quantum designs the authors are aware of, it uses this strongest security model (as, e.g. in other proposals, the adversarial interaction with the hash functions of the system is assumed to be exclusively classical). Furthermore, experimental evidence is provided supporting this choice in terms of performance, even if the number of involved entities is large (up to 2000). All data and code are publicly available.

show abstract

“…Hector and Atsuko [ 34 ] proposed the first consistent, tree-based, SIDH-based group exchange protocol with logarithmic-order connectivity and memory complex, of which the only key exchange group based on isogeny has linear order. Authors [ 35 ] identify that the protocol used in [ 36 ] is vulnerable to link ability of users, denial-of-service attacks, and replay attacks.…”

Section: Related Workmentioning

confidence: 99%

Security framework to healthcare robots for secure sharing of healthcare data from cloud

Jain

Doriya

2022

Int. j. inf. tecnol.

View full text Add to dashboard Cite

Healthcare robots have the potential to assist medical practitioners in accurately performing tasks such as nursing, diagnosing, and performing critical surgeries. Limited processing, battery power, and storage capacity may reduce the robot's working efficiency. Using cloud services (massive storage, fast processing, and network) overcome the above-mentioned issues. However, sharing healthcare data from the cloud to healthcare robots raises security concerns. Sharing sensitive healthcare data, from the cloud to healthcare robots, can lead to multiple internal and external attacks that are an important research issue. To avoid these types of attacks, data must be encrypted before it is stored in the cloud, assigned roles using access controls, and maintains the integrity of the data. In this paper, the robotics healthcare data is encrypted using an Elliptic Curve Cryptography (ECC)-based mechanism for secure sharing, and Hash-based Message Authentication Code-SHA 1 (HMAC-SHA1) is used for maintaining the integrity of the sensitive data. The results show that the proposed methodology gives better results with less security overhead. Furthermore, the proposed framework can be applied practically in a healthcare environment with low computational power.

show abstract

Authenticated logarithmic-order supersingular isogeny group key exchange

Cited by 5 publications

References 31 publications

Design and Implementation of a Post-Quantum Group Authenticated Key Exchange Protocol With the LibOQS Library: A Comparative Performance Analysis From Classic McEliece, Kyber, NTRU, and Saber

Design and Implementation of a Post-Quantum Group Authenticated Key Exchange Protocol With the LibOQS Library: A Comparative Performance Analysis From Classic McEliece, Kyber, NTRU, and Saber

Secure post‐quantum group key exchange: Implementing a solution based on Kyber

Security framework to healthcare robots for secure sharing of healthcare data from cloud

Contact Info

Product

Resources

About