On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- 19 May 2012
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1219-1234
- https://doi.org/10.1145/2213977.2214086
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- On lattices, learning with errors, random linear codes, and cryptographyJournal of the ACM, 2009
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning ProblemsLecture Notes in Computer Science, 2009
- Scalable Multiparty Computation with Nearly Optimal Work and ResilienceLecture Notes in Computer Science, 2008
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space EfficiencyPublished by Springer Science and Business Media LLC ,2008
- Worst‐Case to Average‐Case Reductions Based on Gaussian MeasuresSIAM Journal on Computing, 2007
- On Cryptographic Assumptions and ChallengesLecture Notes in Computer Science, 2003
- NTRU: A ring-based public key cryptosystemLecture Notes in Computer Science, 1998
- Public-key cryptosystems from lattice reduction problemsLecture Notes in Computer Science, 1997
- Improved Efficient ArgumentsLecture Notes in Computer Science, 1995
- Cryptographic Primitives Based on Hard Learning ProblemsLecture Notes in Computer Science, 1994