Ling Ren

Orcid: 0000-0003-3437-7570

Affiliations:
  • University of Illinois, Urbana-Champaign, UIUC, USA
  • VMware Research (former)
  • Massachusetts Institute of Technology, MA, USA (former)
  • Tsinghua University, Beijing, China (former)


According to our database1, Ling Ren authored at least 110 papers between 2011 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
On the Limits of Consensus under Dynamic Availability and Reconfiguration.
IACR Cryptol. ePrint Arch., 2025

Lifeline: Optimal Byzantine Agreement Under Minimal Synchrony.
IACR Cryptol. ePrint Arch., 2025

Optimal Good-Case Latency for Sleepy Consensus.
IACR Cryptol. ePrint Arch., 2025

Adaptively Secure Threshold ElGamal Decryption from DDH.
IACR Cryptol. ePrint Arch., 2025

OnionPIRv2: Efficient Single-Server PIR.
IACR Cryptol. ePrint Arch., 2025

Single-server Stateful PIR with Verifiability and Balanced Efficiency.
IACR Cryptol. ePrint Arch., 2025

Randomized Agreement, Verifiable Secret Sharing and Multi-Party Computation in Granular Synchrony.
IACR Cryptol. ePrint Arch., 2025

Verifiable Secret Sharing Simplified.
Proceedings of the IEEE Symposium on Security and Privacy, 2025

Single-Server Client Preprocessing PIR with Tight Space-Time Trade-Off.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Glacius: Threshold Schnorr Signatures from DDH with Full Adaptive Security.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Adaptively Secure Three-Round Threshold Schnorr Signatures from DDH.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
Bandwidth-Hard Functions: Reductions and Lower Bounds.
J. Cryptol., June, 2024

Ipotane: Achieving the Best of All Worlds in Asynchronous BFT.
IACR Cryptol. ePrint Arch., 2024

Granular Synchrony.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

Powers of Tau in Asynchrony.
Proceedings of the 31st Annual Network and Distributed System Security Symposium, 2024

Adaptively Secure BLS Threshold Signatures from DDH and co-CDH.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

Asynchronous Consensus without Trusted Setup or Public-Key Cryptography.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

Oblivious Single Access Machines - A New Model for Oblivious Computation.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

Simple and Practical Amortized Sublinear Private Information Retrieval using Dummy Subsets.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023
Simple and Practical Single-Server Sublinear Private Information Retrieval.
IACR Cryptol. ePrint Arch., 2023

A New Paradigm for Verifiable Secret Sharing.
IACR Cryptol. ePrint Arch., 2023

Practical Asynchronous High-threshold Distributed Key Generation and Distributed Polynomial Sampling.
Proceedings of the 32nd USENIX Security Symposium, 2023

Vectorized Batch Private Information Retrieval.
Proceedings of the 44th IEEE Symposium on Security and Privacy, 2023

On the Amortized Communication Complexity of Byzantine Broadcast.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Practical Settlement Bounds for Longest-Chain Consensus.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

On the Security of KZG Commitment for VSS.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

Towards Practical Sleepy BFT.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

Threshold Signatures from Inner Product Argument: Succinct, Weighted, and Multi-threshold.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

ParBFT: Faster Asynchronous BFT Consensus with a Parallel Optimistic Path.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022
Byzantine Consensus under Fully Fluctuating Participation.
IACR Cryptol. ePrint Arch., 2022

Balanced Quadratic Reliable Broadcast and Improved Asynchronous Verifiable Information Dispersal.
IACR Cryptol. ePrint Arch., 2022

Asynchronous Verifiable Information Dispersal with Near-Optimal Communication.
IACR Cryptol. ePrint Arch., 2022

Practical Asynchronous Distributed Key Generation.
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022

Spurt: Scalable Distributed Randomness Beacon with Transparent Setup.
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022

Tuxedo: Maximizing Smart Contract Computation in PoW Blockchains.
Proceedings of the SIGMETRICS/PERFORMANCE '22: ACM SIGMETRICS/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, Mumbai, India, June 6, 2022

Brief Announcement: Asynchronous Verifiable Information Dispersal with Near-Optimal Communication.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Constant Latency in Sleepy Consensus.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

Practical Settlement Bounds for Proof-of-Work Blockchains.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

Bitcoin's Latency-Security Analysis Made Simple.
Proceedings of the 4th ACM Conference on Advances in Financial Technologies, 2022

2021
Brief Note: Fast Authenticated Byzantine Consensus.
CoRR, 2021

Optimal Communication Complexity of Authenticated Byzantine Agreement.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

Good-case Latency of Byzantine Broadcast: a Complete Categorization.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Good-Case and Bad-Case Latency of Unauthenticated Byzantine Broadcast: A Complete Categorization.
Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

Strengthened Fault Tolerance in Byzantine Fault Tolerant Replication.
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

OnionPIR: Response Efficient Single-Server PIR.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

Multi-Threshold Byzantine Fault Tolerance.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

Asynchronous Data Dissemination and its Applications.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

Close latency-security trade-off for the Nakamoto consensus.
Proceedings of the 3rd ACM Conference on Advances in Financial Technologies, 2021

2020
A Retrospective on Path ORAM.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2020

Optimal Communication Complexity of Byzantine Agreement, Revisited.
IACR Cryptol. ePrint Arch., 2020

Efficient Cross-Shard Transaction Execution in Sharded Blockchains.
CoRR, 2020

Optimal Communication Complexity of Byzantine Consensus under Honest Majority.
CoRR, 2020

Better Late than Never; Scaling Computation in Blockchains by Delaying Execution.
CoRR, 2020

Optimal Good-case Latency for Byzantine Broadcast and State Machine Replication.
CoRR, 2020

Improved Extension Protocols for Byzantine Broadcast and Agreement.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

Sync HotStuff: Simple and Practical Synchronous State Machine Replication.
Proceedings of the 2020 IEEE Symposium on Security and Privacy, 2020

Bucket Oblivious Sort: An Extremely Simple Oblivious Sort.
Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020

On the Optimality of Optimistic Responsiveness.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019
Design and Implementation of the Ascend Secure Processor.
IEEE Trans. Dependable Secur. Comput., 2019

Analysis of Nakamoto Consensus.
IACR Cryptol. ePrint Arch., 2019

Sync HotStuff: Synchronous SMR with 2∆ Latency and Optimistic Responsiveness.
IACR Cryptol. ePrint Arch., 2019

Communication Complexity of Byzantine Agreement, Revisited.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(n<sup>2</sup>) Communication, and Optimal Resilience.
Proceedings of the Financial Cryptography and Data Security, 2019

Locality-Preserving Oblivious RAM.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Flexible Byzantine Fault Tolerance.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

Onion Ring ORAM: Efficient Constant Bandwidth Oblivious RAM from (Leveled) TFHE.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018
Efficient and egalitarian consensus.
PhD thesis, 2018

Path ORAM: An Extremely Simple Oblivious RAM Protocol.
J. ACM, 2018

Dfinity Consensus, Explored.
IACR Cryptol. ePrint Arch., 2018

Breaking the Oblivious-RAM Bandwidth Wall.
Proceedings of the 36th IEEE International Conference on Computer Design, 2018

Bandwidth-Hard Functions: Reductions and Lower Bounds.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
Trapdoor Computational Fuzzy Extractors and Stateless Cryptographically-Secure Physical Unclonable Functions.
IEEE Trans. Dependable Secur. Comput., 2017

Practical Synchronous Byzantine Consensus.
IACR Cryptol. ePrint Arch., 2017

Oblivious Computation with Data Locality.
IACR Cryptol. ePrint Arch., 2017

FPGA Implementation of a Cryptographically-Secure PUF Based on Learning Parity with Noise.
Cryptogr., 2017

Brief Announcement: Practical Synchronous Byzantine Consensus.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

On Iterative Collision Search for LPN and Subset Sum.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Bandwidth Hard Functions for ASIC Resistance.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Asymptotically Tight Bounds for Composing ORAM with PIR.
Proceedings of the Public-Key Cryptography - PKC 2017, 2017

Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

HOP: Hardware makes Obfuscation Practical.
Proceedings of the 24th Annual Network and Distributed System Security Symposium, 2017

A Note on the Security of Equihash.
Proceedings of the 9th Cloud Computing Security Workshop, 2017

2016
Proof of Space from Stacked Bipartite Graphs.
IACR Cryptol. ePrint Arch., 2016

An Oblivious RAM with Sub-logarithmic Bandwidth Blowup.
IACR Cryptol. ePrint Arch., 2016

Solidus: An Incentive-compatible Cryptocurrency Based on Permissionless Byzantine Consensus.
CoRR, 2016

Proof of Space from Stacked Expanders.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

2015
GPU-Accelerated Sparse LU Factorization for Circuit Simulation with Performance Modeling.
IEEE Trans. Parallel Distributed Syst., 2015

Bucket ORAM: Single Online Roundtrip, Constant Bandwidth Oblivious RAM.
IACR Cryptol. ePrint Arch., 2015

Onion ORAM: A Constant Bandwidth and Constant Client Storage ORAM (without FHE or SWHE).
IACR Cryptol. ePrint Arch., 2015

Optimizing Path ORAM for Cloud Storage Applications.
CoRR, 2015

Constants Count: Practical Improvements to Oblivious RAM.
Proceedings of the 24th USENIX Security Symposium, 2015

PrORAM: dynamic prefetcher for oblivious RAM.
Proceedings of the 42nd Annual International Symposium on Computer Architecture, 2015

A Low-Latency, Low-Area Hardware Oblivious RAM Controller.
Proceedings of the 23rd IEEE Annual International Symposium on Field-Programmable Custom Computing Machines, 2015

Freecursive ORAM: [Nearly] Free Recursion and Integrity Verification for Position-based Oblivious RAM.
Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems, 2015

2014
Enhancing Oblivious RAM Performance Using Dynamic Prefetching.
IACR Cryptol. ePrint Arch., 2014

Unified Oblivious-RAM: Improving Recursive ORAM with Locality and Pseudorandomness.
IACR Cryptol. ePrint Arch., 2014

Ring ORAM: Closing the Gap Between Small and Large Client Storage Oblivious RAM.
IACR Cryptol. ePrint Arch., 2014

Trapdoor Computational Fuzzy Extractors.
IACR Cryptol. ePrint Arch., 2014

RAW Path ORAM: A Low-Latency, Low-Area Hardware ORAM Controller with Integrity Verification.
IACR Cryptol. ePrint Arch., 2014

Suppressing the Oblivious RAM timing channel while making information leakage and program efficiency trade-offs.
Proceedings of the 20th IEEE International Symposium on High Performance Computer Architecture, 2014

2013
Design space exploration and optimization of path oblivious RAM in secure processors.
Proceedings of the 40th Annual International Symposium on Computer Architecture, 2013

Integrity verification for path Oblivious-RAM.
Proceedings of the IEEE High Performance Extreme Computing Conference, 2013

Generalized external interaction with tamper-resistant hardware with bounded information leakage.
Proceedings of the CCSW'13, 2013

Path ORAM: an extremely simple oblivious RAM protocol.
Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

2012
Probabilistic Brain Fiber Tractography on GPUs.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012

Sparse LU factorization for parallel circuit simulation on GPU.
Proceedings of the 49th Annual Design Automation Conference 2012, 2012

2011
A heterogeneous accelerator platform for multi-subject voxel-based brain network analysis.
Proceedings of the 2011 IEEE/ACM International Conference on Computer-Aided Design, 2011


  Loading...