Ran Gelles

Should be better, could be worse // נחיה, נמות, ואז נראה

About

I am a PhD student in the Computer Science Department at UCLA. I work in the Theory and Cryptography lab with Professor Rafail Ostrovsky and Professor Amit Sahai.

I received B.Sc. in Computer Engineering in 2003, and M.Sc in Computer Science in 2009, both from Technion, Israel. My M.Sc. research dealt with the security of theoretical and realistic Quantum Key Distribution Schemes, and was performed under the supervision of Professor Tal Mor.

Contact information

3771 Boelter Hall
Computer Science Department
University of California, Los Angeles (UCLA)
Los Angeles, CA 90095
email: gelles (e) ucla.edu
        

Research Interests

My research interests are: Coding, Computability and Complexity; Cryptography; and Quantum Cryptography;

Publications

Journal Papers

“Security and Composability of Randomness Expansion from Bell Inequalities”.
Serge Fehr, Ran Gelles, Christian Schaffner.
Physical Review A, (87):012335, 2013. [open-access] (also: arXiv:1111.6052)

“Security of the Bennett-Brassard Quantum Key Distribution Protocol Against Collective Attacks”.
Michel Boyer, Ran Gelles, Tal Mor.
Algorithms, 2(2), pages 790–807, 2009. [open-access]

“Semiquantum Key Distribution”.
Michel Boyer, Ran Gelles, Dan Kenigsberg, Tal Mor.
Physical Review A, (79):032341, 2009. [arXiv]

Conference Papers

“Optimal Coding for Streaming Authentication and Interactive Communication”.
Matthew Franklin, Ran Gelles, Rafail Ostrovsky, Leonard Schulman.
CRYPTO 2013. ECCC TR12–104, 2012.

“How to catch L₂-Heavy Hitters on Sliding Windows”.
Vladimir Braverman, Ran Gelles, Rafail Ostrovsky.
COCOON 2013. [arXiv]

“Attacks on Fixed Apparatus Quantum Key Distribution Schemes”.
Michel Boyer, Ran Gelles, Tal Mor.
TPNC 2012, 1st International Conference on the Theory and Practice of Natural Computing. LNCS 7505, pages 97–107. [paper]

“On the Security of Interferometric Quantum Key Distribution”.
Ran Gelles, Tal Mor.
TPNC 2012, 1st International Conference on the Theory and Practice of Natural Computing. LNCS 7505, pages 133–146. [arXiv]

“Multiparty Proximity Testing with Dishonest Majority from Equality Testing”.
Ran Gelles, Rafail Ostrovsky, Kina Winoto.
ICALP 2012, Part II, LNCS 7392, pages 537–548. [eprint]

“Efficient and Explicit Coding for Interactive Communication”.
Ran Gelles, Ankur Moitra, Amit Sahai.
FOCS 2011, Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, pages 768–777.
Preliminary version arXiv:1104.0739 (cs.DS)

“Position-Based Quantum Cryptography: Impossibility and Constructions”.
Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner.
CRYPTO 2011, LNCS 6841, pages 429–446. [arXiv], [watch]

• Also a plenary talk at QIP 2011. [watch]
• In the media: Gilles Brassard, "Quantum information: The conundrum of secure positioning", Nature, 479, pages 307–308, 2011.

Preprints

“Private Interactive Communication Across an Adversarial Channel”.
Ran Gelles, Amit Sahai, Akshay Wadia.
ePrint 2013/259, 2013.

 

Teaching

• Spring 2011: CS181 - Formal Languages and Automata Theory (UCLA).
• Winter 2011: CS181 - Formal Languages and Automata Theory (UCLA).
• Fall 2010: CS181 - Formal Languages and Automata Theory (UCLA).
• Winter 2003: CS236364 - Operating Systems Structure (Technion).