Ran Gelles

Orcid: 0000-0003-3615-3239

Affiliations:
  • Bar-Ilan University, Ramat-Gan, Israel


According to our database1, Ran Gelles authored at least 58 papers between 2008 and 2025.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Cybersecurity of Quantum Key Distribution Implementations.
CoRR, August, 2025

A Constant-Rate Compiler for MPC over Noisy Networks.
IACR Cryptol. ePrint Arch., 2025

Two for One, One for All: Deterministic LDC-Based Robust Computation in Congested Clique.
Proceedings of the 39th International Symposium on Distributed Computing, 2025

Nearly Optimal Parallel Broadcast in the Plain Public Key Model.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
Sorting in One and Two Rounds Using t-Comparators.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

Content-Oblivious Leader Election on Rings.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

Brief Announcement: Towards Optimal Communication Byzantine Reliable Broadcast Under a Message Adversary.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

Brief Announcement: Content-Oblivious Leader Election on Rings.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Near-Optimal Communication Byzantine Reliable Broadcast Under a Message Adversary.
Proceedings of the 28th International Conference on Principles of Distributed Systems, 2024

Computation in Server-Assisted Noisy Networks.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Information Exchange is Harder with Noise at Source.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Interactive Coding with Unbounded Noise.
Proceedings of the Approximation, 2024

2023
Correction to: Distributed computations in fully-defective networks.
Distributed Comput., December, 2023

Towards Optimal Communication Byzantine Reliable Broadcast under a Message Adversary.
CoRR, 2023

Beeping Shortest Paths via Hypergraph Bipartite Decomposition.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022
Efficient Multiparty Interactive Coding - Part II: Non-Oblivious Noise.
IEEE Trans. Inf. Theory, 2022

Noisy beeping networks.
Inf. Comput., 2022

Distributed Computations in Fully-Defective Networks.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021
Efficient Multiparty Interactive Coding - Part I: Oblivious Insertions, Deletions and Substitutions.
IEEE Trans. Inf. Theory, 2021

Multiparty Interactive Coding Over Networks of Intersecting Broadcast Links.
IEEE J. Sel. Areas Inf. Theory, 2021

The Topology of Randomized Symmetry-Breaking Distributed Computing.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Multiparty Interactive Communication with Broadcast Links.
Proceedings of the IEEE Information Theory Workshop, 2021

2020
Brief Announcement: Noisy Beeping Networks.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019
Making asynchronous distributed computations robust to noise.
Distributed Comput., 2019

Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Interactive Coding Resilient to an Unknown Number of Erasures.
Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019

Optimal Short-Circuit Resilient Formulas.
Proceedings of the 34th Computational Complexity Conference, 2019

2018
Explicit Capacity Approaching Coding for Interactive Communication.
IEEE Trans. Inf. Theory, 2018

Secure Two-Party Computation over Unreliable Channels.
Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

Making Asynchronous Distributed Computations Robust to Channel Noise.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017
Coding for Interactive Communication: A Survey.
Found. Trends Theor. Comput. Sci., 2017

Constant-Rate Interactive Coding Is Impossible, Even In Constant-Degree Networks.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016
Optimal Resilience for Short-Circuit Noise in Formulas.
Electron. Colloquium Comput. Complex., 2016

Constant-rate coding for multiparty interactive communication is impossible.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Towards Optimal Deterministic Coding for Interactive Communication.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Reliable Communication over Highly Connected Noisy Networks.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Adaptive protocols for interactive communication.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Coding for Interactive Communication Correcting Insertions and Deletions.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
A Little Honesty Goes a Long Way - The Two-Tier Model for Secure Multiparty Computation.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Capacity of Interactive Communication over Erasure Channels and Channels with Feedback.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

2014
On Interactive Computation over a Noisy Channel.
PhD thesis, 2014

Efficient Coding for Interactive Communication.
IEEE Trans. Inf. Theory, 2014

How to catch L<sub>2</sub>-heavy-hitters on sliding windows.
Theor. Comput. Sci., 2014

Efficient Error-Correcting Codes for Sliding Windows.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Private interactive communication across an adversarial channel.
Proceedings of the Innovations in Theoretical Computer Science, 2014

2013
Optimal Coding for Streaming Authentication and Interactive Communication.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

How to Catch <i>L</i> <sub>2</sub>-Heavy-Hitters on Sliding Windows.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012
On the Security of Interferometric Quantum Key Distribution.
Proceedings of the Theory and Practice of Natural Computing, 2012

Attacks on Fixed Apparatus Quantum Key Distribution Schemes.
Proceedings of the Theory and Practice of Natural Computing, 2012

Multiparty Proximity Testing with Dishonest Majority from Equality Testing.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Security and Composability of Randomness Expansion from Bell Inequalities
CoRR, 2011

Potent Tree Codes and their applications: Coding for Interactive Communication, revisited
CoRR, 2011

Efficient and Explicit Coding for Interactive Communication.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Position-Based Quantum Cryptography: Impossibility and Constructions.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2010
How to Catch L_2-Heavy-Hitters on Sliding Windows
CoRR, 2010

2009
Security of the Bennett-Brassard Quantum Key Distribution Protocol against Collective Attacks.
Algorithms, 2009

2008
Semi-Quantum Key Distribution.
CoRR, 2008


  Loading...