VLDB 2026 Research / reviewers in the wild / expert
Ohad Kimelfeld
dblp:402/6711
· DBLP profile ↗
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
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Covert Entanglement Generation and SecrecyabstractWe 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. Theory | 1 |
| 2025 | Covert Entanglement Generation and SecrecyabstractWe 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 |
ITW | 1 |