Efficient Computations over Encrypted Data Blocks
From MaRDI portal
Publication:2946399
DOI10.1007/978-3-662-48054-0_23zbMath1465.94063OpenAlexW2404375312MaRDI QIDQ2946399
Jonathan Kirsch, Giovanni Crescenzo, Brian A. Coan
Publication date: 16 September 2015
Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48054-0_23
Cites Work
- Fully Homomorphic Encryption with Polylog Overhead
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Secure Multiparty Computation Goes Live
- Conditional Oblivious Transfer and Timed-Release Encryption
- Foundations of Cryptography
- Fully homomorphic encryption using ideal lattices
- Theory of Cryptography
- Unnamed Item
- Unnamed Item
This page was built for publication: Efficient Computations over Encrypted Data Blocks