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

DOI10.1007/978-3-031-48615-9_17MaRDI QIDQ6581802zbMATH OpenFDO

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

Publication date 1 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-48615-9_17

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)

Recommendations

• 3-party distributed ORAM from oblivious set membership
• Efficient 3-party distributed ORAM
• DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
• Three-party ORAM for secure computation
• 3PC ORAM with low latency, low bandwidth, and fast batch retrieval

Cites work

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

Cited in

(2)

• DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
• Multiparty distributed point functions

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)