Cover Image

MVP-ORAM: a Wait-free Concurrent ORAM for Confidential BFT Storage

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Vassantlal, Robin, Heydari, Hasan, Ferreira, Bernardo, Bessani, Alysson
Format:	Preprint
Published:	2025
Subjects:	Cryptography and Security Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Knowledge Connectivity Requirements for Solving BFT Consensus with Unknown Participants and Fault Threshold (Extended Version)
by: Heydari, Hasan, et al.
Published: (2024)

Bankrupting DoS Attackers
by: Chakraborty, Trisha, et al.
Published: (2022)

Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why is a Lot of Randomness Needed?
by: Hajiaghayi, Mohammad T., et al.
Published: (2024)

2G2T: Constant-Size, Statistically Sound MSM Outsourcing
by: Khabbazian, Majid
Published: (2026)

Scalable contribution bounding to achieve privacy
by: Cohen-Addad, Vincent, et al.
Published: (2025)

Constant Degree Networks for Almost-Everywhere Reliable Transmission
by: Bafna, Mitali, et al.
Published: (2024)

OciorCOOL: Faster Byzantine Agreement and Reliable Broadcast
by: Chen, Jinyuan
Published: (2024)

Concurrent aggregate queries
by: Sela, Gal, et al.
Published: (2024)

Constitutional Consensus for Democratic Governance
by: Keidar, Idit, et al.
Published: (2025)

GPU Acceleration of Sparse Fully Homomorphic Encrypted DNNs
by: D'Agata, Lara, et al.
Published: (2026)

Access Control for Information-Theoretically Secure Key-Document Stores
by: Li, Yin, et al.
Published: (2025)

Optimal Offline ORAM with Perfect Security via Simple Oblivious Priority Queues
by: Thießen, Thore, et al.
Published: (2024)

Memory Bounds for Concurrent Bounded Queues
by: Aksenov, Vitaly, et al.
Published: (2021)

History-Independent Concurrent Hash Tables
by: Attiya, Hagit, et al.
Published: (2025)

Fast Concurrent Primitives Despite Contention
by: Bender, Michael A., et al.
Published: (2026)

New Concurrent Order Maintenance Data Structure
by: Guo, Bin, et al.
Published: (2022)

Undetectable Selfish Mining
by: Bahrani, Maryam, et al.
Published: (2023)

PureLottery: Fair and Bias-Resistant Leader Election with a Novel Single-Elimination Tournament Algorithm
by: Ballweg, Jonas
Published: (2024)

QScale: Probabilistic Chained Consensus for Moderate-Scale Systems
by: Heydari, Hasan, et al.
Published: (2025)

WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
by: McCoy, Hunter, et al.
Published: (2025)

Concurrent Deterministic Skiplist and Other Data Structures
by: Sasidharan, Aparna
Published: (2023)

Near-optimal population protocols on bounded-degree trees
by: Rybicki, Joel, et al.
Published: (2026)

OrbitBFT: Enabling Scalable and Robust BFT Consensus in LEO Constellations
by: Sun, Tianyi, et al.
Published: (2026)

No Cords Attached: Coordination-Free Concurrent Lock-Free Queues
by: Motiwala, Yusuf
Published: (2025)

Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
by: Williams, Marvin, et al.
Published: (2025)

The Blocklace: A Byzantine-repelling and Universal Conflict-free Replicated Data Type
by: Almeida, Paulo Sérgio, et al.
Published: (2024)

Honeybee: Byzantine Tolerant Decentralized Peer Sampling with Verifiable Random Walks
by: Zhang, Yunqi, et al.
Published: (2024)

Banyan: Fast Rotating Leader BFT
by: Vonlanthen, Yann, et al.
Published: (2023)

Asynchronous BFT Consensus Made Wireless
by: Liu, Shuo, et al.
Published: (2025)

Kudzu: Fast and Simple High-Throughput BFT
by: Shoup, Victor, et al.
Published: (2025)

Beluga: Block Synchronization for BFT Consensus Protocols
by: Kichidis, Tasos, et al.
Published: (2025)

Unraveling Responsiveness of Chained BFT Consensus with Network Delay
by: Tang, Yining, et al.
Published: (2025)

JUMBO: Fully Asynchronous BFT Consensus Made Truly Scalable
by: Cheng, Hao, et al.
Published: (2024)

Dumbo-NG: Fast Asynchronous BFT Consensus with Throughput-Oblivious Latency
by: Gao, Yingzi, et al.
Published: (2022)

Leader Rotation Is Not Enough: Scrutinizing Leadership Democracy of Chained BFT Consensus
by: Tang, Yining, et al.
Published: (2025)

Mahi-Mahi: Low-Latency Asynchronous BFT DAG-Based Consensus
by: Jovanovic, Philipp, et al.
Published: (2024)

Efficient Dynamic MaxFlow Computation on GPUs
by: Kannappan, Shruthi, et al.
Published: (2025)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
by: Blin, Lelia, et al.
Published: (2026)

Towards Optimal Distributed Edge Coloring with Fewer Colors
by: Jakob, Manuel, et al.
Published: (2025)

Perfect Matching with Few Link Activations
by: Mirault, Hugo, et al.
Published: (2025)