3-party secure computation for RAMs: optimal and concretely efficient

DOI10.1007/978-3-031-48615-9_17zbMATH Open1544.94253MaRDI QIDQ6581802FDOQ6581802

Authors: Atsunori Ichikawa, Ilan Komargodski, Koki Hamada, Ryo Kikuchi, Dai Ikarashi 

Publication date: 1 August 2024

zbMATH Keywords

concretely-efficient 3-party oblivious permutation protocoldistributed oblivious random access memorymalicious attackers

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Database theory (68P15) Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12)

Cites Work

• How to share a secret
• Relations Among Complexity Measures
• Security and composition of multiparty cryptographic protocols
• Cuckoo hashing
• Theory of Cryptography
• Title not available (Why is that?)
• Software protection and simulation on oblivious RAMs
• Privacy-preserving access of outsourced data via oblivious RAM simulation
• More robust hashing: cuckoo hashing with a stash
• Ciphers for MPC and FHE
• Circuits resilient to additive attacks with applications to secure computation
• Fast large-scale honest-majority MPC for malicious adversaries
• Improved primitives for secure multiparty integer computation
• High-throughput secure three-party computation for malicious adversaries and an honest majority
• Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
• Three-party ORAM for secure computation
• Distributed Oblivious RAM for Secure Two-Party Computation
• Efficient 3-party distributed ORAM
• OptORAMa: optimal oblivious RAM
• Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution
• Efficient multi-party computation: from passive to active security via secure SIMD circuits
• Field extension in secret-shared form and its applications to efficient secure computation
• Secure Multiparty AES
• Oblivious RAM with \textit{worst-case} logarithmic overhead
• From oblivious AES to efficient and secure database join in the multiparty setting
• 3-party distributed ORAM from oblivious set membership

Cited In (1)

• DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead

This page was built for publication: 3-party secure computation for RAMs: optimal and concretely efficient

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6581802)