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

Post-Quantum Security Models for Authenticated Encryption

Vladimir Soukharev, David Jao, Srinath Seshadri

Published Jan 1, 2016• 13 citations
Publisher
DOI
10.1007/978-3-319-29360-8_5

Related papers

On the Post-quantum Security of Classical Authenticated Encryption Schemes

Nathalie Lang, Stefan Lucks

Lecture notes in computer science•Jan 1, 2023•3 citations

Post-Quantum Elliptic Curve Cryptography

Vladimir Soukharev

We propose and develop new schemes for post-quantum cryptography based on isogenies over elliptic curves. First we show that ordinary elliptic curves are have less than exponential security against quantum computers. These results were used as the motivation for De Feo, Jao and Pl\\^ut's construction of public key cryptosystems using supersingular elliptic curve isogenies. We extend their construction and show that isogenies between supersingular elliptic curves can be used as the underlying hard mathematical problem for other quantum-resistant schemes. For our second contribution, we propose is an undeniable signature scheme based on elliptic curve isogenies. We prove its security under certain reasonable number-theoretic computational assumptions for which no efficient quantum algorithms are known. This proposal represents only the second known quantum-resistant undeniable signature scheme, and the first such scheme secure under a number-theoretic complexity assumption. Finally, we also propose a security model for evaluating the security of authenticated encryption schemes in the post-quantum setting. Our model is based on a combination of the classical Bellare-Namprempre security model for authenticated encryption together with modifications from Boneh and Zhandry to handle message authentication against quantum adversaries. We give a generic construction based on Bellare-Namprempre for producing an authenticated encryption protocol from any quantum-resistant symmetric-key encryption scheme together with any digital signature scheme or MAC admitting any classical security reduction to a quantum-computationally hard problem. We apply the results and show how we can explicitly construct authenticated encryption schemes based on isogenies.

•May 16, 2016•1 citation

Post-quantum Secure Cryptographic Algorithms

Xenia Bogomolec, J. Gerhard

arXiv:1809.00371•Springer eBooks•Jan 1, 2021•2 citations

PQ-FLAT: A New Quantum-Resistant And Lightweight Authentication Approach for M2M Devices

Engin Karacan, Sedat Akleylek, Aykut Karakaya

It is believed that traditional asymmetric cryptosystems are compromised and symmetric cryptography can be used in the post-quantum world. In this paper, a new model based on post-quantum a set of FLAT (PQ-FLAT) protocol is proposed to ensure security in the machine to machine communication with post-quantum cryptography and it is inspired by the federated lightweight authentication of things (FLAT) protocol, which works effectively for resource-constrained devices in machine to machine (M2M) communication systems. The proposed model includes resource-constrained devices, certificate provider (CP), and service provider (SP). Communication of the certificate provider between resource-constrained devices is encrypted with AES. Instead of the asymmetric cryptography system between the certificate provider and the service provider, a lattice-based encryption mechanism, secure in the post-quantum world, is used. Thus, the FLAT protocol for resource-constrained devices is made resistant to post-quantum changes.

International Symposium on Digital Forensics and Security (ISDFS)•Jun 28, 2021•6 citations

Post - Quantum Cryptography and Authentication: Enhancing Security for the Quantum Era

Nguyễn Thị Phượng Hằng, Lưu Hồng Dũng

•Jan 1, 2025•0 citations

ALGAES : An authenticated lattice-based generic asymmetric encryption scheme

S. S. Aravind Vishnu, Madathil Sethumadhavan, K. V. Lakshmy

In this article, we propose a generic hybrid encryption scheme providing entity authentication.The scheme is based on lossy trapdoor functions relying on the hardness of the Learning With Errors problem.The construction can be used on a number of different security requirements with minimal reconfiguration.It ensures entity authentication and ciphertext integrity while providing security against adaptive chosen ciphertext attacks in the standard model.As a desired characteristic of schemes providing entity authentication, we prove the strong unforgeability under chosen message attack for the construction.In addition, the scheme is post-quantum secure based on the hardness of the underlying assumption.

Journal of Discrete Mathematical Sciences and Cryptography•May 12, 2026•0 citations
We propose and develop new schemes for post-quantum cryptography based on isogenies over elliptic curves. First we show that ordinary elliptic curves are have less than exponential security against quantum computers. These results were used as the motivation for De Feo, Jao and Pl\\^ut's construction of public key cryptosystems using supersingular elliptic curve isogenies. We extend their construction and show that isogenies between supersingular elliptic curves can be used as the underlying hard mathematical problem for other quantum-resistant schemes. For our second contribution, we propose is an undeniable signature scheme based on elliptic curve isogenies. We prove its security under certain reasonable number-theoretic computational assumptions for which no efficient quantum algorithms are known. This proposal represents only the second known quantum-resistant undeniable signature scheme, and the first such scheme secure under a number-theoretic complexity assumption. Finally, we also propose a security model for evaluating the security of authenticated encryption schemes in the post-quantum setting. Our model is based on a combination of the classical Bellare-Namprempre security model for authenticated encryption together with modifications from Boneh and Zhandry to handle message authentication against quantum adversaries. We give a generic construction based on Bellare-Namprempre for producing an authenticated encryption protocol from any quantum-resistant symmetric-key encryption scheme together with any digital signature scheme or MAC admitting any classical security reduction to a quantum-computationally hard problem. We apply the results and show how we can explicitly construct authenticated encryption schemes based on isogenies.
It is believed that traditional asymmetric cryptosystems are compromised and symmetric cryptography can be used in the post-quantum world. In this paper, a new model based on post-quantum a set of FLAT (PQ-FLAT) protocol is proposed to ensure security in the machine to machine communication with post-quantum cryptography and it is inspired by the federated lightweight authentication of things (FLAT) protocol, which works effectively for resource-constrained devices in machine to machine (M2M) communication systems. The proposed model includes resource-constrained devices, certificate provider (CP), and service provider (SP). Communication of the certificate provider between resource-constrained devices is encrypted with AES. Instead of the asymmetric cryptography system between the certificate provider and the service provider, a lattice-based encryption mechanism, secure in the post-quantum world, is used. Thus, the FLAT protocol for resource-constrained devices is made resistant to post-quantum changes.
In this article, we propose a generic hybrid encryption scheme providing entity authentication.The scheme is based on lossy trapdoor functions relying on the hardness of the Learning With Errors problem.The construction can be used on a number of different security requirements with minimal reconfiguration.It ensures entity authentication and ciphertext integrity while providing security against adaptive chosen ciphertext attacks in the standard model.As a desired characteristic of schemes providing entity authentication, we prove the strong unforgeability under chosen message attack for the construction.In addition, the scheme is post-quantum secure based on the hardness of the underlying assumption.