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

Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy

Jing Pan, Xiaofeng Chen, Fangguo Zhang, Willy Susilo

Published Jan 1, 2021• 5 citations
Publisher
DOI
10.1007/978-3-030-92068-5_6

Related papers

Forward-Secure Group Encryptions from Lattices

Jing Pan, Xiaofeng Chen, Fangguo Zhang +1 more

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

Policy-Controlled Signature from NTRU Lattice

Ziyuan Liu, Jen-Chieh Hsu, Raylin Tso +1 more

Policy-controlled signature (PCS) was introduced by Pairat Thorncharoensri et al. at ICICS 2009, and improved at Computer Standards & Interfaces 2017. In this type of digital signature, signer can sign a message with some policies. Any verifier who does not satisfies the policies cannot verify the message. They also extended the notion of policy-controlled signature, and called it "universal policy-controlled signature". In their extended notion, they improve the flexibility of the PCS scheme by allowing a third party to equip the signature with policy, rather than the signer. In this work, we use the recent techniques in lattice to construct policy- controlled based signature from NTRU lattice. In particular, we adapt Léo Ducas et al.'s encryption and signature protocol on lattice (ASIACRYPT 2014), and combine them with Pairat Thorncharoensri et al.'s work to satisfy the properties of policy-controlled signature. Our contribution is developing the first quantum- resistant schema based on the policy-controlled signature.

IFIP International Conference on New Technologies, Mobility and Security (NTMS)•Feb 1, 2018•1 citation

Lattice-Based Updatable Public-Key Encryption for Group Messaging

Doreen Riepel, Joël Alwen, Georg Fuchsbauer +1 more

Updatable Public-Key Encryption (UPKE) augments the security of PKE with Forward Secrecy properties. While requiring more coordination between parties, UPKE enables much more efficient constructions than full-fledged Forward-Secret PKE. Alwen, Fuchsbauer and Mularczyk (AFM, Eurocrypt’24) presented the strongest security notion to date. It is the first to meet the needs of UPKE’s most important applications: Secure Group Messaging and Continuous Group Key Agreement. The authors provide a very efficient construction meeting their notion with classic security based on the Computational Diffie-Hellman (CDH) assumption in the Random Oracle Model (ROM). In this work we present the first post-quantum secure UPKE construction meeting (a slight relaxation of) the AFM security notion. Based on the Module LWE assumption, our construction is practically efficient. Moreover, public key sizes are about 1/2 and ciphertext sizes around 2/3 of those of the state-of-the-art lattice-based UPKE scheme in the ROM by Abou Haidar, Passelègue and Stehlé – despite only being shown to satisfy a significantly weaker security notion. As the AFM proofs relies on random self-reducibility of CDH, which has no analogue for lattices, we develop a new proof technique for strong UPKE, identifying the core properties required from the underlying (lattice-based) encryption scheme.

•Jun 24, 2026•0 citations

Lattice-based group encryptions with only one trapdoor

Jing Pan, Jiang Zhang, Fangguo Zhang +2 more

Science China Information Sciences•Mar 16, 2022•3 citations

Enhancing Data Privacy with Lattice-Based Encryption Technique

Rohit Meda, Intekhab Alam, Priyank Pandey +2 more

Lecture notes in computer science•Jan 1, 2025•2 citations

Quantum Key-Policy Attribute-based Encryption

Gabriela Mogos

Attribute-Based Encryption is a relatively new concept in the field of cryptography, and it allows only the authorized entities to decrypt a message. This type of encryption is the mechanism by which the users may encrypt and decrypt data based on user attributes. This paper proposes the first quantum alternative of the scheme Key-Policy Attribute-Based Encryption, where the information, the encryption/decryption key, and the attributes are made of qutrits.

Indonesian Journal of Electrical Engineering and Computer Science•Aug 1, 2017•2 citations
Policy-controlled signature (PCS) was introduced by Pairat Thorncharoensri et al. at ICICS 2009, and improved at Computer Standards & Interfaces 2017. In this type of digital signature, signer can sign a message with some policies. Any verifier who does not satisfies the policies cannot verify the message. They also extended the notion of policy-controlled signature, and called it "universal policy-controlled signature". In their extended notion, they improve the flexibility of the PCS scheme by allowing a third party to equip the signature with policy, rather than the signer. In this work, we use the recent techniques in lattice to construct policy- controlled based signature from NTRU lattice. In particular, we adapt Léo Ducas et al.'s encryption and signature protocol on lattice (ASIACRYPT 2014), and combine them with Pairat Thorncharoensri et al.'s work to satisfy the properties of policy-controlled signature. Our contribution is developing the first quantum- resistant schema based on the policy-controlled signature.
Updatable Public-Key Encryption (UPKE) augments the security of PKE with Forward Secrecy properties. While requiring more coordination between parties, UPKE enables much more efficient constructions than full-fledged Forward-Secret PKE. Alwen, Fuchsbauer and Mularczyk (AFM, Eurocrypt’24) presented the strongest security notion to date. It is the first to meet the needs of UPKE’s most important applications: Secure Group Messaging and Continuous Group Key Agreement. The authors provide a very efficient construction meeting their notion with classic security based on the Computational Diffie-Hellman (CDH) assumption in the Random Oracle Model (ROM). In this work we present the first post-quantum secure UPKE construction meeting (a slight relaxation of) the AFM security notion. Based on the Module LWE assumption, our construction is practically efficient. Moreover, public key sizes are about 1/2 and ciphertext sizes around 2/3 of those of the state-of-the-art lattice-based UPKE scheme in the ROM by Abou Haidar, Passelègue and Stehlé – despite only being shown to satisfy a significantly weaker security notion. As the AFM proofs relies on random self-reducibility of CDH, which has no analogue for lattices, we develop a new proof technique for strong UPKE, identifying the core properties required from the underlying (lattice-based) encryption scheme.