Ling Ren
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ling Ren has a total of 80 co-authors. Here are the top co-authors by number of shared publications:
- Sourav Das
University of Illinois at Urbana-Champaign
8 shared publications - Ittai Abraham
VMware Research
5 shared publications - Atsuki Momose
University of Illinois at Urbana-Champaign, Urbana, IL, USA
4 shared publications - Kartik Nayak
Duke University
4 shared publications - Danny Dolev
The Hebrew University of Jerusalem, Jerusalem, Israel
3 shared publications - Elaine Shi
Computer Science Department Carnegie Mellon University
3 shared publications
Latest Publications
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5166-5178
On the Limits of Consensus under Dynamic Availability and Reconfiguration
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5166-5178
Open AccessOn the Limits of Consensus under Dynamic Availability and Reconfiguration
- 6 May 2026
- Published by Springer Nature
- p. 397-426
Optimal Good-Case Latency for Sleepy Consensus
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
Private Information Retrieval: A Tutorial and Survey
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
Open AccessPrivate Information Retrieval: A Tutorial and Survey
- 8 December 2025
- Published by Springer Nature
- p. 3-34
Randomized Agreement, Verifiable Secret Sharing and Multi-party Computation in Granular Synchrony
- 8 December 2025
- Published by Springer Nature
- p. 3-34
Randomized Agreement, Verifiable Secret Sharing and Multi-party Computation in Granular Synchrony
- Open Access
Optimal Good-Case Latency for Sleepy Consensus
In the context of Byzantine consensus problems such as Byzantine broadcast (BB) and Byzantine agreement (BA), the good-case setting aims to study the minimal possible latency of a BB or BA protocol under certain favorable conditions, namely the designated leader being correct (for BB), or all parties having the same input value (for BA). We provide a full characterization of the feasibility and impossibility of good-case latency, for both BA and BB, in the synchronous sleepy model. Surprisingly to us, we find irrational resilience thresholds emerging: 2-round good-case BB is possible if and only if at all times, at least $\frac{1}{\varphi} \approx 0.618$ fraction of the active parties are correct, where $\varphi = \frac{1+\sqrt{5}}{2} \approx 1.618$ is the golden ratio; 1-round good-case BA is possible if and only if at least $\frac{1}{\sqrt{2}} \approx 0.707$ fraction of the active parties are correct.Open AccessOptimal Good-Case Latency for Sleepy Consensus
In the context of Byzantine consensus problems such as Byzantine broadcast (BB) and Byzantine agreement (BA), the good-case setting aims to study the minimal possible latency of a BB or BA protocol under certain favorable conditions, namely the designated leader being correct (for BB), or all parties having the same input value (for BA). We provide a full characterization of the feasibility and impossibility of good-case latency, for both BA and BB, in the synchronous sleepy model. Surprisingly to us, we find irrational resilience thresholds emerging: 2-round good-case BB is possible if and only if at all times, at least $\frac{1}{\varphi} \approx 0.618$ fraction of the active parties are correct, where $\varphi = \frac{1+\sqrt{5}}{2} \approx 1.618$ is the golden ratio; 1-round good-case BA is possible if and only if at least $\frac{1}{\sqrt{2}} \approx 0.707$ fraction of the active parties are correct. - Open Access
On the Limits of Consensus under Dynamic Availability and Reconfiguration
Proof-of-stake blockchains require consensus protocols that support Dynamic Availability and Reconfiguration (so-called DAR setting), where the former means that the consensus protocol should remain live even if a large number of nodes temporarily crash, and the latter means it should be possible to change the set of operating nodes over time. State-of-the-art protocols for the DAR setting, such as Ethereum, Cardano's Ouroboros, or Snow White, require unrealistic additional assumptions, such as social consensus, or that key evolution is performed even while nodes are not participating. In this paper, we identify the necessary and sufficient adversarial condition under which consensus can be achieved in the DAR setting without additional assumptions. We then introduce a new and realistic additional assumption: honest nodes dispose of their cryptographic keys the moment they express intent to exit from the set of operating nodes. To add reconfiguration to any dynamically available consensus protocol, we provide a bootstrapping gadget that is particularly simple and efficient in the common optimistic case of few reconfigurations and no double-spending attempts.
Open AccessOn the Limits of Consensus under Dynamic Availability and Reconfiguration
Proof-of-stake blockchains require consensus protocols that support Dynamic Availability and Reconfiguration (so-called DAR setting), where the former means that the consensus protocol should remain live even if a large number of nodes temporarily crash, and the latter means it should be possible to change the set of operating nodes over time. State-of-the-art protocols for the DAR setting, such as Ethereum, Cardano's Ouroboros, or Snow White, require unrealistic additional assumptions, such as social consensus, or that key evolution is performed even while nodes are not participating. In this paper, we identify the necessary and sufficient adversarial condition under which consensus can be achieved in the DAR setting without additional assumptions. We then introduce a new and realistic additional assumption: honest nodes dispose of their cryptographic keys the moment they express intent to exit from the set of operating nodes. To add reconfiguration to any dynamically available consensus protocol, we provide a bootstrapping gadget that is particularly simple and efficient in the common optimistic case of few reconfigurations and no double-spending attempts.
- Open Access
- 17 August 2025
- Published by Springer Nature
- p. 390-422
Adaptively Secure Three-Round Threshold Schnorr Signatures from DDH
- 17 August 2025
- Published by Springer Nature
- p. 390-422
Open AccessAdaptively Secure Three-Round Threshold Schnorr Signatures from DDH
- 10 May 2025
- Published by Springer Nature
- p. 1724-1727
Oblivious RAM-Based Secure Processors
- 28 April 2025
- Published by Springer Nature
- p. 304-334
Glacius: Threshold Schnorr Signatures from DDH with Full Adaptive Security
- 28 April 2025
- Published by Springer Nature
- p. 304-334
Glacius: Threshold Schnorr Signatures from DDH with Full Adaptive Security
- 28 April 2025
- Published by Springer Nature
- p. 94-122
Single-Server Client Preprocessing PIR with Tight Space-Time Trade-Off
- 28 April 2025
- Published by Springer Nature
- p. 94-122
Single-Server Client Preprocessing PIR with Tight Space-Time Trade-Off