Doubly efficient cryptography: commitments, arguments and RAM MPC
From MaRDI portal
Recommendations
Cites work
- Can we access a database both locally and privately?
- Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
- Efficient maliciously secure multiparty computation for RAM
- Foundations of Cryptography
- How to efficiently evaluate RAM programs with malicious security
- scientific article; zbMATH DE number 5009195 (Why is no real title available?)
- scientific article; zbMATH DE number 1261806 (Why is no real title available?)
- scientific article; zbMATH DE number 1559545 (Why is no real title available?)
- scientific article; zbMATH DE number 1759771 (Why is no real title available?)
- Improved delegation of computation using fully homomorphic encryption
- Multi-collision resistance: a paradigm for keyless hash functions
- Software protection and simulation on oblivious RAMs
- Succinct arguments from multi-prover interactive proofs and their efficiency benefits
- Theory of Cryptography
- Towards doubly efficient private information retrieval
Cited in
(2)
This page was built for publication: Doubly efficient cryptography: commitments, arguments and RAM MPC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653029)