ALCHEMY
Authors:
Open Access
- 15 October 2018
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1020-1037
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (CNS-1606362)
- National Science Foundation (CCF-1054495)
This publication has 42 references indexed in Scilit:
- On the Homomorphic Computation of Symmetric Cryptographic Primitives2013
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based2013
- Key Homomorphic PRFs and Their Applications2013
- Practical Bootstrapping in Quasilinear Time2013
- Batch Fully Homomorphic Encryption over the Integers2013
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP2012
- Homomorphic Evaluation of the AES Circuit2012
- Implementing Gentry’s Fully-Homomorphic Encryption Scheme2011
- Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languagesJournal of Functional Programming, 2009
- Sharemind: A Framework for Fast Privacy-Preserving Computations2008