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

Secure Computation with Low Communication from Cross-Checking

Steven Gordon, Samuel Ranellucci, Xiao Shaun Wang

Published Jan 1, 2018• 35 citations
Publisher
DOI
10.1007/978-3-030-03332-3_3

Related papers

Secure Two-Party Computation with Low Communication

Ivan Damgård, Sebastian Faust, Carmit Hazay

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

Best of Both Worlds in Secure Computation, with Low Communication Overhead

Daniel Genkin, Steven Gordon, Samuel Ranellucci

Lecture notes in computer science•Jan 1, 2018•1 citation

Secure and Reliable 6G Communications with BCH-Based GLDPC and Kyber

Linh Nguyen, Cheol-Hong Min, Hanho Lee +1 more

Channel coding in sixth-generation (6G) networks must attain exceptionally low bit error rate (BER), typically in the range of 10–6to 10–9, to ensure the requisite level of reliability. While fifth-generation (5G) New Radio (NR) coding techniques have made substantial progress, the inherent limitations of the low error floor impede the attainment of such stringent BER targets. Compared to the low-density parity check (LDPC) codes employed in 5G communications, generalized low-density parity check (GLDPC) codes offer a more advantageous tradeoff between computational complexity and error correction performance in 6G networks. GLDPC codes enhance traditional LDPC structures by incorporating more complex local decoding units within their check nodes. When coupled with cryptographic techniques, GLDPC codes can establish a robust information security framework. In this paper, we propose a new security-based GLDPC that uses a number of BCH matrices for the GLDPC decoding process combined with the Kyber algorithm (BCH-based KyGLDPC) before transmitting data to increase reli-ability and solve the security problem against quantum computer attacks. The system's performance is assessed using both image data and data encrypted prior to transmission in a white additive Gaussian noise environment. The results indicate that the system provides strong error correction and data security.

International Conference on Consumer Electronics•Jan 11, 2025•1 citation

Quantum key distribution with Einstein–Podolsky–Rosen pairs associated with weak cross-Kerr nonlinearities

Xiao‐Ming Xiu, Li Dong, Yajun Gao +1 more

We propose a protocol sharing Einstein–Podolsky–Rosen pairs based on weak cross-Kerr nonlinearities and the coherent state at first. If the security check is passed, the checked photons can be applied in the next communication process due to the application of quantum nondemolition measurements, which improves the efficiency and the security of the distribution process. As its applications, we present two quantum key distribution protocols. A random key can be transmitted using the path analyzers based on the idea of BBM92-QKD protocol. Moreover, the sender performs the parity measurement and publicizes the measurement outcomes, and thus the recipient performs computational basis measurements to obtain a deterministic key.

Journal of the Optical Society of America B•Sep 21, 2012•9 citations

Unconditionally Secure Computation Against Low-Complexity Leakage

Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan

Journal of Cryptology•Aug 9, 2021•6 citations

Secure Computation

Silvio M. Micali, Phillip Rogaway

Springer eBooks•Aug 11, 2007•153 citations
Channel coding in sixth-generation (6G) networks must attain exceptionally low bit error rate (BER), typically in the range of 10–6to 10–9, to ensure the requisite level of reliability. While fifth-generation (5G) New Radio (NR) coding techniques have made substantial progress, the inherent limitations of the low error floor impede the attainment of such stringent BER targets. Compared to the low-density parity check (LDPC) codes employed in 5G communications, generalized low-density parity check (GLDPC) codes offer a more advantageous tradeoff between computational complexity and error correction performance in 6G networks. GLDPC codes enhance traditional LDPC structures by incorporating more complex local decoding units within their check nodes. When coupled with cryptographic techniques, GLDPC codes can establish a robust information security framework. In this paper, we propose a new security-based GLDPC that uses a number of BCH matrices for the GLDPC decoding process combined with the Kyber algorithm (BCH-based KyGLDPC) before transmitting data to increase reli-ability and solve the security problem against quantum computer attacks. The system's performance is assessed using both image data and data encrypted prior to transmission in a white additive Gaussian noise environment. The results indicate that the system provides strong error correction and data security.
We propose a protocol sharing Einstein–Podolsky–Rosen pairs based on weak cross-Kerr nonlinearities and the coherent state at first. If the security check is passed, the checked photons can be applied in the next communication process due to the application of quantum nondemolition measurements, which improves the efficiency and the security of the distribution process. As its applications, we present two quantum key distribution protocols. A random key can be transmitted using the path analyzers based on the idea of BBM92-QKD protocol. Moreover, the sender performs the parity measurement and publicizes the measurement outcomes, and thus the recipient performs computational basis measurements to obtain a deterministic key.