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

Reproducible Circularly-Secure Bit Encryption: Applications and Realizations

Mohammad Hajiabadi, Bruce M. Kapron

Published Jan 1, 2015• 14 citations
Publisher
DOI
10.1007/978-3-662-47989-6_11

Related papers

Improved Circular Secure Homomorphic Encryption Scheme

Meng Wu, Xiufeng Zhao, Yu Fu +1 more

International Conference on Computational Intelligence and Security (CIS)•Jan 1, 2023•0 citations

Circular and KDM Security for Identity-Based Encryption

Jacob Alperin-Sheriff, Chris Peikert

Lecture notes in computer science•Jan 1, 2012•81 citations

Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability

Zvika Brakerski, Shafi Goldwasser

Lecture notes in computer science•Jan 1, 2010•155 citations

Quantum public key encryption scheme with four states key

Zhixin Liu, Qiaoling Xie, Yongfu Zha +1 more

Abstract Asymmetric encryption has some important applications in the field of communication. In classical computers, most public key encryption schemes are designed based on computational assumption. In other words, they can ensure computational security. When the computing power is large enough, it will pose a threat to these encryption schemes. We propose a quantum public key encryption scheme which based on properties of quantum physics. Our scheme realizes encryption and decryption with few resources and does not rely on any computational assumption. The key in our scheme consists of classical bits and qubits. Where the private key are classical bit and public key are qubits. The public key are generated through private key. We analyze the performance and security of the scheme. Our scheme ensures the information-theoretic secure and can be implemented easily.

Physica Scripta•Feb 22, 2022•5 citations

Robust Encryption Framework for IoT Devices Based on Bit-plane Extraction, Chaotic Sine Models, and Quantum Operations

Mujeeb Ur Rehman, Arslan Shafqiue

In the domain of Internet of Things (IoT) applications, quantum computers offer the promise of addressing complex computational issues that traditional cryptographic methods find challenging. The unparalleled computational power of quantum computers makes existing cryptographic schemes, tailored to mitigate computational complexity, ineffective. This research introduces a robust encryption scheme designed specifically for digital data exchanged between IoT devices such as smartphones, smart sensors, and smart health monitoring devices. The proposed encryption framework is based on bit-plane extraction-based encryption, the chaotic sine model, the hyperchaotic map, the quantum baker map, and quantum operations such as quantum selective scrambling. The proposed methodology involves three key phases: the first and last phase related to permutation, which is performed at the bit level based on discrete bit-plane scrambling, bit-plane extraction, and hyperchaotic mapping. However, the second phase is based on diffusion, which depends on the chaotic sine model. During the initial stage, creating correlations among image pixels, along with a couple of chaotic sequences using a quantum baker map, is accomplished through a superposition of quantum- states. Before applying diffusion, the pixels of the grayscale image are encoded using a single qubit, and quantum operations are based on a quantum circuit featuring swap gates. To introduce pixel-level permutation, a hyperchaotic map generates random sequences within the range of 0 to 255. A circular shift further shuffles the pixel rows and pixel columns of the permuted image pixels. To enhance the digital image security further, bit-planes are extracted from the permuted bit-planes. Then, the bits within each bit plane are scrambled using a random sequence generated by the hyperchaotic map. Finally, the encoded bit planes are merged to produce a final encrypted image. Experimental results demonstrate the effectiveness of the proposed methodology, with security parameters such as correlation, entropy, and key space measuring at 0.0001, 7.999, and >2100, respectively. Furthermore, to assess performance in relation to computational complexity, a detailed analysis of computational time is conducted. The results reveal that the proposed encryption scheme can execute all encryption steps presented in the proposed method in less than one second. These findings demonstrate the secure transmission of digital data between IoT devices and show the suitability of the proposed encryption scheme for real-time applications.

Internet of Things•Jun 2, 2024•13 citations

Efficient fully homomorphic encryption with circularly secure key switching process

Tanping Zhou, Xiaoyuan Yang, Wei Zhang +1 more

Fully homomorphic encryption (FHE) has important applications in cloud computing. However, almost all fully homomorphic encryption schemes share two common flaws that they all use large-scale secret keys and some operations are inefficient. In this paper, the 'special b' variant of the learning with errors problem (bLWE) is presented, and helps us construct the first circularly secure key switching process which can replace the key switching process and similar re-linearisation process used by the existing FHE schemes. Then, we present an efficient FHE. Compared with Brakerski's scheme, our scheme reduces L secret keys to one and is more efficient. Finally, we prove the chosen-plaintext attack (CPA) security of the fully homomorphic scheme and the circular security of key switching process in standard model under the learning with errors problem (LWE) assumption.

International Journal of High Performance Computing and Networking•Jan 1, 2016•8 citations
Abstract Asymmetric encryption has some important applications in the field of communication. In classical computers, most public key encryption schemes are designed based on computational assumption. In other words, they can ensure computational security. When the computing power is large enough, it will pose a threat to these encryption schemes. We propose a quantum public key encryption scheme which based on properties of quantum physics. Our scheme realizes encryption and decryption with few resources and does not rely on any computational assumption. The key in our scheme consists of classical bits and qubits. Where the private key are classical bit and public key are qubits. The public key are generated through private key. We analyze the performance and security of the scheme. Our scheme ensures the information-theoretic secure and can be implemented easily.
In the domain of Internet of Things (IoT) applications, quantum computers offer the promise of addressing complex computational issues that traditional cryptographic methods find challenging. The unparalleled computational power of quantum computers makes existing cryptographic schemes, tailored to mitigate computational complexity, ineffective. This research introduces a robust encryption scheme designed specifically for digital data exchanged between IoT devices such as smartphones, smart sensors, and smart health monitoring devices. The proposed encryption framework is based on bit-plane extraction-based encryption, the chaotic sine model, the hyperchaotic map, the quantum baker map, and quantum operations such as quantum selective scrambling. The proposed methodology involves three key phases: the first and last phase related to permutation, which is performed at the bit level based on discrete bit-plane scrambling, bit-plane extraction, and hyperchaotic mapping. However, the second phase is based on diffusion, which depends on the chaotic sine model. During the initial stage, creating correlations among image pixels, along with a couple of chaotic sequences using a quantum baker map, is accomplished through a superposition of quantum- states. Before applying diffusion, the pixels of the grayscale image are encoded using a single qubit, and quantum operations are based on a quantum circuit featuring swap gates. To introduce pixel-level permutation, a hyperchaotic map generates random sequences within the range of 0 to 255. A circular shift further shuffles the pixel rows and pixel columns of the permuted image pixels. To enhance the digital image security further, bit-planes are extracted from the permuted bit-planes. Then, the bits within each bit plane are scrambled using a random sequence generated by the hyperchaotic map. Finally, the encoded bit planes are merged to produce a final encrypted image. Experimental results demonstrate the effectiveness of the proposed methodology, with security parameters such as correlation, entropy, and key space measuring at 0.0001, 7.999, and >2100, respectively. Furthermore, to assess performance in relation to computational complexity, a detailed analysis of computational time is conducted. The results reveal that the proposed encryption scheme can execute all encryption steps presented in the proposed method in less than one second. These findings demonstrate the secure transmission of digital data between IoT devices and show the suitability of the proposed encryption scheme for real-time applications.
Fully homomorphic encryption (FHE) has important applications in cloud computing. However, almost all fully homomorphic encryption schemes share two common flaws that they all use large-scale secret keys and some operations are inefficient. In this paper, the 'special b' variant of the learning with errors problem (bLWE) is presented, and helps us construct the first circularly secure key switching process which can replace the key switching process and similar re-linearisation process used by the existing FHE schemes. Then, we present an efficient FHE. Compared with Brakerski's scheme, our scheme reduces L secret keys to one and is more efficient. Finally, we prove the chosen-plaintext attack (CPA) security of the fully homomorphic scheme and the circular security of key switching process in standard model under the learning with errors problem (LWE) assumption.