Efficient computations over encrypted data blocks
From MaRDI portal
Recommendations
Cites work
- Conditional oblivous transfer and timed-release encryption
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Foundations of Cryptography
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with polylog overhead
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- Keyword search and oblivious pseudorandom functions
- Private selective payment protocols
- Secure multiparty computation goes live
Cited in
(7)- Efficient coding for secure computing with additively-homomorphic encrypted data
- Secure computation, I/O-efficient algorithms and distributed signatures
- Towards Robust Computation on Encrypted Data
- Secure computation for big data
- Two-Party Computing with Encrypted Data
- Practical two-party computation based on the conditional gate
- Limits of practical sublinear secure computation
This page was built for publication: Efficient computations over encrypted data blocks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946399)