Ohad Kimelfeld

dblp:402/6711 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2026
0009-0007-8398-0719ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Quantum computing and quantum information · 61% Information theory · 39%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory › information-theoretic security
covert communication
1.012026
Covert Entanglement Generation and Secrecy · IEEE Trans. Inf. Theory 2026
Quantum computing and quantum information
quantum channel capacity
1.012026
Covert Entanglement Generation and Secrecy · IEEE Trans. Inf. Theory 2026
Information theory › information-theoretic security
secrecy capacity
0.312026
Covert Entanglement Generation and Secrecy · IEEE Trans. Inf. Theory 2026

Methods — techniques the papers use, named apart from their topics

square root law · 1.0coding scheme · 1.0
YearPublicationVenuePosition
2026 Covert Entanglement Generation and Secrecy
abstract
We determine the covert capacity for entanglement generation over a noisy quantum channel. While secrecy guarantees that the transmitted information remains inaccessible to an adversary, covert communication ensures that the transmission itself remains undetectable. The entanglement dimension follows a square root law (SRL) in the covert setting, i.e., $O(\sqrt{n})$ Einstein-Podolsky-Rosen (EPR) pairs can be distributed covertly and reliably over $n$ channel uses. We begin with covert communication of classical information under a secrecy constraint. We then leverage this result to construct a coding scheme for covert entanglement generation. Single-letter expressions are derived for the covert key-assisted and unassisted secrecy capacities, as well as for the covert entanglement-generation capacity.
Ohad Kimelfeld, Boulat A. Bash, Uzi Pereg
IEEE Trans. Inf. Theory1
2025 Covert Entanglement Generation and Secrecy
abstract
We determine the covert capacity for entanglement generation over a noisy quantum channel. While secrecy guarantees that the transmitted information remains inaccessible to an adversary, covert communication ensures that the transmission itself remains undetectable. The entanglement dimension follows a square root law (SRL) in the covert setting, i.e., $O\left( {\sqrt n } \right)$ EPR pairs can be distributed covertly and reliably over n channel uses. We begin with covert communication of classical information under a secrecy constraint. We then leverage this result to construct a coding scheme for covert entanglement generation. Consequently, the covert entanglement-generation capacity is the same as for classical information without secrecy, albeit our scheme employs a larger key.
Ohad Kimelfeld, Boulat A. Bash, Uzi Pereg
ITW1