How to efficiently evaluate RAM programs with malicious security

DOI10.1007/978-3-662-46800-5_27MaRDI QIDQ2948351zbMATH OpenOpenAlexFDO

Authors Arash Afshar, Zhangxiang Hu, Payman Mohassel, Mike Rosulek

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

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

Recommendations

• Constant-round maliciously secure two-party computation in the RAM model
• Constant-round maliciously secure two-party computation in the RAM model
• Secure multiparty RAM computation in constant rounds
• Efficient maliciously secure multiparty computation for RAM
• Distributed Oblivious RAM for Secure Two-Party Computation

Cited in

(11)

• Sublinear zero-knowledge arguments for RAM programs
• Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed 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
• Round optimal black-box ``commit-and-prove
• \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
• Efficient maliciously secure multiparty computation for RAM
• Constant-round maliciously secure two-party computation in the RAM model
• Doubly efficient cryptography: commitments, arguments and RAM MPC
• Low-leakage secure search for Boolean expressions

This page was built for publication: How to efficiently evaluate RAM programs with malicious security

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