Verifiable Delegation of Computation over Large Datasets
- 1 January 2011
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 48 references indexed in Scilit:
- Identity-Based Encryption Secure against Selective Opening AttackLecture Notes in Computer Science, 2011
- From Secrecy to Soundness: Efficient Verification via Secure ComputationLecture Notes in Computer Science, 2010
- Incentivizing outsourced computationPublished by Association for Computing Machinery (ACM) ,2008
- Provable data possession at untrusted storesPublished by Association for Computing Machinery (ACM) ,2007
- Short Signatures Without Random Oracles and the SDH Assumption in Bilinear GroupsJournal of Cryptology, 2007
- Evaluating 2-DNF Formulas on CiphertextsLecture Notes in Computer Science, 2005
- Efficient Selective-ID Secure Identity-Based Encryption Without Random OraclesLecture Notes in Computer Science, 2004
- Checking the correctness of memoriesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The invasiveness of off-line memory checkingPublished by Association for Computing Machinery (ACM) ,2002
- Completeness theorems for non-cryptographic fault-tolerant distributed computationPublished by Association for Computing Machinery (ACM) ,1988