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

World Wide Web

Secure limitation analysis of public-key cryptography for smart card settings

Youliang Tian, Qiuxian Li, Jia Wen Hu, Hui Lin

Published Aug 22, 2019• 18 citations
Publisher
DOI
10.1007/s11280-019-00715-8

Related papers

Post-Quantum Cryptography Without Public Keys: Symmetric Trust Models and Smart Cards

Pedro Cosme

•Jan 1, 2026•0 citations

Performance Evaluation of Post-quantum Public-Key Cryptography in Smart Mobile Devices

Noureddine Chikouche, Abderrahmen Ghadbane

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

Quantum Attack-Resistent Certificateless Multi-Receiver Signcryption Scheme

Huixian Li, Xubao Chen, Liaojun Pang +1 more

The existing certificateless signcryption schemes were designed mainly based on the traditional public key cryptography, in which the security relies on the hard problems, such as factor decomposition and discrete logarithm. However, these problems will be easily solved by the quantum computing. So the existing certificateless signcryption schemes are vulnerable to the quantum attack. Multivariate public key cryptography (MPKC), which can resist the quantum attack, is one of the alternative solutions to guarantee the security of communications in the post-quantum age. Motivated by these concerns, we proposed a new construction of the certificateless multi-receiver signcryption scheme (CLMSC) based on MPKC. The new scheme inherits the security of MPKC, which can withstand the quantum attack. Multivariate quadratic polynomial operations, which have lower computation complexity than bilinear pairing operations, are employed in signcrypting a message for a certain number of receivers in our scheme. Security analysis shows that our scheme is a secure MPKC-based scheme. We proved its security under the hardness of the Multivariate Quadratic (MQ) problem and its unforgeability under the Isomorphism of Polynomials (IP) assumption in the random oracle model. The analysis results show that our scheme also has the security properties of non-repudiation, perfect forward secrecy, perfect backward secrecy and public verifiability. Compared with the existing schemes in terms of computation complexity and ciphertext length, our scheme is more efficient, which makes it suitable for terminals with low computation capacity like smart cards.

PLoS ONE•Jun 5, 2013•6 citations

Practical Card-Based Cryptography

Takaaki Mizuki, Hiroki Shizuya

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

Card-based Cryptographic Protocols Using Private Operations

Hibiki Ono, Yoshifumi Manabe

IEICE Technical Report; IEICE Tech. Rep.•Aug 28, 2017•0 citations

Securing Post-Quantum Communication for Smart Grid Applications

Basudeb Bera, Biplab Sikdar

The Smart Grid (SG) represents the next-generation power system in the future grid infrastructure, designed for self-healing, adaptability, and sustainability. However, the interconnected and geographically dispersed nature of SG systems introduces cybersecurity risks, potentially leading to severe incidents. Cyber attacks on SG applications could result in significant events, including outages and infrastructure damage. These attacks may compromise energy data, starting with the leakage of personal information from grid members. To address these risks, confidentiality, device authentication, and data integrity are essential, traditionally implemented through public-key cryptography (PKC). The rise of quantum computers and the potential adaptation of algorithms like Shor’s poses a threat to PKC algorithms in SG communications. In response, we propose a security protocol for post-quantum communication in SG applications, ensuring resilience against classical and quantum attacks. The protocol has been tested through rigorous informal security analysis, and comparative analysis demonstrates its scalability and effectiveness in real-world scenarios.

IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm)•Sep 17, 2024•14 citations
The existing certificateless signcryption schemes were designed mainly based on the traditional public key cryptography, in which the security relies on the hard problems, such as factor decomposition and discrete logarithm. However, these problems will be easily solved by the quantum computing. So the existing certificateless signcryption schemes are vulnerable to the quantum attack. Multivariate public key cryptography (MPKC), which can resist the quantum attack, is one of the alternative solutions to guarantee the security of communications in the post-quantum age. Motivated by these concerns, we proposed a new construction of the certificateless multi-receiver signcryption scheme (CLMSC) based on MPKC. The new scheme inherits the security of MPKC, which can withstand the quantum attack. Multivariate quadratic polynomial operations, which have lower computation complexity than bilinear pairing operations, are employed in signcrypting a message for a certain number of receivers in our scheme. Security analysis shows that our scheme is a secure MPKC-based scheme. We proved its security under the hardness of the Multivariate Quadratic (MQ) problem and its unforgeability under the Isomorphism of Polynomials (IP) assumption in the random oracle model. The analysis results show that our scheme also has the security properties of non-repudiation, perfect forward secrecy, perfect backward secrecy and public verifiability. Compared with the existing schemes in terms of computation complexity and ciphertext length, our scheme is more efficient, which makes it suitable for terminals with low computation capacity like smart cards.
The Smart Grid (SG) represents the next-generation power system in the future grid infrastructure, designed for self-healing, adaptability, and sustainability. However, the interconnected and geographically dispersed nature of SG systems introduces cybersecurity risks, potentially leading to severe incidents. Cyber attacks on SG applications could result in significant events, including outages and infrastructure damage. These attacks may compromise energy data, starting with the leakage of personal information from grid members. To address these risks, confidentiality, device authentication, and data integrity are essential, traditionally implemented through public-key cryptography (PKC). The rise of quantum computers and the potential adaptation of algorithms like Shor’s poses a threat to PKC algorithms in SG communications. In response, we propose a security protocol for post-quantum communication in SG applications, ensuring resilience against classical and quantum attacks. The protocol has been tested through rigorous informal security analysis, and comparative analysis demonstrates its scalability and effectiveness in real-world scenarios.