Ran Gelles

According to our database1, Ran Gelles authored at least 36 papers between 2008 and 2019.

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



In proceedings 
PhD thesis 



On csauthors.net:


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

Reliable communication over highly connected noisy networks.
Distributed Computing, 2019

Noisy Beeping Networks.
CoRR, 2019

Efficient Multiparty Interactive Coding for Insertions, Deletions and Substitutions.
CoRR, 2019

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

Constant-Rate Coding for Multiparty Interactive Communication Is Impossible.
J. ACM, 2018

Secure Two-Party Computation over Unreliable Channels.
IACR Cryptology ePrint Archive, 2018

Interactive coding resilient to an unknown number of erasures.
CoRR, 2018

Optimal Short-Circuit Resilient Formulas.
CoRR, 2018

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

Coding for Interactive Communication Correcting Insertions and Deletions.
IEEE Trans. Information Theory, 2017

Capacity of Interactive Communication over Erasure Channels and Channels with Feedback.
SIAM J. Comput., 2017

Coding for Interactive Communication: A Survey.
Foundations and Trends in Theoretical Computer Science, 2017

Constant-Rate Interactive Coding Is Impossible, Even In Constant-Degree Networks.
Electronic Colloquium on Computational Complexity (ECCC), 2017

Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback.
IEEE Trans. Information Theory, 2016

Optimal Resilience for Short-Circuit Noise in Formulas.
Electronic Colloquium on Computational Complexity (ECCC), 2016

Private Interactive Communication Across an Adversarial Channel.
IEEE Trans. Information Theory, 2015

Towards Optimal Deterministic Coding for Interactive Communication.
Electronic Colloquium on Computational Complexity (ECCC), 2015

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

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

How to catch L2-heavy-hitters on sliding windows.
Theor. Comput. Sci., 2014

A Little Honesty Goes a Long Way: The Two-Tier Model for Secure Multiparty Computation.
IACR Cryptology ePrint Archive, 2014

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

Attacks on Fixed Apparatus Quantum Key Distribution Schemes.
CoRR, 2013

Adaptive Protocols for Interactive Communication.
CoRR, 2013

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

Multiparty Proximity Testing with Dishonest Majority from Equality Testing.
IACR Cryptology ePrint Archive, 2012

Optimal Coding for Streaming Authentication and Interactive Communication.
Electronic Colloquium on Computational Complexity (ECCC), 2012

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

On the Security of Interferometric Quantum Key Distribution
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

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

Position-Based Quantum Cryptography: Impossibility and Constructions
CoRR, 2010

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

Semi-Quantum Key Distribution.
CoRR, 2008