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

Institution of Engineering and Technology eBooks

Identification schemes in the post-quantum area based on multivariate polynomials with applications in cloud and IoT

Sedat Akleylek, Meryem Soysaldı

Published Mar 11, 2019• 1 citation
Publisher

Abstract

In this chapter, we survey the identification schemes based on multivariate polynomials over a finite field. We provide some basic definitions needed to construct the structure of identification schemes based on multivariate polynomials over a finite field. Then, we provide a brief survey of identification schemes based on multivariate polynomials by considering applications in different platforms. We analyze them in view of the zero knowledge property and the number of passes such as 3-pass and 5-pass. By considering open problems in the literature, we propose a novel identification scheme based on multivariate quadratic polynomials. Then, we compare them in terms of efficiency. We also provide a discussion for cloud, IoT, and big data applications of quantum secure identification schemes.

DOI
10.1049/pbse009e_ch8

Related papers

A novel 3-pass identification scheme and signature scheme based on multivariate quadratic polynomials

Sedat Akleylek, Meryem Soysaldı

Identification schemes are used to verify identities of parties and signatures. Recently, systems based on multivariate polynomials have been preferred in identification schemes due to their resistance against quantum attacks. In this paper, we propose a quantum secure $3$-pass identification scheme based on multivariate quadratic polynomials. We compare the proposed scheme with the previous ones in view of memory requirements, communication length, and computation time. We define an efficiency metric by using impersonation probability and computation time. According to the comparison results, the proposed one has the same computation time as that of Monteiro et al. and reduces impersonation probability compared to the work of Sakumoto et al. We also propose a new signature scheme constructed from the proposed identification scheme. In addition, we compare the signature scheme with the previous schemes in view of signature and key sizes. We improve the signature size compared to that given in previous work by Chen et al.

TURKISH JOURNAL OF MATHEMATICS•Jan 18, 2019•10 citations

A multivariate identity-based broadcast encryption with applications to the internet of things

Vikas Srivastava, Sumit Kumar Debnath, Pantelimon Stănică +1 more

When Kevin Ashton proposed the catchword 'Internet of Things' in 1999, little did he know that technology will become an indispensable part of human lives in just two decades. In short, the Internet of Things (IoT), is a catch-all terminology used to describe devices connected to the internet. These devices can share and receive data as well as provide instructions over a network. By design itself, the IoT system requires multicasting data and information to a set of designated devices, securely. Taking everything into account, Broadcast Encryption (BE) seems to be the natural choice to address the problem. BE allows an originator to broadcast ciphertexts to a big group of receivers in a well-organized and competent way, while ensuring that only designated people can decrypt the data. In this work, we put forward the first Identity-Based Broadcast Encryption scheme based on multivariate polynomials that achieves post-quantum security. Multivariate public key cryptosystems (MPKC), touted as one of the most promising post-quantum cryptography candidates, forms the foundation on which our scheme relies upon, which allows it to be very cost-effective and faster when implemented. In addition, it also provides resistance to collusion attack, and as a consequence our scheme can be utilized to form an efficient and robust IoT system.

Advances in Mathematics of Communications•Nov 10, 2021•12 citations

A New 3-pass Zero-knowledge Lattice-based Identification Scheme

Sedat Akleylek, Meryem Soysaldı

It is very important that the communicating parties are able to verify their identity in order to communicate with each other properly. Identification schemes are used for this purpose. The identification schemes, widely used in applications, are based on the hardness of the discrete logarithm or integer factorization problem. Shor proposed an algorithm that solve discrete logarithm and factorization problems by using quantum computers in polynomial-time. Therefore, there is a huge need for identification schemes which can be used post-quantum. In this paper, the identification schemes based on hardness of different lattice problems are surveyed. In addition, a new zero-knowledge lattice-based identification scheme is proposed.

International Conference on Computer Science and Engineering (UBMK)•Sep 1, 2019•1 citation

Post-Quantum Cryptographic Approaches for Securing the Internet of Things

Dr. Elena Petrovna Kuznetsova

The rapid proliferation of Internet of Things (IoT) devices has heightened concerns regarding their security and privacy. Conventional cryptographic methods underpinning IoT security are increasingly threatened by the emergence of quantum computing, which promises to break widely used encryption algorithms such as RSA and ECC. This paper explores post-quantum cryptographic (PQC) algorithms tailored to the resource-constrained nature of IoT environments. It analyzes lattice-based, hash-based, code-based, and multivariate polynomial cryptographic schemes as promising candidates for securing IoT communications against quantum attacks. The paper further discusses implementation challenges, performance considerations, and potential pathways for integrating PQC within existing IoT architectures. Empirical data on computational efficiency and security strength are also presented to guide future deployment.

American Journal Of Cryptography And Network Security•Aug 31, 2025•0 citations

A novel identicication scheme for post-quantum secure digital right management

Sedat Akleylek, Meryem Soysaldı

With the progress of technology and widespread use of internet, the data has become digital. It is getting easier day by day to copy, modify and transform digital data / applications into another form. The term of digital rights management (DRM) has been suggested to limit the use of data in digital media and to protect copyrights. Different architectures / technologies are used to provide DRM. In existing architectures, the user is unaware whether the license, which was purchased, is used by an unauthorized party. In this paper, a structure is given to resolve this problem and fairness property is added for DRM architectures. Moreover, a post-quantum reliable identification protocol based on multivariate quadratic systems, which can be used for access control in DRM architecture, is proposed.

International Conference on Computer Science and Engineering (UBMK)•Oct 1, 2017•1 citation

Securing Data against Quantum Threats: Post-Quantum Cryptography Approaches

Taban Habibu, Francis Xavier Ovoni

Quantum computing is rapidly advancing and threatens the cryptographic systems that secure digital communications. Classical cryptosystems, such as RSA and ECC, rely on mathematical problems that are difficult for classical computers but can be solved easily by quantum algorithms, such as Shor’s. This challenge underscores the pressing need for Post-Quantum Cryptography (PQC) to safeguard data against both classical and quantum threats. This study provides a comprehensive review of PQC Approaches in securing data against quantum threats b‌y analyzing reviewed journals,‍ conference proceedings, book chapters, and websites. Several researchers reviewed relevant literature published between 2019 and 2026 using the ACM Digital Library, Wiley Online⁠ Library, Taylor & Francis‌, Springer, ScienceDirect, MDPI, IEEE Xplore Digital Library, and Google Scholar. The review evaluates lattice-based, code-based, Hash-based, multivariate, and isogeny-based schemes across security strength, performance, interoperability, and deployment feasibility in heterogeneous environments, including cloud platforms and Internet of Things devices. The findings indicate that lattice-based schemes, particularly CRYSTALS-Kyber and CRYSTALS-Dilithium, currently offer the most balanced trade-off between efficiency and quantum resistance, while Hash-based schemes such as SPHINCS+ prioritize conservative security at notable performance cost. Code-based approaches, including McEliece, demonstrate strong long-term security but remain constrained by large key sizes. The review highlights implementation, energy, migration, and governance barriers that must be addressed before adoption. The review concludes by emphasizing that transitioning to PQC requires a collaborative effort from academia, industry, and government. Future research should focus on integrating lightweight PQC in IoT, 5G/6G, and cloud environments, as well as developing hybrid models that combine classical and quantum-safe systems. Addressing these issues is crucial for establishing secure data protection in the quantum era.

DS Journal of Digital Science and Technology•Dec 31, 2025•1 citation
In this chapter, we survey the identification schemes based on multivariate polynomials over a finite field. We provide some basic definitions needed to construct the structure of identification schemes based on multivariate polynomials over a finite field. Then, we provide a brief survey of identification schemes based on multivariate polynomials by considering applications in different platforms. We analyze them in view of the zero knowledge property and the number of passes such as 3-pass and 5-pass. By considering open problems in the literature, we propose a novel identification scheme based on multivariate quadratic polynomials. Then, we compare them in terms of efficiency. We also provide a discussion for cloud, IoT, and big data applications of quantum secure identification schemes.
Identification schemes are used to verify identities of parties and signatures. Recently, systems based on multivariate polynomials have been preferred in identification schemes due to their resistance against quantum attacks. In this paper, we propose a quantum secure 333-pass identification scheme based on multivariate quadratic polynomials. We compare the proposed scheme with the previous ones in view of memory requirements, communication length, and computation time. We define an efficiency metric by using impersonation probability and computation time. According to the comparison results, the proposed one has the same computation time as that of Monteiro et al. and reduces impersonation probability compared to the work of Sakumoto et al. We also propose a new signature scheme constructed from the proposed identification scheme. In addition, we compare the signature scheme with the previous schemes in view of signature and key sizes. We improve the signature size compared to that given in previous work by Chen et al.
When Kevin Ashton proposed the catchword 'Internet of Things' in 1999, little did he know that technology will become an indispensable part of human lives in just two decades. In short, the Internet of Things (IoT), is a catch-all terminology used to describe devices connected to the internet. These devices can share and receive data as well as provide instructions over a network. By design itself, the IoT system requires multicasting data and information to a set of designated devices, securely. Taking everything into account, Broadcast Encryption (BE) seems to be the natural choice to address the problem. BE allows an originator to broadcast ciphertexts to a big group of receivers in a well-organized and competent way, while ensuring that only designated people can decrypt the data. In this work, we put forward the first Identity-Based Broadcast Encryption scheme based on multivariate polynomials that achieves post-quantum security. Multivariate public key cryptosystems (MPKC), touted as one of the most promising post-quantum cryptography candidates, forms the foundation on which our scheme relies upon, which allows it to be very cost-effective and faster when implemented. In addition, it also provides resistance to collusion attack, and as a consequence our scheme can be utilized to form an efficient and robust IoT system.
It is very important that the communicating parties are able to verify their identity in order to communicate with each other properly. Identification schemes are used for this purpose. The identification schemes, widely used in applications, are based on the hardness of the discrete logarithm or integer factorization problem. Shor proposed an algorithm that solve discrete logarithm and factorization problems by using quantum computers in polynomial-time. Therefore, there is a huge need for identification schemes which can be used post-quantum. In this paper, the identification schemes based on hardness of different lattice problems are surveyed. In addition, a new zero-knowledge lattice-based identification scheme is proposed.
The rapid proliferation of Internet of Things (IoT) devices has heightened concerns regarding their security and privacy. Conventional cryptographic methods underpinning IoT security are increasingly threatened by the emergence of quantum computing, which promises to break widely used encryption algorithms such as RSA and ECC. This paper explores post-quantum cryptographic (PQC) algorithms tailored to the resource-constrained nature of IoT environments. It analyzes lattice-based, hash-based, code-based, and multivariate polynomial cryptographic schemes as promising candidates for securing IoT communications against quantum attacks. The paper further discusses implementation challenges, performance considerations, and potential pathways for integrating PQC within existing IoT architectures. Empirical data on computational efficiency and security strength are also presented to guide future deployment.
With the progress of technology and widespread use of internet, the data has become digital. It is getting easier day by day to copy, modify and transform digital data / applications into another form. The term of digital rights management (DRM) has been suggested to limit the use of data in digital media and to protect copyrights. Different architectures / technologies are used to provide DRM. In existing architectures, the user is unaware whether the license, which was purchased, is used by an unauthorized party. In this paper, a structure is given to resolve this problem and fairness property is added for DRM architectures. Moreover, a post-quantum reliable identification protocol based on multivariate quadratic systems, which can be used for access control in DRM architecture, is proposed.
Quantum computing is rapidly advancing and threatens the cryptographic systems that secure digital communications. Classical cryptosystems, such as RSA and ECC, rely on mathematical problems that are difficult for classical computers but can be solved easily by quantum algorithms, such as Shor’s. This challenge underscores the pressing need for Post-Quantum Cryptography (PQC) to safeguard data against both classical and quantum threats. This study provides a comprehensive review of PQC Approaches in securing data against quantum threats b‌y analyzing reviewed journals,‍ conference proceedings, book chapters, and websites. Several researchers reviewed relevant literature published between 2019 and 2026 using the ACM Digital Library, Wiley Online⁠ Library, Taylor & Francis‌, Springer, ScienceDirect, MDPI, IEEE Xplore Digital Library, and Google Scholar. The review evaluates lattice-based, code-based, Hash-based, multivariate, and isogeny-based schemes across security strength, performance, interoperability, and deployment feasibility in heterogeneous environments, including cloud platforms and Internet of Things devices. The findings indicate that lattice-based schemes, particularly CRYSTALS-Kyber and CRYSTALS-Dilithium, currently offer the most balanced trade-off between efficiency and quantum resistance, while Hash-based schemes such as SPHINCS+ prioritize conservative security at notable performance cost. Code-based approaches, including McEliece, demonstrate strong long-term security but remain constrained by large key sizes. The review highlights implementation, energy, migration, and governance barriers that must be addressed before adoption. The review concludes by emphasizing that transitioning to PQC requires a collaborative effort from academia, industry, and government. Future research should focus on integrating lightweight PQC in IoT, 5G/6G, and cloud environments, as well as developing hybrid models that combine classical and quantum-safe systems. Addressing these issues is crucial for establishing secure data protection in the quantum era.