Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Group Oriented Attribute-Based Encryption Scheme from Lattices with the Employment of Shamir’s Secret Sharing Scheme

Maharage Nisansala Sevwandi Perera, Toru Nakamura, Takashi Matsunaka, Hiroyuki Yokoyama, Kouichi Sakurai

Published Jan 1, 2023• 2 citations
Publisher
DOI
10.1007/978-3-031-39828-5_9

Related papers

Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes

Ron Steinfeld, Huaxiong Wang, Josef Pieprzyk

Lecture notes in computer science•Jan 1, 2004•31 citations

Lattice-based threshold-changeability for standard Shamir secret-sharing schemes

Ron Steinfeld, Huaxiong Wang, Josef Pieprzyk

Lecture notes in computer science•Jan 1, 2004•0 citations

An Efficient and Secure Post-Quantum Multi-Authority Ciphertext-Policy Attribute-Based Encryption Method Using Lattice

Prithwi Bagchi, Basudeb Bera, Raj Maheshwari +3 more

This article deals with designing an efficient post-quantum lattice based encryption scheme that relies on the multi-authority Ciphertext-Policy Attribute-Based Encryption (CP-ABE). The security of the proposed scheme is based on the hardness of the ring learning with errors (RLWE) problem. The construction of the proposed scheme is done using the Shamir's threshold secret sharing along with the Lagrange interpolation during the key generation and decryption processes in order to achieve the segmentation and restoration of private keys. A comparative study with the existing state of art schemes has been performed to show the feasibility and efficiency of the proposed scheme. Furthermore, experiments on the proposed scheme have been conducted to illustrate the computational time required during the key generation, encryption and decryption processes.

IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)•May 20, 2023•17 citations

Attribute-Based Encryption Scheme Supporting Tree-Access Structure on Ideal Lattices

Jinxia Yu, Chaochao Yang, Yongli Tang +1 more

Lecture notes in computer science•Jan 1, 2018•11 citations

Redundant multipath PQC key exchange using Shamir's Secret Sharing

Ronny Döring, Marc Geitz

This paper proposes and evaluates multiple imple-mentations designed to fortify the security and resilience of a key exchange platform. Leveraging Shamir's Secret Sharing tech-nique, the system generates N sub-messages transmitted through disjoint network paths, preventing classical and quantum-enabled adversaries from reconstructing the original message without access to the requisite K sub-messages. Additionally, the inte-gration of Post-Quantum Cryptography, both before and after applying Shamir's Secret Sharing, employing Key Encapsulation Mechanisms for message encryption and signature algorithms for authentication, bolsters the platform's resilience against attacks on multiple networks. Successful attacks on either the Post-Quantum Cryptography or Shamir's Secret Sharing components in our implementation would not compromise the overall system security due to the two-factor approach. Experimental results demonstrate the effectiveness of the implemented system, achieving proficient key exchange rates under typical network traffic loads.

International Conference on Communications, Circuits and Systems•May 10, 2024•1 citation

Attribute-Based Functional Encryption on Lattices

Xavier Boyen

Lecture notes in computer science•Jan 1, 2013•163 citations
This article deals with designing an efficient post-quantum lattice based encryption scheme that relies on the multi-authority Ciphertext-Policy Attribute-Based Encryption (CP-ABE). The security of the proposed scheme is based on the hardness of the ring learning with errors (RLWE) problem. The construction of the proposed scheme is done using the Shamir's threshold secret sharing along with the Lagrange interpolation during the key generation and decryption processes in order to achieve the segmentation and restoration of private keys. A comparative study with the existing state of art schemes has been performed to show the feasibility and efficiency of the proposed scheme. Furthermore, experiments on the proposed scheme have been conducted to illustrate the computational time required during the key generation, encryption and decryption processes.
This paper proposes and evaluates multiple imple-mentations designed to fortify the security and resilience of a key exchange platform. Leveraging Shamir's Secret Sharing tech-nique, the system generates N sub-messages transmitted through disjoint network paths, preventing classical and quantum-enabled adversaries from reconstructing the original message without access to the requisite K sub-messages. Additionally, the inte-gration of Post-Quantum Cryptography, both before and after applying Shamir's Secret Sharing, employing Key Encapsulation Mechanisms for message encryption and signature algorithms for authentication, bolsters the platform's resilience against attacks on multiple networks. Successful attacks on either the Post-Quantum Cryptography or Shamir's Secret Sharing components in our implementation would not compromise the overall system security due to the two-factor approach. Experimental results demonstrate the effectiveness of the implemented system, achieving proficient key exchange rates under typical network traffic loads.