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

Chapman & Hall/CRC eBooks

Perfectly Secret Encryption – Solutions

Jonathan Katz

Published Apr 1, 2026• 0 citations
Publisher
DOI
10.1201/9781003776994-2

Related papers

Pragmatic Physical Layer Encryption for Achieving Perfect Secrecy

Suzhi Bi, Xiaojun Yuan, Ying–Jun Angela Zhang

Conventionally, secrecy is achieved using cryptographic techniques beyond the physical layer. Recent studies raise the interest of performing encryption within the physical layer by exploiting some unique features of the physical wireless channel. Following this spirit, we present a novel physical layer encryption (PLE) scheme that randomizes the radio signal using a secret key extracted from the wireless channel under the assumption of channel reciprocity. Specifically, we propose to jointly design the encryption function and the secret-key generation method. On one hand, we establish a sufficient and necessary condition for the encryption function to achieve perfect secrecy. Based on that, several candidate encryption functions are proposed and compared. We show that, given the secret key available to the legitimate users, perfect secrecy can be achieved without compromising the capability of the communication channel. On the other hand, we study the practical design of the secret-key generation method based on the channel reciprocity. We show that, by introducing marginal system overhead, the key agreement between the legitimate users can be done with a high success probability. The performance advantages of the proposed PLE method is verified through comparisons against other existing PLE methods.

arXiv:1210.5599•Oct 20, 2012•3 citations

Beyond the Canonical Protocol: Quantum Encrypted Cloning from Secret-Sharing Access Structures

Gabriele Gianini, Stelvio Cimato, Jianyi Lin +3 more

Quantum encrypted cloning shows that an unknown quantum state can be distributed into multiple encrypted copies without contradicting the no-cloning theorem: each copy is unusable on its own, but can be redeemed together with a suitable quantum key. Recent work has related canonical encrypted-cloning protocols to particular forms of quantum secret sharing. Here we take the converse perspective: instead of mapping a given encrypted-cloning protocol into QSS, we use QSS access structures as a design library from which encrypted-cloning schemes can be extracted. The criterion is access-structural. A QSS scheme supports a quantum encrypted-cloning structure whenever it contains a family of qualified sets with a non-qualified common intersection. The common subsystem is interpreted as the key, while the non-common parts are interpreted as encrypted clones relative to that key. Thus quantum encrypted cloning does not require a new notion of recoverability beyond QSS; what changes is the operational reading of QSS constituents as a mechanism for delayed and alternative redemption opportunities. This viewpoint separates redemption from perfect secrecy. Perfect QSS yields encrypted-cloning schemes with forbidden non-qualified subsystems, whereas ramp QSS naturally allows intermediate, partially informative non-redeeming subsystems. The resulting framework broadens quantum encrypted cloning from a specific protocol to a general access-structure primitive. We illustrate the extraction principle with threshold-like, ramp, hierarchical, and compartmented architectures, showing how encrypted clones may be symmetric or asymmetric, individual or composite, perfectly hidden or leaky. Equivalently, these constructions can be viewed as overlapping erasure-recovery regions of an isometric quantum code. This establishes secret sharing as a systematic design language for encrypted quantum redundancy.

quant-pharXiv:2606.06552•Jun 5, 2026•4 citations

Unclonable Encryption, Revisited

Prabhanjan Ananth, Fatih Kaleoglu

arXiv:2103.15009•Lecture notes in computer science•Jan 1, 2021•34 citations

Public-key Encryption

Jiang Zhang, Zhenfeng Zhang

Springer eBooks•Jan 1, 2020•1 citation

10 Gb/s classical secure key distribution based on temporal steganography and private chaotic phase scrambling

Zhensen Gao, Zhitao Deng, Lihong Zhang +7 more

Secure distribution of high-speed digital encryption/decryption keys over a classical fiber channel is strongly pursued for realizing perfect secrecy communication systems. However, it is still challenging to achieve a secret key rate in the order of tens of gigabits per second to be comparable with the bit rate of commercial fiber-optic systems. In this paper, we propose and experimentally demonstrate a novel solution for high-speed secure key distribution based on temporal steganography and private chaotic phase scrambling in the classical physical layer. The encryption key is temporally concealed into the background noise in the time domain and randomly phase scrambled bit-by-bit by a private chaotic signal, which provides two layers of enhanced security to guarantee the privacy of key distribution while providing a high secret key rate. We experimentally achieved a record classical secret key rate of 10 Gb/s with a bit error rate lower than the hard-decision forward error correction (HD-FEC) over a 40 km standard single mode fiber. The proposed solution holds great promise for achieving high-speed key distribution in the classical fiber channel by combining steganographic transmission and chaotic scrambling.

Photonics Research•Nov 14, 2023•16 citations

Robust Encryption, Revisited

Pooya Farshim, Benoît Libert, Kenneth G. Paterson +1 more

Lecture notes in computer science•Jan 1, 2013•38 citations
Conventionally, secrecy is achieved using cryptographic techniques beyond the physical layer. Recent studies raise the interest of performing encryption within the physical layer by exploiting some unique features of the physical wireless channel. Following this spirit, we present a novel physical layer encryption (PLE) scheme that randomizes the radio signal using a secret key extracted from the wireless channel under the assumption of channel reciprocity. Specifically, we propose to jointly design the encryption function and the secret-key generation method. On one hand, we establish a sufficient and necessary condition for the encryption function to achieve perfect secrecy. Based on that, several candidate encryption functions are proposed and compared. We show that, given the secret key available to the legitimate users, perfect secrecy can be achieved without compromising the capability of the communication channel. On the other hand, we study the practical design of the secret-key generation method based on the channel reciprocity. We show that, by introducing marginal system overhead, the key agreement between the legitimate users can be done with a high success probability. The performance advantages of the proposed PLE method is verified through comparisons against other existing PLE methods.
Quantum encrypted cloning shows that an unknown quantum state can be distributed into multiple encrypted copies without contradicting the no-cloning theorem: each copy is unusable on its own, but can be redeemed together with a suitable quantum key. Recent work has related canonical encrypted-cloning protocols to particular forms of quantum secret sharing. Here we take the converse perspective: instead of mapping a given encrypted-cloning protocol into QSS, we use QSS access structures as a design library from which encrypted-cloning schemes can be extracted. The criterion is access-structural. A QSS scheme supports a quantum encrypted-cloning structure whenever it contains a family of qualified sets with a non-qualified common intersection. The common subsystem is interpreted as the key, while the non-common parts are interpreted as encrypted clones relative to that key. Thus quantum encrypted cloning does not require a new notion of recoverability beyond QSS; what changes is the operational reading of QSS constituents as a mechanism for delayed and alternative redemption opportunities. This viewpoint separates redemption from perfect secrecy. Perfect QSS yields encrypted-cloning schemes with forbidden non-qualified subsystems, whereas ramp QSS naturally allows intermediate, partially informative non-redeeming subsystems. The resulting framework broadens quantum encrypted cloning from a specific protocol to a general access-structure primitive. We illustrate the extraction principle with threshold-like, ramp, hierarchical, and compartmented architectures, showing how encrypted clones may be symmetric or asymmetric, individual or composite, perfectly hidden or leaky. Equivalently, these constructions can be viewed as overlapping erasure-recovery regions of an isometric quantum code. This establishes secret sharing as a systematic design language for encrypted quantum redundancy.
Secure distribution of high-speed digital encryption/decryption keys over a classical fiber channel is strongly pursued for realizing perfect secrecy communication systems. However, it is still challenging to achieve a secret key rate in the order of tens of gigabits per second to be comparable with the bit rate of commercial fiber-optic systems. In this paper, we propose and experimentally demonstrate a novel solution for high-speed secure key distribution based on temporal steganography and private chaotic phase scrambling in the classical physical layer. The encryption key is temporally concealed into the background noise in the time domain and randomly phase scrambled bit-by-bit by a private chaotic signal, which provides two layers of enhanced security to guarantee the privacy of key distribution while providing a high secret key rate. We experimentally achieved a record classical secret key rate of 10 Gb/s with a bit error rate lower than the hard-decision forward error correction (HD-FEC) over a 40 km standard single mode fiber. The proposed solution holds great promise for achieving high-speed key distribution in the classical fiber channel by combining steganographic transmission and chaotic scrambling.