Cover Image

Single Round-trip Hierarchical ORAM via Succinct Indices

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Holland, William, Ohrimenko, Olga, Wirth, Anthony
Format:	Preprint
Published:	2022
Subjects:	Cryptography and Security
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Getting a-Round Guarantees: Floating-Point Attacks on Certified Robustness
by: Jin, Jiankai, et al.
Published: (2022)

Cloak: Heuristic ORAM Optimization Through Fixed Temporal Distribution
by: Arpaci, Onur Eren, et al.
Published: (2026)

Information Leakage from Data Updates in Machine Learning Models
by: Hui, Tian, et al.
Published: (2023)

Denoising the US Census: Succinct Block Hierarchical Regression
by: Ghazi, Badih, et al.
Published: (2026)

MVP-ORAM: a Wait-free Concurrent ORAM for Confidential BFT Storage
by: Vassantlal, Robin, et al.
Published: (2025)

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

Are We There Yet? Timing and Floating-Point Attacks on Differential Privacy Systems
by: Jin, Jiankai, et al.
Published: (2021)

Elephants Do Not Forget: Differential Privacy with State Continuity for Privacy Budget
by: Jin, Jiankai, et al.
Published: (2024)

RS-Del: Edit Distance Robustness Certificates for Sequence Classifiers via Randomized Deletion
by: Huang, Zhuoqun, et al.
Published: (2023)

FileDES: A Secure Scalable and Succinct Decentralized Encrypted Storage Network
by: Xu, Minghui, et al.
Published: (2024)

Quantum Rewinding for IOP-Based Succinct Arguments
by: Chiesa, Alessandro, et al.
Published: (2024)

Succinct arguments for QMA from standard assumptions via compiled nonlocal games
by: Metger, Tony, et al.
Published: (2024)

Ciphertext-Policy ABE for $\mathsf{NC}^1$ Circuits with Constant-Size Ciphertexts from Succinct LWE
by: Liu, Jiaqi, et al.
Published: (2026)

CERT-ED: Certifiably Robust Text Classification for Edit Distance
by: Huang, Zhuoqun, et al.
Published: (2024)

AdaptDel: Adaptable Deletion Rate Randomized Smoothing for Certified Robustness
by: Huang, Zhuoqun, et al.
Published: (2025)

Succinct Oblivious Tensor Evaluation and Applications: Adaptively-Secure Laconic Function Evaluation and Trapdoor Hashing for All Circuits
by: Abram, Damiano, et al.
Published: (2025)

Single-Round Proofs of Quantumness from Knowledge Assumptions
by: Arabadjieva, Petia, et al.
Published: (2024)

Scalable Differentially Private Sketches under Continual Observation
by: Holland, Rayne
Published: (2025)

An Iconic Heavy Hitter Algorithm Made Private
by: Holland, Rayne
Published: (2025)

Compiling Any $\mathsf{MIP}^{*}$ into a (Succinct) Classical Interactive Argument
by: Huang, Andrew, et al.
Published: (2025)

Model Poisoning Attacks to Federated Learning via Multi-Round Consistency
by: Xie, Yueqi, et al.
Published: (2024)

Quantum One-Wayness of the Single-Round Sponge with Invertible Permutations
by: Carolan, Joseph, et al.
Published: (2024)

ZeroPur: Succinct Training-Free Adversarial Purification
by: Liu, Erhu, et al.
Published: (2024)

Trojan Horses in Recruiting: A Red-Teaming Case Study on Indirect Prompt Injection in Standard vs. Reasoning Models
by: Wirth, Manuel
Published: (2026)

Conditional Cube Attack on Round-Reduced ASCON
by: Li, Zheng, et al.
Published: (2025)

Flamingo: Multi-Round Single-Server Secure Aggregation with Applications to Private Federated Learning
by: Ma, Yiping, et al.
Published: (2023)

Position Paper: Denial-of-Service against Multi-Round Transaction Simulation
by: Tang, Yuzhe, et al.
Published: (2026)

CipherFormer: Efficient Transformer Private Inference with Low Round Complexity
by: Wang, Weize, et al.
Published: (2024)

Improved Round-by-round Soundness IOPs via Reed-Muller Codes
by: Minzer, Dor, et al.
Published: (2025)

Scabbard: An Exploratory Study on Hardware Aware Design Choices of Learning with Rounding-based Key Encapsulation Mechanisms
by: Kundu, Suparna, et al.
Published: (2024)

Security theory for data flow and access control: From partial orders to lattices and back, a half-century trip
by: Logrippo, Luigi
Published: (2025)

Standing Firm in 5G: A Single-Round, Dropout-Resilient Secure Aggregation for Federated Learning
by: Zhang, Yiwei, et al.
Published: (2025)

Rethinking Fraud Safety Evaluation: Multi-Round Attacks Reveal Safety-Utility Tradeoffs in Graph-Context LLM Defenders
by: Jiang, Laura, et al.
Published: (2026)

Detection of Anomalous Network Nodes via Hierarchical Prediction and Extreme Value Theory
by: Kandanaarachchi, Sevvandi, et al.
Published: (2023)

DEHYDRATOR: Enhancing Provenance Graph Storage via Hierarchical Encoding and Sequence Generation
by: Ying, Jie, et al.
Published: (2024)

Qatsi: Stateless Secret Generation via Hierarchical Memory-Hard Key Derivation
by: Coignard, René, et al.
Published: (2025)

TraceAegis: Securing LLM-Based Agents via Hierarchical and Behavioral Anomaly Detection
by: Liu, Jiahao, et al.
Published: (2025)

Privacy-Aware Single-Nucleotide Polymorphisms (SNPs) using Bilinear Group Accumulators in Batch Mode
by: Buchanan, William J, et al.
Published: (2024)

The Round Complexity of Black-Box Post-Quantum Secure Computation
by: Chatterjee, Rohit, et al.
Published: (2025)

Fluent: Round-efficient Secure Aggregation for Private Federated Learning
by: Li, Xincheng, et al.
Published: (2024)