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

The Journal of Supercomputing

Token open secure and practical NTRU-based updatable encryption

Yang Song, Haiying Gao, Shiyu Wang, Chao Ma, Keshuo Sun

Published Mar 9, 2024• 5 citations
Publisher

Abstract

Abstract Updatable encryption (UE) is suitable for key rotation and ciphertexts update in the cloud storage environment. A new security model for UE named Token Open security model is presented recently, which is closer to the real attack scenario. And the existing post-quantum secure UE schemes are all based on the LWE assumption without engineering implementation. In this paper, we improve the recently presented security model, which allows the adversary to corrupt all update tokens and keys of the past epochs. We show that our new model reflects the characteristics of UE. Then we construct the first UE scheme based on NTRU, named NTRU-UE. Our new scheme uses the key-switching technique to achieve backward-leak uni-directional key update and uni-directional ciphertext update and uses the ciphertext-masking technique to achieve rand-update. We show that the new scheme is secure under our new model. In addition, we accomplish the software implementation of NTRU-UE and the experiment results show that the scheme meets the practical requirements.

DOI
10.1007/s11227-024-05962-9

Related papers

Unidirectional Key Update in Updatable Encryption, Revisited

Mariusz Jurkiewicz, Kamila Prabucka

In this paper we construct a new efficient updatable encryption (UE) scheme based on FrodoPKE learning with errors key encapsulation. We analyse the security of the proposed scheme in the backward-leak uni-directional setting within the rand-ind-eu-cpa model. Since the underlying computationally hard problem here is LWE, the scheme is secure against both classical and quantum attacks.

arXiv:2410.03948•Fundamenta Informaticae•Jan 11, 2026•0 citations

An updatable encryption scheme for blockchain oracle based on post-quantum cryptography

Shihao Wang, Xuehui Du, Xiangyu Wu +3 more

Abstract The advancement of quantum attacks has posed a significant threat to blockchain cryptosystems. Furthermore, the finite lifecycles of ciphertext and keys may result in data leakage risks for long-term storage due to potential breaches in ciphertext security, necessitating ciphertext updates. Ensuring the long-term security of cryptographic algorithms on blockchains against quantum attacks has emerged as a critical concern in blockchain research. A blockchain oracle serves as a mechanism for data communication. The Module-Learning with Errors (MLWE) problem is a significant issue in lattice-based cryptography, providing security against quantum attacks. To resist the threat of quantum attacks on encrypted data and ensure the long-term security, this study proposed an updatable encryption (UE) scheme for blockchain oracles based on post-quantum cryptography. First, this study developed a UE scheme based on the blockchain oracle architecture, enabling the oracle to update encrypted data via update tokens, ensuring the data's long-term security. Additionally, a UE algorithm based on the MLWE problem was introduced to enhance its resistance to quantum attacks. Finally, an error-correcting mechanism tailored for the UE algorithm was developed to validate transmitted data, correct errors, and improve the scheme's robustness. The experimental results demonstrate that the proposed scheme not only provides quantum-resistant security but also enables ciphertext updates through update tokens. Compared to existing schemes, it has more advantages in protecting data security.

Cybersecurity•Jan 4, 2026•2 citations

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

(Inner-Product) Functional Encryption with Updatable Ciphertexts

Valerio Cini, Sebastian Ramacher, Daniel Slamanig +2 more

Abstract We propose a novel variant of functional encryption which supports ciphertext updates, dubbed ciphertext-updatable functional encryption. Such a feature further broadens the practical applicability of the functional encryption paradigm and allows for fine-grained access control even after a ciphertext is generated. Updating ciphertexts is carried out via so-called update tokens which a dedicated party can use to convert ciphertexts. However, allowing update tokens requires some care for the security definition. Our contribution is threefold: We define our new primitive with a security notion in the indistinguishability setting. Within CUFE, functional decryption keysandciphertexts are labeled with tags such that only if the tags of the decryption key and the ciphertext match, then decryption succeeds. Furthermore, we allow ciphertexts to switch their tags to any other tag via update tokens. Such tokens are generated by the holder of the main secret key and can only be used in the desired direction. We present a generic construction of CUFE for any functionality as well as predicates different from equality testing on tags which relies on the existence of indistinguishability obfuscation (iO). We present a practical construction of CUFE for the inner-product functionality from standard assumptions (i.e., LWE) in the random-oracle model. On the technical level, we build on the recent functional encryption schemes with fine-grained access control and linear operations on encrypted data (Abdalla et al., AC’20) and introduce an additional ciphertext updatability feature. Proving security for such a construction turned out to be non-trivial, particularly when revealing keys for the updated challenge ciphertext is allowed. Overall, such construction enriches the set of known inner-product functional encryption schemes with the additional updatability feature of ciphertexts.

Journal of Cryptology•Dec 15, 2023•17 citations

Identity-Based Proxy Re-encryption over NTRU Lattices for Cloud Computing

Na Yue, Yang Wang, Mingqiang Wang

Identity-based proxy re-encryption (IB-PRE) is a kind of public key cryptography that allows a proxy to convert the ciphertext based on Alice’s identity into another ciphertext of the same message for Bob. It has important applications in cloud computing, distributed systems and secure e-mail forwarding. So far, the existing lattice-based IB-PRE schemes are designed on the general lattice and their security is based on the learning with errors (LWE) assumption. In this paper, we propose an IB-PRE scheme over NTRU lattices with the desirable properties of anonymity, unidirectionality, backward collusion safeness and multi-hop. Our IB-PRE scheme is provable secure under adaptive chosen-plaintext and adaptive chosen-identity attacks. And, in the random oracle model, the security of our scheme is based on the decisional Ring-LWE assumption. Besides, the key and ciphertext sizes of our IB-PRE scheme are short, only one or two ring elements, and our scheme could encrypt n bits in each encryption process.

Procedia Computer Science•Jan 1, 2021•1 citation

Enhanced Provably Secure NTRU Encryption Based on Hard Learning over Rings

Wu Fang, Zheng Huang, Wang Li Cheng +1 more

Since the presentation of NTRU public-key cryptosystem by Hoffstein, Pipher and Silverman, its favorable properties, such as easily created keys, high speed, excellent performance and conjectured resistance to quantum computers, have made it to be of great use. This paper proposes an enhanced scheme based on the hard learning with error over ring (R-LWE) problem to improve the security of the modified NTRUEncrypt presented by Stehle and Steinfled. We used part of the padding ideas of Fujisaki and Okamoto to obtain this scheme. It is semantically secure in strong sense of indistinguishability against adaptive chosen-ciphertext attacks in the random oracle model assuming the quantum hardness of standard worst-case problem over ideal lattices. It is also possible to arbitrarily decrease the error probability, and even to eliminate it completely. We gave the detailed analysis using the known results from classic works. Furthermore, this scheme owns many advantages such as the uniformity of public key, usual assumptions and the freedom for coding messages.

Applied Mechanics and Materials•Nov 1, 2012•0 citations
Abstract Updatable encryption (UE) is suitable for key rotation and ciphertexts update in the cloud storage environment. A new security model for UE named Token Open security model is presented recently, which is closer to the real attack scenario. And the existing post-quantum secure UE schemes are all based on the LWE assumption without engineering implementation. In this paper, we improve the recently presented security model, which allows the adversary to corrupt all update tokens and keys of the past epochs. We show that our new model reflects the characteristics of UE. Then we construct the first UE scheme based on NTRU, named NTRU-UE. Our new scheme uses the key-switching technique to achieve backward-leak uni-directional key update and uni-directional ciphertext update and uses the ciphertext-masking technique to achieve rand-update. We show that the new scheme is secure under our new model. In addition, we accomplish the software implementation of NTRU-UE and the experiment results show that the scheme meets the practical requirements.
Abstract The advancement of quantum attacks has posed a significant threat to blockchain cryptosystems. Furthermore, the finite lifecycles of ciphertext and keys may result in data leakage risks for long-term storage due to potential breaches in ciphertext security, necessitating ciphertext updates. Ensuring the long-term security of cryptographic algorithms on blockchains against quantum attacks has emerged as a critical concern in blockchain research. A blockchain oracle serves as a mechanism for data communication. The Module-Learning with Errors (MLWE) problem is a significant issue in lattice-based cryptography, providing security against quantum attacks. To resist the threat of quantum attacks on encrypted data and ensure the long-term security, this study proposed an updatable encryption (UE) scheme for blockchain oracles based on post-quantum cryptography. First, this study developed a UE scheme based on the blockchain oracle architecture, enabling the oracle to update encrypted data via update tokens, ensuring the data's long-term security. Additionally, a UE algorithm based on the MLWE problem was introduced to enhance its resistance to quantum attacks. Finally, an error-correcting mechanism tailored for the UE algorithm was developed to validate transmitted data, correct errors, and improve the scheme's robustness. The experimental results demonstrate that the proposed scheme not only provides quantum-resistant security but also enables ciphertext updates through update tokens. Compared to existing schemes, it has more advantages in protecting data security.
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.
Abstract We propose a novel variant of functional encryption which supports ciphertext updates, dubbed ciphertext-updatable functional encryption. Such a feature further broadens the practical applicability of the functional encryption paradigm and allows for fine-grained access control even after a ciphertext is generated. Updating ciphertexts is carried out via so-called update tokens which a dedicated party can use to convert ciphertexts. However, allowing update tokens requires some care for the security definition. Our contribution is threefold: We define our new primitive with a security notion in the indistinguishability setting. Within CUFE, functional decryption keysandciphertexts are labeled with tags such that only if the tags of the decryption key and the ciphertext match, then decryption succeeds. Furthermore, we allow ciphertexts to switch their tags to any other tag via update tokens. Such tokens are generated by the holder of the main secret key and can only be used in the desired direction. We present a generic construction of CUFE for any functionality as well as predicates different from equality testing on tags which relies on the existence of indistinguishability obfuscation (iO). We present a practical construction of CUFE for the inner-product functionality from standard assumptions (i.e., LWE) in the random-oracle model. On the technical level, we build on the recent functional encryption schemes with fine-grained access control and linear operations on encrypted data (Abdalla et al., AC’20) and introduce an additional ciphertext updatability feature. Proving security for such a construction turned out to be non-trivial, particularly when revealing keys for the updated challenge ciphertext is allowed. Overall, such construction enriches the set of known inner-product functional encryption schemes with the additional updatability feature of ciphertexts.
Identity-based proxy re-encryption (IB-PRE) is a kind of public key cryptography that allows a proxy to convert the ciphertext based on Alice’s identity into another ciphertext of the same message for Bob. It has important applications in cloud computing, distributed systems and secure e-mail forwarding. So far, the existing lattice-based IB-PRE schemes are designed on the general lattice and their security is based on the learning with errors (LWE) assumption. In this paper, we propose an IB-PRE scheme over NTRU lattices with the desirable properties of anonymity, unidirectionality, backward collusion safeness and multi-hop. Our IB-PRE scheme is provable secure under adaptive chosen-plaintext and adaptive chosen-identity attacks. And, in the random oracle model, the security of our scheme is based on the decisional Ring-LWE assumption. Besides, the key and ciphertext sizes of our IB-PRE scheme are short, only one or two ring elements, and our scheme could encrypt n bits in each encryption process.
Since the presentation of NTRU public-key cryptosystem by Hoffstein, Pipher and Silverman, its favorable properties, such as easily created keys, high speed, excellent performance and conjectured resistance to quantum computers, have made it to be of great use. This paper proposes an enhanced scheme based on the hard learning with error over ring (R-LWE) problem to improve the security of the modified NTRUEncrypt presented by Stehle and Steinfled. We used part of the padding ideas of Fujisaki and Okamoto to obtain this scheme. It is semantically secure in strong sense of indistinguishability against adaptive chosen-ciphertext attacks in the random oracle model assuming the quantum hardness of standard worst-case problem over ideal lattices. It is also possible to arbitrarily decrease the error probability, and even to eliminate it completely. We gave the detailed analysis using the known results from classic works. Furthermore, this scheme owns many advantages such as the uniformity of public key, usual assumptions and the freedom for coding messages.