Semi-Quantum Key Distribution. - Michel Boyer; Ran Gelles; Dan Kenigsberg; Tal Mor (CoRR, 2008)

Security of the Bennett-Brassard Quantum Key Distribution Protocol against Collective Attacks. - Michel Boyer; Ran Gelles; Tal Mor (Algorithms, 2009)

How to Catch L_2-Heavy-Hitters on Sliding Windows - Vladimir Braverman; Ran Gelles; Rafail Ostrovsky (CoRR, 2010)

Position-Based Quantum Cryptography: Impossibility and Constructions. - Harry Buhrman; Nishanth Chandran; Serge Fehr; Ran Gelles; Vipul Goyal; Rafail Ostrovsky; Christian Schaffner (CRYPTO, 2011)

Efficient and Explicit Coding for Interactive Communication. - Ran Gelles; Ankur Moitra; Amit Sahai (FOCS, 2011)

Potent Tree Codes and their applications: Coding for Interactive Communication, revisited - Ran Gelles; Amit Sahai (CoRR, 2011)

Security and Composability of Randomness Expansion from Bell Inequalities - Serge Fehr; Ran Gelles; Christian Schaffner (CoRR, 2011)

Multiparty Proximity Testing with Dishonest Majority from Equality Testing. - Ran Gelles; Rafail Ostrovsky; Kina Winoto (ICALP (2), 2012)

Attacks on Fixed Apparatus Quantum Key Distribution Schemes. - Michel Boyer; Ran Gelles; Tal Mor (TPNC, 2012)

On the Security of Interferometric Quantum Key Distribution. - Ran Gelles; Tal Mor (TPNC, 2012)

How to Catch L 2-Heavy-Hitters on Sliding Windows. - Vladimir Braverman; Ran Gelles; Rafail Ostrovsky (COCOON, 2013)

Optimal Coding for Streaming Authentication and Interactive Communication. - Matthew K. Franklin; Ran Gelles; Rafail Ostrovsky; Leonard J. Schulman (CRYPTO (2), 2013)

Private interactive communication across an adversarial channel. - Ran Gelles; Amit Sahai; Akshay Wadia (ITCS, 2014)

Efficient Error-Correcting Codes for Sliding Windows. - Ran Gelles; Rafail Ostrovsky; Alan Roytman (SOFSEM, 2014)

How to catch L2-heavy-hitters on sliding windows. - Vladimir Braverman; Ran Gelles; Rafail Ostrovsky (Theor. Comput. Sci., 2014)

Efficient Coding for Interactive Communication. - Ran Gelles; Ankur Moitra; Amit Sahai (IEEE Trans. Inf. Theory, 2014)

On Interactive Computation over a Noisy Channel. - Ran Gelles (2014)

Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback. - Klim Efremenko; Ran Gelles; Bernhard Haeupler (ITCS, 2015)

Capacity of Interactive Communication over Erasure Channels and Channels with Feedback. - Ran Gelles; Bernhard Haeupler (SODA, 2015)

A Little Honesty Goes a Long Way - The Two-Tier Model for Secure Multiparty Computation. - Juan A. Garay; Ran Gelles; David S. Johnson 001; Aggelos Kiayias; Moti Yung (TCC (1), 2015)

Coding for Interactive Communication Correcting Insertions and Deletions. - Mark Braverman; Ran Gelles; Jieming Mao; Rafail Ostrovsky (ICALP, 2016)

Adaptive protocols for interactive communication. - Shweta Agrawal 001; Ran Gelles; Amit Sahai (ISIT, 2016)

Reliable Communication over Highly Connected Noisy Networks. - Noga Alon; Mark Braverman; Klim Efremenko; Ran Gelles; Bernhard Haeupler (PODC, 2016)

Towards Optimal Deterministic Coding for Interactive Communication. - Ran Gelles; Bernhard Haeupler; Gillat Kol; Noga Ron-Zewi; Avi Wigderson (SODA, 2016)

Constant-rate coding for multiparty interactive communication is impossible. - Mark Braverman; Klim Efremenko; Ran Gelles; Bernhard Haeupler (STOC, 2016)

Optimal Resilience for Short-Circuit Noise in Formulas. - Mark Braverman; Ran Gelles; Michael A. Yitayew (Electron. Colloquium Comput. Complex., 2016)

Constant-Rate Interactive Coding Is Impossible, Even In Constant-Degree Networks. - Ran Gelles; Yael Tauman Kalai (ITCS, 2017)

Coding for Interactive Communication: A Survey. - Ran Gelles (Found. Trends Theor. Comput. Sci., 2017)

Making Asynchronous Distributed Computations Robust to Channel Noise. - Keren Censor-Hillel; Ran Gelles; Bernhard Haeupler (ITCS, 2018)

Secure Two-Party Computation over Unreliable Channels. - Ran Gelles; Anat Paskin-Cherniavsky; Vassilis Zikas (SCN, 2018)

Explicit Capacity Approaching Coding for Interactive Communication. - Ran Gelles; Bernhard Haeupler; Gillat Kol; Noga Ron-Zewi; Avi Wigderson (IEEE Trans. Inf. Theory, 2018)

Optimal Short-Circuit Resilient Formulas. - Mark Braverman; Klim Efremenko; Ran Gelles; Michael A. Yitayew (CCC, 2019)

Interactive Coding Resilient to an Unknown Number of Erasures. - Ran Gelles; Siddharth Iyer (OPODIS, 2019)

Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions. - Ran Gelles; Yael Tauman Kalai; Govind Ramnarayan (PODC, 2019)

Making asynchronous distributed computations robust to noise. - Keren Censor-Hillel; Ran Gelles; Bernhard Haeupler (Distributed Comput., 2019)

Brief Announcement: Noisy Beeping Networks. - Yagel Ashkenazi; Ran Gelles; Amir Leshem (PODC, 2020)

Multiparty Interactive Communication with Broadcast Links. - Manuj Mukherjee; Ran Gelles (ITW, 2021)

The Topology of Randomized Symmetry-Breaking Distributed Computing. - Pierre Fraigniaud; Ran Gelles; Zvi Lotker (PODC, 2021)

Multiparty Interactive Coding Over Networks of Intersecting Broadcast Links. - Manuj Mukherjee; Ran Gelles (IEEE J. Sel. Areas Inf. Theory, 2021)

Efficient Multiparty Interactive Coding - Part I: Oblivious Insertions, Deletions and Substitutions. - Ran Gelles; Yael Tauman Kalai; Govind Ramnarayan (IEEE Trans. Inf. Theory, 2021)

Distributed Computations in Fully-Defective Networks. - Keren Censor-Hillel; Shir Cohen; Ran Gelles; Gal Sela 001 (PODC, 2022)

Noisy beeping networks. - Yagel Ashkenazi; Ran Gelles; Amir Leshem (Inf. Comput., 2022)

Efficient Multiparty Interactive Coding - Part II: Non-Oblivious Noise. - Ran Gelles; Yael Tauman Kalai; Govind Ramnarayan (IEEE Trans. Inf. Theory, 2022)

Beeping Shortest Paths via Hypergraph Bipartite Decomposition. - Fabien Dufoulon; Yuval Emek; Ran Gelles (ITCS, 2023)

Towards Optimal Communication Byzantine Reliable Broadcast under a Message Adversary. - Timothé Albouy; Davide Frey; Ran Gelles; Carmit Hazay; Michel Raynal; Elad Michael Schiller; François Taïani; Vassilis Zikas (CoRR, 2023)

Correction to: Distributed computations in fully-defective networks. - Keren Censor-Hillel; Shir Cohen; Ran Gelles; Gal Sela 001 (Distributed Comput., 2023)

Interactive Coding with Unbounded Noise. - Eden Fargion; Ran Gelles; Meghal Gupta (APPROX/RANDOM, 2024)

Information Exchange is Harder with Noise at Source. - Manuj Mukherjee; Ran Gelles (ISIT, 2024)

Computation in Server-Assisted Noisy Networks. - Manuj Mukherjee; Ran Gelles (ISIT, 2024)

Near-Optimal Communication Byzantine Reliable Broadcast Under a Message Adversary. - Timothé Albouy; Davide Frey; Ran Gelles; Carmit Hazay; Michel Raynal; Elad Michael Schiller; François Taïani; Vassilis Zikas (OPODIS, 2024)

Brief Announcement: Content-Oblivious Leader Election on Rings. - Fabian Frei; Ran Gelles; Ahmed Ghazy; Alexandre Nolin (PODC, 2024)

Brief Announcement: Towards Optimal Communication Byzantine Reliable Broadcast Under a Message Adversary. - Timothé Albouy; Davide Frey; Ran Gelles; Carmit Hazay; Michel Raynal; Elad Michael Schiller; François Taïani; Vassilis Zikas (DISC, 2024)

Content-Oblivious Leader Election on Rings. - Fabian Frei; Ran Gelles; Ahmed Ghazy; Alexandre Nolin (DISC, 2024)

Sorting in One and Two Rounds Using t-Comparators. - Ran Gelles; Zvi Lotker; Frederik Mallmann-Trenn (DISC, 2024)

Nearly Optimal Parallel Broadcast in the Plain Public Key Model. - Ran Gelles; Christoph Lenzen 001; Julian Loss; Sravya Yandamuri (CRYPTO (2), 2025)

Two for One, One for All: Deterministic LDC-Based Robust Computation in Congested Clique. - Keren Censor-Hillel; Orr Fischer; Ran Gelles; Pedro Soto 001 (DISC, 2025)

A Constant-Rate Compiler for MPC over Noisy Networks. - Ran Gelles; Carmit Hazay; Manuj Mukherjee; Jaspal Singh; Arun Yeragudipati; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2025)

Cybersecurity of Quantum Key Distribution Implementations. - Ittay Alfassi; Ran Gelles; Rotem Liss; Tal Mor (CoRR, 2025)