How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
Top Cited Papers
- 1 January 2012
- 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 19 references indexed in Scilit:
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back againPublished by Association for Computing Machinery (ACM) ,2012
- Delegatable Homomorphic Encryption with Applications to Secure Outsourcing of ComputationLecture Notes in Computer Science, 2012
- Separating succinct non-interactive arguments from all falsifiable assumptionsPublished by Association for Computing Machinery (ACM) ,2011
- Verifiable Delegation of Computation over Large DatasetsLecture Notes in Computer Science, 2011
- Functional Encryption: Definitions and ChallengesLecture Notes in Computer Science, 2011
- From Secrecy to Soundness: Efficient Verification via Secure ComputationLecture Notes in Computer Science, 2010
- Improved Delegation of Computation Using Fully Homomorphic EncryptionLecture Notes in Computer Science, 2010
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted WorkersLecture Notes in Computer Science, 2010
- Identity-Based Encryption from the Weil PairingSIAM Journal on Computing, 2003
- Non-interactive zero-knowledge and its applicationsPublished by Association for Computing Machinery (ACM) ,1988