A heterogeneous accelerator platform for multi-subject voxel-based brain network analysis. - Yu Wang 002; Mo Xu; Ling Ren 001; Xiaorui Zhang; Di Wu 013; Yong He 002; Ningyi Xu; Huazhong Yang (ICCAD, 2011)

Sparse LU factorization for parallel circuit simulation on GPU. - Ling Ren 001; Xiaoming Chen 003; Yu Wang 002; Chenxi Zhang; Huazhong Yang (DAC, 2012)

Probabilistic Brain Fiber Tractography on GPUs. - Mo Xu; Xiaorui Zhang; Yu Wang 002; Ling Ren 001; Ziyu Wen; Yi Xu; Gaolang Gong; Ningyi Xu; Huazhong Yang (IPDPS Workshops, 2012)

Generalized external interaction with tamper-resistant hardware with bounded information leakage. - Xiangyao Yu; Christopher W. Fletcher; Ling Ren 001; Marten van Dijk; Srinivas Devadas (CCSW, 2013)

Integrity verification for path Oblivious-RAM. - Ling Ren 001; Christopher W. Fletcher; Xiangyao Yu; Marten van Dijk; Srinivas Devadas (HPEC, 2013)

Design Space Exploration and Optimization of Path Oblivious RAM in Secure Processors. - Ling Ren 001; Xiangyao Yu; Christopher W. Fletcher; Marten van Dijk; Srinivas Devadas (IACR Cryptol. ePrint Arch., 2013)

Path ORAM: An Extremely Simple Oblivious RAM Protocol. - Emil Stefanov; Marten van Dijk; Elaine Shi; Christopher W. Fletcher; Ling Ren 001; Xiangyao Yu; Srinivas Devadas (IACR Cryptol. ePrint Arch., 2013)

Suppressing the Oblivious RAM timing channel while making information leakage and program efficiency trade-offs. - Christopher W. Fletcher; Ling Ren 001; Xiangyao Yu; Marten van Dijk; Omer Khan; Srinivas Devadas (HPCA, 2014)

RAW Path ORAM: A Low-Latency, Low-Area Hardware ORAM Controller with Integrity Verification. - Christopher W. Fletcher; Ling Ren 001; Albert Kwon; Marten van Dijk; Emil Stefanov; Srinivas Devadas (IACR Cryptol. ePrint Arch., 2014)

Trapdoor Computational Fuzzy Extractors. - Charles Herder; Ling Ren 001; Marten van Dijk; Meng-Day (Mandel) Yu; Srinivas Devadas (IACR Cryptol. ePrint Arch., 2014)

Ring ORAM: Closing the Gap Between Small and Large Client Storage Oblivious RAM. - Ling Ren 001; Christopher W. Fletcher; Albert Kwon; Emil Stefanov; Elaine Shi; Marten van Dijk; Srinivas Devadas (IACR Cryptol. ePrint Arch., 2014)

Unified Oblivious-RAM: Improving Recursive ORAM with Locality and Pseudorandomness. - Ling Ren 001; Christopher W. Fletcher; Xiangyao Yu; Albert Kwon; Marten van Dijk; Srinivas Devadas (IACR Cryptol. ePrint Arch., 2014)

Enhancing Oblivious RAM Performance Using Dynamic Prefetching. - Xiangyao Yu; Ling Ren 001; Christopher W. Fletcher; Albert Kwon; Marten van Dijk; Srinivas Devadas (IACR Cryptol. ePrint Arch., 2014)

Freecursive ORAM: [Nearly] Free Recursion and Integrity Verification for Position-based Oblivious RAM. - Christopher W. Fletcher; Ling Ren 001; Albert Kwon; Marten van Dijk; Srinivas Devadas (ASPLOS, 2015)

A Low-Latency, Low-Area Hardware Oblivious RAM Controller. - Christopher W. Fletcher; Ling Ren 001; Albert Kwon; Marten van Dijk; Emil Stefanov; Dimitrios N. Serpanos; Srinivas Devadas (FCCM, 2015)

PrORAM: dynamic prefetcher for oblivious RAM. - Xiangyao Yu; Syed Kamran Haider; Ling Ren 001; Christopher W. Fletcher; Albert Kwon; Marten van Dijk; Srinivas Devadas (ISCA, 2015)

Constants Count: Practical Improvements to Oblivious RAM. - Ling Ren 001; Christopher W. Fletcher; Albert Kwon; Emil Stefanov; Elaine Shi; Marten van Dijk; Srinivas Devadas (USENIX Security Symposium, 2015)

Optimizing Path ORAM for Cloud Storage Applications. - Nathan Wolfe; Ethan Zou; Ling Ren 001; Xiangyao Yu (CoRR, 2015)

Onion ORAM: A Constant Bandwidth and Constant Client Storage ORAM (without FHE or SWHE). - Srinivas Devadas; Marten van Dijk; Christopher W. Fletcher; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2015)

Bucket ORAM: Single Online Roundtrip, Constant Bandwidth Oblivious RAM. - Christopher W. Fletcher; Muhammad Naveed; Ling Ren 001; Elaine Shi; Emil Stefanov (IACR Cryptol. ePrint Arch., 2015)

GPU-Accelerated Sparse LU Factorization for Circuit Simulation with Performance Modeling. - Xiaoming Chen 003; Ling Ren 001; Yu Wang 002; Huazhong Yang (IEEE Trans. Parallel Distributed Syst., 2015)

Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM. - Srinivas Devadas; Marten van Dijk; Christopher W. Fletcher; Ling Ren 001; Elaine Shi; Daniel Wichs (TCC (A2), 2016)

Proof of Space from Stacked Expanders. - Ling Ren 001; Srinivas Devadas (TCC (B1), 2016)

Solidus: An Incentive-compatible Cryptocurrency Based on Permissionless Byzantine Consensus. - Ittai Abraham; Dahlia Malkhi; Kartik Nayak; Ling Ren 001; Alexander Spiegelman (CoRR, 2016)

An Oblivious RAM with Sub-logarithmic Bandwidth Blowup. - Kartik Nayak; Ling Ren 001; Ittai Abraham; Benny Pinkas (IACR Cryptol. ePrint Arch., 2016)

Proof of Space from Stacked Bipartite Graphs. - Ling Ren 001; Srinivas Devadas (IACR Cryptol. ePrint Arch., 2016)

A Note on the Security of Equihash. - Leo Alcock; Ling Ren 001 (CCSW, 2017)

HOP: Hardware makes Obfuscation Practical. - Kartik Nayak; Christopher W. Fletcher; Ling Ren 001; Nishanth Chandran; Satya V. Lokam; Elaine Shi; Vipul Goyal (NDSS, 2017)

Asymptotically Tight Bounds for Composing ORAM with PIR. - Ittai Abraham; Christopher W. Fletcher; Kartik Nayak; Benny Pinkas; Ling Ren 001 (Public Key Cryptography (1), 2017)

Brief Announcement: Practical Synchronous Byzantine Consensus. - Ittai Abraham; Srinivas Devadas; Kartik Nayak; Ling Ren 001 (DISC, 2017)

FPGA Implementation of a Cryptographically-Secure PUF Based on Learning Parity with Noise. - Chenglu Jin; Charles Herder; Ling Ren 001; Phuong Ha Nguyen; Benjamin Fuller 001; Srinivas Devadas; Marten van Dijk (Cryptogr., 2017)

Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus. - Ittai Abraham; Dahlia Malkhi; Kartik Nayak; Ling Ren 001; Alexander Spiegelman (IACR Cryptol. ePrint Arch., 2017)

Oblivious Computation with Data Locality. - Gilad Asharov; T.-H. Hubert Chan; Kartik Nayak; Rafael Pass; Ling Ren 001; Elaine Shi (IACR Cryptol. ePrint Arch., 2017)

On Iterative Collision Search for LPN and Subset Sum. - Srinivas Devadas; Ling Ren 001; Hanshen Xiao (IACR Cryptol. ePrint Arch., 2017)

Bandwidth Hard Functions for ASIC Resistance. - Ling Ren 001; Srinivas Devadas (IACR Cryptol. ePrint Arch., 2017)

Practical Synchronous Byzantine Consensus. - Ling Ren 001; Kartik Nayak; Ittai Abraham; Srinivas Devadas (IACR Cryptol. ePrint Arch., 2017)

Trapdoor Computational Fuzzy Extractors and Stateless Cryptographically-Secure Physical Unclonable Functions. - Charles Herder; Ling Ren 001; Marten van Dijk; Meng-Day (Mandel) Yu; Srinivas Devadas (IEEE Trans. Dependable Secur. Comput., 2017)

Breaking the Oblivious-RAM Bandwidth Wall. - Hamza Omar; Syed Kamran Haider; Ling Ren 001; Marten van Dijk; Omer Khan (ICCD, 2018)

Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(n2) Communication, and Optimal Resilience. - Ittai Abraham; Srinivas Devadas; Danny Dolev; Kartik Nayak; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2018)

Dfinity Consensus, Explored. - Ittai Abraham; Dahlia Malkhi; Kartik Nayak; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2018)

Bandwidth-Hard Functions: Reductions and Lower Bounds. - Jeremiah Blocki; Ling Ren 001; Samson Zhou (IACR Cryptol. ePrint Arch., 2018)

Path ORAM: An Extremely Simple Oblivious RAM Protocol. - Emil Stefanov; Marten van Dijk; Elaine Shi; T.-H. Hubert Chan; Christopher W. Fletcher; Ling Ren 001; Xiangyao Yu; Srinivas Devadas (J. ACM, 2018)

Efficient and egalitarian consensus. - Ling Ren 001 (2018)

Flexible Byzantine Fault Tolerance. - Dahlia Malkhi; Kartik Nayak; Ling Ren 001 (CCS, 2019)

Sync HotStuff: Synchronous SMR with 2∆ Latency and Optimistic Responsiveness. - Ittai Abraham; Dahlia Malkhi; Kartik Nayak; Ling Ren 001; Maofan Yin (IACR Cryptol. ePrint Arch., 2019)

Onion Ring ORAM: Efficient Constant Bandwidth Oblivious RAM from (Leveled) TFHE. - Hao Chen 030; Ilaria Chillotti; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2019)

Analysis of Nakamoto Consensus. - Ling Ren 001 (IACR Cryptol. ePrint Arch., 2019)

Design and Implementation of the Ascend Secure Processor. - Ling Ren 001; Christopher W. Fletcher; Albert Kwon; Marten van Dijk; Srinivas Devadas (IEEE Trans. Dependable Secur. Comput., 2019)

Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. - Gilad Asharov; T.-H. Hubert Chan; Kartik Nayak; Rafael Pass; Ling Ren 001; Elaine Shi (SOSA, 2020)

Sync HotStuff: Simple and Practical Synchronous State Machine Replication. - Ittai Abraham; Dahlia Malkhi; Kartik Nayak; Ling Ren 001; Maofan Yin (SP, 2020)

Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency. - Ittai Abraham; Kartik Nayak; Ling Ren 001; Zhuolun Xiang (DISC, 2020)

Improved Extension Protocols for Byzantine Broadcast and Agreement. - Kartik Nayak; Ling Ren 001; Elaine Shi; Nitin H. Vaidya; Zhuolun Xiang (DISC, 2020)

Optimal Good-case Latency for Byzantine Broadcast and State Machine Replication. - Ittai Abraham; Kartik Nayak; Ling Ren 001; Zhuolun Xiang (CoRR, 2020)

Better Late than Never; Scaling Computation in Blockchains by Delaying Execution. - Sourav Das 001; Nitin Awathare; Ling Ren 001; Vinay Joseph Ribeiro; Umesh Bellur (CoRR, 2020)

Optimal Communication Complexity of Byzantine Consensus under Honest Majority. - Atsuki Momose; Ling Ren 001 (CoRR, 2020)

Efficient Cross-Shard Transaction Execution in Sharded Blockchains. - Sourav Das 001; Vinith Krishnan; Ling Ren 001 (CoRR, 2020)

On the Optimality of Optimistic Responsiveness. - Ittai Abraham; Kartik Nayak; Ling Ren 001; Nibesh Shrestha (IACR Cryptol. ePrint Arch., 2020)

Optimal Communication Complexity of Byzantine Agreement, Revisited. - Atsuki Momose; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2020)

A Retrospective on Path ORAM. - Emil Stefanov; Marten van Dijk; Elaine Shi; Christopher W. Fletcher; Ling Ren 001; Xiangyao Yu; Srinivas Devadas (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2020)

Close latency-security trade-off for the Nakamoto consensus. - Jing Li; Dongning Guo; Ling Ren 001 (AFT, 2021)

Strengthened Fault Tolerance in Byzantine Fault Tolerant Replication. - Zhuolun Xiang; Dahlia Malkhi; Kartik Nayak; Ling Ren 001 (ICDCS, 2021)

Good-Case and Bad-Case Latency of Unauthenticated Byzantine Broadcast: A Complete Categorization. - Ittai Abraham; Ling Ren 001; Zhuolun Xiang (OPODIS, 2021)

Good-case Latency of Byzantine Broadcast: a Complete Categorization. - Ittai Abraham; Kartik Nayak; Ling Ren 001; Zhuolun Xiang (PODC, 2021)

Optimal Communication Complexity of Authenticated Byzantine Agreement. - Atsuki Momose; Ling Ren 001 (DISC, 2021)

Brief Note: Fast Authenticated Byzantine Consensus. - Ittai Abraham; Kartik Nayak; Ling Ren 001; Zhuolun Xiang (CoRR, 2021)

SPURT: Scalable Distributed Randomness Beacon with Transparent Setup. - Sourav Das 001; Vinith Krishnan; Irene Miriam Isaac; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2021)

Asynchronous Data Dissemination and its Applications. - Sourav Das 001; Zhuolun Xiang; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2021)

Practical Asynchronous Distributed Key Generation. - Sourav Das 001; Tom Yurek; Zhuolun Xiang; Andrew Miller 001; Lefteris Kokoris-Kogias; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2021)

Practical Settlement Bounds for Proof-of-Work Blockchains. - Peter Gazi; Ling Ren 001; Alexander Russell (IACR Cryptol. ePrint Arch., 2021)

Multi-Threshold Byzantine Fault Tolerance. - Atsuki Momose; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2021)

OnionPIR: Response Efficient Single-Server PIR. - Muhammad Haris Mughees; Hao Chen 030; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2021)

Tuxedo: Maximizing Smart Contract Computation in PoW Blockchains. - Sourav Das 001; Nitin Awathare; Ling Ren 001; Vinay J. Ribeiro; Umesh Bellur (Proc. ACM Meas. Anal. Comput. Syst., 2021)

Bitcoin's Latency-Security Analysis Made Simple. - Dongning Guo; Ling Ren 001 (AFT, 2022)

Brief Announcement: Asynchronous Verifiable Information Dispersal with Near-Optimal Communication. - Nicolas Alhaddad; Sourav Das 001; Sisi Duan; Ling Ren 001; Mayank Varia; Zhuolun Xiang; Haibin Zhang (PODC, 2022)

Asynchronous Verifiable Information Dispersal with Near-Optimal Communication. - Nicolas Alhaddad; Sourav Das 001; Sisi Duan; Ling Ren 001; Mayank Varia; Zhuolun Xiang; Haibin Zhang (IACR Cryptol. ePrint Arch., 2022)

Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation. - Nicolas Alhaddad; Sourav Das 001; Sisi Duan; Ling Ren 001; Mayank Varia; Zhuolun Xiang; Haibin Zhang (IACR Cryptol. ePrint Arch., 2022)

Practical Asynchronous High-threshold Distributed Key Generation and Distributed Polynomial Sampling. - Sourav Das 001; Zhuolun Xiang; Lefteris Kokoris-Kogias; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2022)

Balanced Quadratic Reliable Broadcast and Improved Asynchronous Verifiable Information Dispersal. - Sourav Das 001; Zhuolun Xiang; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2022)

Powers of Tau in Asynchrony. - Sourav Das 001; Zhuolun Xiang; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2022)

Practical Settlement Bounds for Longest-Chain Consensus. - Peter Gazi; Ling Ren 001; Alexander Russell (IACR Cryptol. ePrint Arch., 2022)

Byzantine Consensus under Fully Fluctuating Participation. - Dahlia Malkhi; Atsuki Momose; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2022)

Constant Latency in Sleepy Consensus. - Atsuki Momose; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2022)

Vectorized Batch Private Information Retrieval. - Muhammad Haris Mughees; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2022)

Locality-Preserving Oblivious RAM. - Gilad Asharov; T.-H. Hubert Chan; Kartik Nayak; Rafael Pass; Ling Ren 001; Elaine Shi (J. Cryptol., 2022)

Towards Practical Sleepy BFT. - Dahlia Malkhi; Atsuki Momose; Ling Ren 001 (CCS, 2023)

ParBFT: Faster Asynchronous BFT Consensus with a Parallel Optimistic Path. - Xiaohai Dai; Bolin Zhang; Hai Jin 001; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2023)

Threshold Signatures from Inner Product Argument: Succinct, Weighted, and Multi-threshold. - Sourav Das 001; Philippe Camacho; Zhuolun Xiang; Javier Nieto; Benedikt Bünz; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2023)

Adaptively Secure BLS Threshold Signatures from DDH and co-CDH. - Sourav Das 001; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2023)

A New Paradigm for Verifiable Secret Sharing. - Sourav Das 001; Zhuolun Xiang; Alin Tomescu; Alexander Spiegelman; Benny Pinkas; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2023)

On the Security of KZG Commitment for VSS. - Atsuki Momose; Sourav Das 001; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2023)

On the Amortized Communication Complexity of Byzantine Broadcast. - Atsuki Momose; Ling Ren 001; Elaine Shi; Jun Wan 008; Zhuolun Xiang (IACR Cryptol. ePrint Arch., 2023)

Simple and Practical Single-Server Sublinear Private Information Retrieval. - Muhammad Haris Mughees; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2023)

Communication complexity of byzantine agreement, revisited. - Ittai Abraham; T.-H. Hubert Chan; Danny Dolev; Kartik Nayak; Rafael Pass; Ling Ren 001; Elaine Shi (Distributed Comput., 2023)

Simple and Practical Amortized Sublinear Private Information Retrieval using Dummy Subsets. - Ling Ren 001; Muhammad Haris Mughees; I Sun (CCS, 2024)

Granular Synchrony. - Neil Giridharan; Ittai Abraham; Natacha Crooks; Kartik Nayak; Ling Ren 001 (DISC, 2024)

Oblivious Single Access Machines: A New Model for Oblivious Computation. - Ananya Appan; David Heath; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2024)

Glacius: Threshold Schnorr Signatures from DDH with Full Adaptive Security. - Renas Bacho; Sourav Das 001; Julian Loss; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2024)

Ipotane: Achieving the Best of All Worlds in Asynchronous BFT. - Xiaohai Dai; Chaozheng Ding; Hai Jin 001; Julian Loss; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2024)

Asynchronous Consensus without Trusted Setup or Public-Key Cryptography. - Sourav Das 001; Sisi Duan; Shengqi Liu; Atsuki Momose; Ling Ren 001; Victor Shoup (IACR Cryptol. ePrint Arch., 2024)

Single-Server Client Preprocessing PIR with Tight Space-Time Trade-off. - Zhikun Wang; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2024)

Bandwidth-Hard Functions: Reductions and Lower Bounds. - Jeremiah Blocki; Peiyuan Liu; Ling Ren 001; Samson Zhou (J. Cryptol., 2024)

Verifiable Secret Sharing Simplified. - Sourav Das 001; Zhuolun Xiang; Alin Tomescu; Alexander Spiegelman; Benny Pinkas; Ling Ren 001 (SP, 2025)

Randomized Agreement, Verifiable Secret Sharing and Multi-Party Computation in Granular Synchrony. - Ananya Appan; David Heath; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2025)

Single-server Stateful PIR with Verifiability and Balanced Efficiency. - Pranav Shriram Arunachalaramanan; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2025)

Adaptively Secure Three-Round Threshold Schnorr Signatures from DDH. - Renas Bacho; Sourav Das 001; Julian Loss; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2025)

OnionPIRv2: Efficient Single-Server PIR. - Yue Chen; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2025)

Adaptively Secure Threshold ElGamal Decryption from DDH. - Sourav Das 001; Ling Ren 001; Ziling Yang (IACR Cryptol. ePrint Arch., 2025)

Lifeline: Optimal Byzantine Agreement Under Minimal Synchrony. - Yuval Efron; Ling Ren 001 (IACR Cryptol. ePrint Arch., 2025)