Ling Ren

IACR Cryptol. ePrint Arch., 2023

On the Amortized Communication Complexity of Byzantine Broadcast.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

On the Security of KZG Commitment for VSS.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

A New Paradigm for Verifiable Secret Sharing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Adaptively Secure BLS Threshold Signatures from DDH and co-CDH.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Threshold Signatures from Inner Product Argument: Succinct, Weighted, and Multi-threshold.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

ParBFT: Faster Asynchronous BFT Consensus with a Parallel Optimistic Path.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Towards Practical Sleepy BFT.

[BibT_eX]

[DOI]

Dahlia Malkhi

Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022

Locality-Preserving Oblivious RAM.

[BibT_eX]

[DOI]

J. Cryptol., 2022

Vectorized Batch Private Information Retrieval.

[BibT_eX]

[DOI]

Muhammad Haris Mughees

IACR Cryptol. ePrint Arch., 2022

Constant Latency in Sleepy Consensus.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Byzantine Consensus under Fully Fluctuating Participation.

[BibT_eX]

[DOI]

Dahlia Malkhi

IACR Cryptol. ePrint Arch., 2022

Practical Settlement Bounds for Longest-Chain Consensus.

[BibT_eX]

[DOI]

Peter Gazi

Alexander Russell

IACR Cryptol. ePrint Arch., 2022

Powers of Tau in Asynchrony.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Balanced Quadratic Reliable Broadcast and Improved Asynchronous Verifiable Information Dispersal.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Practical Asynchronous High-threshold Distributed Key Generation and Distributed Polynomial Sampling.

[BibT_eX]

[DOI]

Lefteris Kokoris-Kogias

IACR Cryptol. ePrint Arch., 2022

Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Asynchronous Verifiable Information Dispersal with Near-Optimal Communication.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Brief Announcement: Asynchronous Verifiable Information Dispersal with Near-Optimal Communication.

[BibT_eX]

[DOI]

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Bitcoin's Latency-Security Analysis Made Simple.

[BibT_eX]

[DOI]

Dongning Guo

Proceedings of the 4th ACM Conference on Advances in Financial Technologies, 2022

2021

Tuxedo: Maximizing Smart Contract Computation in PoW Blockchains.

[BibT_eX]

[DOI]

Proc. ACM Meas. Anal. Comput. Syst., 2021

OnionPIR: Response Efficient Single-Server PIR.

[BibT_eX]

[DOI]

Muhammad Haris Mughees

Hao Chen

IACR Cryptol. ePrint Arch., 2021

Multi-Threshold Byzantine Fault Tolerance.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Practical Settlement Bounds for Proof-of-Work Blockchains.

[BibT_eX]

[DOI]

Peter Gazi

Alexander Russell

IACR Cryptol. ePrint Arch., 2021

Practical Asynchronous Distributed Key Generation.

[BibT_eX]

[DOI]

Lefteris Kokoris-Kogias

IACR Cryptol. ePrint Arch., 2021

Asynchronous Data Dissemination and its Applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

SPURT: Scalable Distributed Randomness Beacon with Transparent Setup.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Brief Note: Fast Authenticated Byzantine Consensus.

[BibT_eX]

[DOI]

CoRR, 2021

Optimal Communication Complexity of Authenticated Byzantine Agreement.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Distributed Computing, 2021

Good-case Latency of Byzantine Broadcast: a Complete Categorization.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Ittai Abraham

Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

Strengthened Fault Tolerance in Byzantine Fault Tolerant Replication.

[BibT_eX]

[DOI]

Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

Close latency-security trade-off for the Nakamoto consensus.

[BibT_eX]

[DOI]

Jing Li

Dongning Guo

Proceedings of the AFT '21: 3rd ACM Conference on Advances in Financial Technologies, Arlington, Virginia, USA, September 26, 2021

2020

A Retrospective on Path ORAM.

[BibT_eX]

[DOI]

Emil Stefanov

Elaine Shi

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2020

Optimal Communication Complexity of Byzantine Agreement, Revisited.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

On the Optimality of Optimistic Responsiveness.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Efficient Cross-Shard Transaction Execution in Sharded Blockchains.

[BibT_eX]

[DOI]

Vinith Krishnan

CoRR, 2020

Optimal Communication Complexity of Byzantine Consensus under Honest Majority.

[BibT_eX]

[DOI]

CoRR, 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

Improved Extension Protocols for Byzantine Broadcast and Agreement.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Sync HotStuff: Simple and Practical Synchronous State Machine Replication.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE Symposium on Security and Privacy, 2020

Bucket Oblivious Sort: An Extremely Simple Oblivious Sort.

[BibT_eX]

[DOI]

Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020

2019

Design and Implementation of the Ascend Secure Processor.

[BibT_eX]

[DOI]

Albert Kwon

IEEE Trans. Dependable Secur. Comput., 2019

Analysis of Nakamoto Consensus.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Onion Ring ORAM: Efficient Constant Bandwidth Oblivious RAM from (Leveled) TFHE.

[BibT_eX]

[DOI]

Hao Chen

Ilaria Chillotti

IACR Cryptol. ePrint Arch., 2019

Sync HotStuff: Synchronous SMR with 2∆ Latency and Optimistic Responsiveness.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Flexible Byzantine Fault Tolerance.

[BibT_eX]

[DOI]

Dahlia Malkhi

Kartik Nayak

Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018

Efficient and egalitarian consensus.

[BibT_eX]

[DOI]

PhD thesis, 2018

Path ORAM: An Extremely Simple Oblivious RAM Protocol.

[BibT_eX]

[DOI]

J. ACM, 2018

Bandwidth-Hard Functions: Reductions and Lower Bounds.

[BibT_eX]

[DOI]

Jeremiah Blocki

Samson Zhou

IACR Cryptol. ePrint Arch., 2018

Dfinity Consensus, Explored.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(n<sup>2)</sup> Communication, and Optimal Resilience.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Breaking the Oblivious-RAM Bandwidth Wall.

[BibT_eX]

[DOI]

Proceedings of the 36th IEEE International Conference on Computer Design, 2018

2017

Trapdoor Computational Fuzzy Extractors and Stateless Cryptographically-Secure Physical Unclonable Functions.

[BibT_eX]

[DOI]

IEEE Trans. Dependable Secur. Comput., 2017

Practical Synchronous Byzantine Consensus.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Bandwidth Hard Functions for ASIC Resistance.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

On Iterative Collision Search for LPN and Subset Sum.

[BibT_eX]

[DOI]

Hanshen Xiao

IACR Cryptol. ePrint Arch., 2017

Oblivious Computation with Data Locality.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

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

[BibT_eX]

[DOI]

Cryptogr., 2017

Brief Announcement: Practical Synchronous Byzantine Consensus.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Distributed Computing, 2017

Asymptotically Tight Bounds for Composing ORAM with PIR.

[BibT_eX]

[DOI]

Ittai Abraham

Kartik Nayak

Benny Pinkas

Proceedings of the Public-Key Cryptography - PKC 2017, 2017

HOP: Hardware makes Obfuscation Practical.

[BibT_eX]

[DOI]

Kartik Nayak

Proceedings of the 24th Annual Network and Distributed System Security Symposium, 2017

A Note on the Security of Equihash.

[BibT_eX]

[DOI]

Leo Alcock

Proceedings of the 9th Cloud Computing Security Workshop, 2017

2016

Proof of Space from Stacked Bipartite Graphs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

An Oblivious RAM with Sub-logarithmic Bandwidth Blowup.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

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

[BibT_eX]

[DOI]

CoRR, 2016

Proof of Space from Stacked Expanders.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM.

[BibT_eX]

[DOI]

Elaine Shi

Daniel Wichs

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

2015

GPU-Accelerated Sparse LU Factorization for Circuit Simulation with Performance Modeling.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2015

Bucket ORAM: Single Online Roundtrip, Constant Bandwidth Oblivious RAM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Onion ORAM: A Constant Bandwidth and Constant Client Storage ORAM (without FHE or SWHE).

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Optimizing Path ORAM for Cloud Storage Applications.

[BibT_eX]

[DOI]

CoRR, 2015

Constants Count: Practical Improvements to Oblivious RAM.

[BibT_eX]

[DOI]

Proceedings of the 24th USENIX Security Symposium, 2015

PrORAM: dynamic prefetcher for oblivious RAM.

[BibT_eX]

[DOI]

Syed Kamran Haider

Albert Kwon

Proceedings of the 42nd Annual International Symposium on Computer Architecture, 2015

A Low-Latency, Low-Area Hardware Oblivious RAM Controller.

[BibT_eX]

[DOI]

Dimitrios N. Serpanos

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.

[BibT_eX]

[DOI]

Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems, 2015

2014

Enhancing Oblivious RAM Performance Using Dynamic Prefetching.

[BibT_eX]

[DOI]

Albert Kwon

IACR Cryptol. ePrint Arch., 2014

Unified Oblivious-RAM: Improving Recursive ORAM with Locality and Pseudorandomness.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Ring ORAM: Closing the Gap Between Small and Large Client Storage Oblivious RAM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Trapdoor Computational Fuzzy Extractors.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

RAW Path ORAM: A Low-Latency, Low-Area Hardware ORAM Controller with Integrity Verification.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Suppressing the Oblivious RAM timing channel while making information leakage and program efficiency trade-offs.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE International Symposium on High Performance Computer Architecture, 2014

2013

Path ORAM: An Extremely Simple Oblivious RAM Protocol.

[BibT_eX]

[DOI]

Emil Stefanov

Elaine Shi

IACR Cryptol. ePrint Arch., 2013

Design Space Exploration and Optimization of Path Oblivious RAM in Secure Processors.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Integrity verification for path Oblivious-RAM.

[BibT_eX]

[DOI]

Proceedings of the IEEE High Performance Extreme Computing Conference, 2013

Generalized external interaction with tamper-resistant hardware with bounded information leakage.

[BibT_eX]

[DOI]