Doubly efficient cryptography: commitments, arguments and RAM MPC
From MaRDI portal
Publication:6653029
DOI10.1007/978-3-031-68397-8_8MaRDI QIDQ6653029
Wei-Kai Lin, Ethan Mook, Daniel Wichs
Publication date: 13 December 2024
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Information storage and retrieval of data (68P20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient maliciously secure multiparty computation for RAM
- Can we access a database both locally and privately?
- Towards doubly efficient private information retrieval
- Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
- How to Efficiently Evaluate RAM Programs with Malicious Security
- Improved Delegation of Computation Using Fully Homomorphic Encryption
- Software protection and simulation on oblivious RAMs
- Foundations of Cryptography
- Multi-collision resistance: a paradigm for keyless hash functions
- Theory of Cryptography
- Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
This page was built for publication: Doubly efficient cryptography: commitments, arguments and RAM MPC
