Improved Delegation of Computation Using Fully Homomorphic Encryption
- 1 January 2010
- book chapter
- conference paper
- Published by Springer Nature in Lecture Notes in Computer Science
- Vol. 2010, 483-501
- https://doi.org/10.1007/978-3-642-14623-7_26
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Fully homomorphic encryption using ideal latticesPublished by Association for Computing Machinery (ACM) ,2009
- BOINC: A System for Public-Resource Computing and StoragePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- The random oracle methodology, revisitedJournal of the ACM, 2004
- Universal arguments and their applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- How to go beyond the black-box simulation barrierPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- Interactive proof systems and alternating time—space complexityTheoretical Computer Science, 1993
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991
- Checking computations in polylogarithmic timePublished by Association for Computing Machinery (ACM) ,1991
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Trading group theory for randomnessPublished by Association for Computing Machinery (ACM) ,1985