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

STRONGER SECURITY NOTIONS FOR TRAPDOOR FUNCTIONS AND APPLICATIONS

Phyllis O’Neill

Published Jan 1, 2010• 0 citations
OpenAlex

Related papers

FACIAL STRUCTURES FOR VARIOUS NOTIONS OF POSITIVITY AND APPLICATIONS TO THE THEORY OF ENTANGLEMENT

SEUNG-HYEOK KYE

In this expository note, we explain facial structures for the convex cones consisting of positive linear maps, completely positive linear maps, and decomposable positive linear maps between matrix algebras, respectively. These will be applied to study the notions of entangled edge states with positive partial transposes and optimality of entanglement witnesses.

arXiv:1202.4255•Reviews in Mathematical Physics•Feb 19, 2013•55 citations

A classification of lattice-based trapdoor functions

Rakyong Choi, Kwangjo Kim

•Jan 25, 2017•0 citations

Trapdoor Hash Functions and Their Applications

Nico Döttling, Sanjam Garg, Yuval Ishai +3 more

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

EXTENSION OF THE NOTIONS OF CORRELATION FUNCTION AND SPECTRAL DENSITY TO A QUANTUM VARIABLE

Yves Ayant

Compt. rend.•Mar 1, 1954•0 citations

A Searchable Encryption Scheme Based on CRYSTALS-Dilithium

Minghui Zheng, Anqi Xiao, Shicheng Huang +1 more

With the advancement in quantum computing technology, the number theory-based hard problems underlying traditional searchable encryption algorithms are now vulnerable to efficient quantum attacks. To address this challenge, this paper proposes Dilithium-PAEKS (Dilithium-Public Authenticated Encryption with Keyword Search), a searchable encryption scheme based on the post-quantum cryptographic algorithm CRYSTALS-Dilithium. By transforming the verification relationship of digital signatures into a matching relationship between trapdoors and ciphertexts, the scheme not only meets the functional requirements of searchable encryption but also demonstrates quantum resistance. The implementation enhances algorithm efficiency through keyword-based signatures and dynamic matching testing mechanisms. The security of the scheme is defined by the MLWE and MSIS hard problems, with proofs of keyword ciphertext indistinguishability and trapdoor indistinguishability under the random oracle model. Additionally, the scheme provides strong resistance against both outside and insider keyword guessing attacks through sender–receiver binding mechanisms and trapdoor indistinguishability properties. Experimental results show that, compared to the post-quantum schemes CP-Absel and LB-FSSE, the proposed scheme demonstrates superior overall computational efficiency while maintaining stronger quantum resistance than the traditional scheme SM9-PAEKS.

Cryptography•Mar 27, 2026•0 citations

More Constructions of Lossy and Correlation-Secure Trapdoor Functions

David Mandell Freeman, Oded Goldreich, Eike Kiltz +2 more

Lecture notes in computer science•Jan 1, 2010•114 citations
With the advancement in quantum computing technology, the number theory-based hard problems underlying traditional searchable encryption algorithms are now vulnerable to efficient quantum attacks. To address this challenge, this paper proposes Dilithium-PAEKS (Dilithium-Public Authenticated Encryption with Keyword Search), a searchable encryption scheme based on the post-quantum cryptographic algorithm CRYSTALS-Dilithium. By transforming the verification relationship of digital signatures into a matching relationship between trapdoors and ciphertexts, the scheme not only meets the functional requirements of searchable encryption but also demonstrates quantum resistance. The implementation enhances algorithm efficiency through keyword-based signatures and dynamic matching testing mechanisms. The security of the scheme is defined by the MLWE and MSIS hard problems, with proofs of keyword ciphertext indistinguishability and trapdoor indistinguishability under the random oracle model. Additionally, the scheme provides strong resistance against both outside and insider keyword guessing attacks through sender–receiver binding mechanisms and trapdoor indistinguishability properties. Experimental results show that, compared to the post-quantum schemes CP-Absel and LB-FSSE, the proposed scheme demonstrates superior overall computational efficiency while maintaining stronger quantum resistance than the traditional scheme SM9-PAEKS.