How to Efficiently Evaluate RAM Programs with Malicious Security

DOI10.1007/978-3-662-46800-5_27zbMath1370.94476OpenAlexW1170857557MaRDI QIDQ2948351

Mike Rosulek, Zhangxiang Hu, Arash Afshar, Payman Mohassel

Publication date: 30 September 2015

Published in: Advances in Cryptology -- EUROCRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46800-5_27

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (9)

Round optimal black-box ``commit-and-prove ⋮ Constant-Round Maliciously Secure Two-Party Computation in the RAM Model ⋮ Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs ⋮ Low-Leakage Secure Search for Boolean Expressions ⋮ Sublinear Zero-Knowledge Arguments for RAM Programs ⋮ Constant-round maliciously secure two-party computation in the RAM model ⋮ On the Complexity of Additively Homomorphic UC Commitments ⋮ Rate-1, Linear Time and Additively Homomorphic UC Commitments ⋮ TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption

This page was built for publication: How to Efficiently Evaluate RAM Programs with Malicious Security