Or Elimelech
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Or Elimelech has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Asaf Cohen
School of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Beer Sheva, Israel
2 shared publications - Ori Shmuel
Ben-Gurion University of the Negev
1 shared publication
Latest Publications
- 11 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (12) , 14124-14136
On PIR and SPIR Over Gaussian MAC
This paper revisits the problems of Private Information Retrieval (PIR) and Symmetric PIR (SPIR). In PIR, a user retrieves a desired message from N replicated, non-communicating databases, each storing the same M messages, while preserving the privacy of the requested message index. SPIR extends this notion further, by additionally protecting the privacy of the databases, ensuring that the user learns no information beyond the requested message. In this paper, we assume a block-fading Additive White Gaussian Noise Multiple Access Channel (AWGN MAC) linking the user and the databases. Previous work [1] presented a joint channel-PIR scheme utilizing the Compute and Forward (C&F) protocol, demonstrating the potential of a joint PIR-channel coding scheme over a separated one, yet still lagging behind the channel capacity and requiring significant computational complexity. We propose an improved scheme that offers reduced computational complexity while improving the achievable rate for finite parameters, as well as its scaling laws. Specifically, the achievable rate outperforms the C&F-based approach and scales with the number of databases N and the power P similarly to the channel capacity without the privacy constraint. Furthermore, the analysis demonstrates that the improved rate exhibits only a finite gap from this unconstrained channel capacity – 1 bit/sec/Hz as N increases. Finally, we provide two SPIR schemes. The first is a modification for our PIR scheme to attain SPIR with no rate loss, which is accomplished by introducing shared common randomness among databases. The second is a novel joint channel-SPIR scheme that utilizes the channel and lattice codes characteristics to nontrivially achieve SPIR without requiring common randomness, at the price of a loss in the achievable rate.
- 11 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (12) , 14124-14136
On PIR and SPIR Over Gaussian MAC
This paper revisits the problems of Private Information Retrieval (PIR) and Symmetric PIR (SPIR). In PIR, a user retrieves a desired message from N replicated, non-communicating databases, each storing the same M messages, while preserving the privacy of the requested message index. SPIR extends this notion further, by additionally protecting the privacy of the databases, ensuring that the user learns no information beyond the requested message. In this paper, we assume a block-fading Additive White Gaussian Noise Multiple Access Channel (AWGN MAC) linking the user and the databases. Previous work [1] presented a joint channel-PIR scheme utilizing the Compute and Forward (C&F) protocol, demonstrating the potential of a joint PIR-channel coding scheme over a separated one, yet still lagging behind the channel capacity and requiring significant computational complexity. We propose an improved scheme that offers reduced computational complexity while improving the achievable rate for finite parameters, as well as its scaling laws. Specifically, the achievable rate outperforms the C&F-based approach and scales with the number of databases N and the power P similarly to the channel capacity without the privacy constraint. Furthermore, the analysis demonstrates that the improved rate exhibits only a finite gap from this unconstrained channel capacity – 1 bit/sec/Hz as N increases. Finally, we provide two SPIR schemes. The first is a modification for our PIR scheme to attain SPIR with no rate loss, which is accomplished by introducing shared common randomness among databases. The second is a novel joint channel-SPIR scheme that utilizes the channel and lattice codes characteristics to nontrivially achieve SPIR without requiring common randomness, at the price of a loss in the achievable rate.
- 8 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (10) , 7521-7524
Corrections to “Private Information Retrieval Over Gaussian MAC”
Abstract-In the above article [1], the authors introduced a PIR scheme for the Additive White Gaussian Noise (AWGN) Multiple Access Channel (MAC), both with and without fading. The authors utilized the additive nature of the channel and leveraged the linear properties and structure of lattice codes to retrieve the desired message without the servers acquiring any knowledge about the retrieved message’s index. Theorems 3 and 4 in [1] contain an error arising from the incorrect usage of the modulo operator. Moreover, the proofs assume a one-to-one mapping function, ɸ(·), between a message Wj ϵ FpL and the elements of C, mistakenly suggesting that the user possesses all the required information in advance. To deal with that, we defined ɸ(·) as a one-to-one mapping function between a vector of l information bits and a lattice point λ ϵ C. Herein, we present the corrected versions of these theorems.
- 8 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (10) , 7521-7524
Corrections to “Private Information Retrieval Over Gaussian MAC”
Abstract-In the above article [1], the authors introduced a PIR scheme for the Additive White Gaussian Noise (AWGN) Multiple Access Channel (MAC), both with and without fading. The authors utilized the additive nature of the channel and leveraged the linear properties and structure of lattice codes to retrieve the desired message without the servers acquiring any knowledge about the retrieved message’s index. Theorems 3 and 4 in [1] contain an error arising from the incorrect usage of the modulo operator. Moreover, the proofs assume a one-to-one mapping function, ɸ(·), between a message Wj ϵ FpL and the elements of C, mistakenly suggesting that the user possesses all the required information in advance. To deal with that, we defined ɸ(·) as a one-to-one mapping function between a vector of l information bits and a lattice point λ ϵ C. Herein, we present the corrected versions of these theorems.