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

Provably Secure NTRU Instances over Prime Cyclotomic Rings

Yang Yu, Guangwu Xu, Xiaoyun Wang

Published Jan 1, 2017• 29 citations
Publisher
DOI
10.1007/978-3-662-54365-8_17

Related papers

Provably Secure NTRUEncrypt over Any Cyclotomic Field

Yang Wang, Mingqiang Wang

Lecture notes in computer science•Jan 1, 2019•8 citations

On the Efficiency of Provably Secure NTRU

Daniel Cabarcas, Patrick Weiden, Johannes A Buchmann

Lecture notes in computer science•Jan 1, 2014•14 citations

A provably secure collusion-resistant identity-based proxy re-encryption scheme based on NTRU

Nan Yang, Youliang Tian, Zhou Zhou +1 more

Journal of Information Security and Applications•Oct 10, 2023•3 citations

BI-NTRU Encryption Schemes: Two New Secure Variants of NTRU

Michel Seck, Djiby Sow

Communications in computer and information science•Jan 1, 2019•6 citations

Identity-based Fully Homomorphic Encryption from Ring-LWE: Arbitrary Cyclotomics, Tighter Parameters, Efficient Implementations

Dan Xin, Linna Yang, Lina Yan +1 more

International Conference on Mathematics, Modeling and Simulation Technologies and Applications (MMSTA)•Jan 1, 2019•1 citation

Provably Secure Identity-Based Encryption and Signature over Cyclotomic Fields

Yang Wang, Mingqiang Wang, Jingdan Zou +2 more

Identity-based cryptography is a type of public key cryptography with simple key management procedures. To our knowledge, till now, the existing identity-based cryptography based on NTRU is all over power-of-2 cyclotomic rings. Whether there is provably secure identity-based cryptography over more general fields is still open. In this paper, with the help of the results of collision resistance preimage sampleable functions (CRPSF) over cyclotomic fields, we give concrete constructions of provably secure identity-based encryption schemes (IBE) and identity-based signature schemes (IBS) based on NTRU over any cyclotomic field. Our IBE schemes are provably secure under adaptive chosen-plaintext and adaptive chosen-identity attacks, meanwhile, our IBS schemes are existentially unforgeable against adaptively chosen message and adaptively chosen identity attacks for any probabilistic polynomial time (PPT) adversary in the random oracle model. The securities of both schemes are based on the worst-case approximate shortest independent vectors problem (SIVPγ) over corresponding ideal lattices. The secret key size of our IBE (IBS) scheme is short—only one (two) ring element(s). The ciphertext (signature) is also short—only two (three) ring elements. Meanwhile, as the case of NTRUEncrypt, our IBE scheme could encrypt n bits in each encryption process. These properties may make our schemes have more advantages for some IoT applications over postquantum world in theory.

Wireless Communications and Mobile Computing•Oct 17, 2019•4 citations
Identity-based cryptography is a type of public key cryptography with simple key management procedures. To our knowledge, till now, the existing identity-based cryptography based on NTRU is all over power-of-2 cyclotomic rings. Whether there is provably secure identity-based cryptography over more general fields is still open. In this paper, with the help of the results of collision resistance preimage sampleable functions (CRPSF) over cyclotomic fields, we give concrete constructions of provably secure identity-based encryption schemes (IBE) and identity-based signature schemes (IBS) based on NTRU over any cyclotomic field. Our IBE schemes are provably secure under adaptive chosen-plaintext and adaptive chosen-identity attacks, meanwhile, our IBS schemes are existentially unforgeable against adaptively chosen message and adaptively chosen identity attacks for any probabilistic polynomial time (PPT) adversary in the random oracle model. The securities of both schemes are based on the worst-case approximate shortest independent vectors problem (SIVPγ) over corresponding ideal lattices. The secret key size of our IBE (IBS) scheme is short—only one (two) ring element(s). The ciphertext (signature) is also short—only two (three) ring elements. Meanwhile, as the case of NTRUEncrypt, our IBE scheme could encrypt n bits in each encryption process. These properties may make our schemes have more advantages for some IoT applications over postquantum world in theory.