Filters








318 Hits in 3.7 sec

Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers [chapter]

Rosario Gennaro, Craig Gentry, Bryan Parno
2010 Lecture Notes in Computer Science  
We present a protocol that allows the worker to return a computationally-sound, non-interactive proof that can be verified in O(m · poly(λ)) time, where m is the bit-length of the output of F, and λ is  ...  We introduce and formalize the notion of Verifiable Computation, which enables a computationally weak client to "outsource" the computation of a function F on various dynamically-chosen inputs x 1 , ..  ...  Acknowledgements The authors are grateful to Virgil Gligor for a number of useful discussions and to the anonymous reviewers for their helpful suggestions.  ... 
doi:10.1007/978-3-642-14623-7_25 fatcat:haduttbxhbegtjhu5dejeq5yve

Twin Clouds: Secure Cloud Computing with Low Latency [chapter]

Sven Bugiel, Stefan Nürnberger, Ahmad-Reza Sadeghi, Thomas Schneider
2011 Lecture Notes in Computer Science  
Cloud computing promises a cost effective enabling technology to outsource storage and massively parallel computations.  ...  and later on queried in the powerful but untrusted Commodity Cloud.  ...  We thank Radu Sion for pointing out the analogy of our Twin Clouds model with a rechargeable battery that accumulates energy (computations) over some time and can then be uncharged rapidly.  ... 
doi:10.1007/978-3-642-24712-5_3 fatcat:hlhej2sgk5gajd3l2m4mfwlnby

Trust extension for commodity computers

Bryan Parno
2012 Communications of the ACM  
Verifiable computation allows a client to outsource the computation of a function and efficiently verify the results returned while keeping inputs and outputs private; constraining the way the worker/server  ...  software security is insufficient; also needed is the ability to securely verify whether a computer employs the new software.  ...  The definition of verifiable computation here is non-interactive: The client sends a single message to the worker and vice versa.  ... 
doi:10.1145/2184319.2184339 fatcat:oxr7zwebyjhelpxt2quhbn5oai

Integrity verification of cloud-hosted data analytics computations

Hui (Wendy) Wang
2012 Proceedings of the 1st International Workshop on Cloud Intelligence - Cloud-I '12  
In this position paper, we present efficient and practical integrity verification techniques that check whether the untrusted cloud has returned correct result of outsourced data analytics computations  ...  We discuss our verification techniques for both non-collusive and collusive malicious workers in MapReduce.  ...  Several existing techniques such as interactive proofs [10] , probabilistically checkable proofs [4, 5] , and non-interactive verifiable computing [8, 9, 12] have been proposed to address integrity  ... 
doi:10.1145/2347673.2347678 dblp:conf/cloudi/Wang12 fatcat:nm5adaxjvjedbnzpf3e2y2umly

Introducing Reputation Systems to the Economics of Outsourcing Computations to Rational Workers [chapter]

Jassim Aljuraidan, Lujo Bauer, Michael K. Reiter, Matthias Beckerle
2017 Lecture Notes in Computer Science  
Outsourcing computation to remote parties ("workers") is an increasingly common practice, owing in part to the growth of cloud computing.  ...  Overall, our results contribute to make outsourcing computation more reliable, consistent, and predictable.  ...  Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation here on.  ... 
doi:10.1007/978-3-662-54970-4_4 fatcat:yelvzsntyzdjfg7sry753rdfha

Verifying computations with state

Benjamin Braun, Ariel J. Feldman, Zuocheng Ren, Srinath Setty, Andrew J. Blumberg, Michael Walfish
2013 Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles - SOSP '13  
Pantry composes proof-based verifiable computation with untrusted storage: the client expresses its computation in terms of digests that attest to state, and verifiably outsources that computation.  ...  Using Pantry, we extend verifiability to MapReduce jobs, simple database queries, and interactions with private state.  ...  Acknowledgments We first learned of the folklore approach to verifying computations with state from motivating comments by Yuval Ishai and an anonymous NDSS 2012 reviewer.  ... 
doi:10.1145/2517349.2522733 dblp:conf/sosp/BraunFRSBW13 fatcat:6ixszhlquvfvbgazl2i7qtw6ve

Signatures of Correct Computation [chapter]

Charalampos Papamanthou, Elaine Shi, Roberto Tamassia
2013 Lecture Notes in Computer Science  
In the SCC model, a trusted source outsources a function f to an untrusted server, along with a public key for that function (to be used during verification).  ...  We introduce Signatures of Correct Computation (SCC), a new model for verifying dynamic computations in cloud settings.  ...  This work was supported by Intel through the ISTC for Secure Computing, by the National Science Foundation under grants CCF-0424422, 0842695, 0808617 and CNS-1228485, by the Air Force Office of Scientific  ... 
doi:10.1007/978-3-642-36594-2_13 fatcat:7pplqm6pkjgytgbqomhnnsq4xq

How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption [chapter]

Bryan Parno, Mariana Raykova, Vinod Vaikuntanathan
2012 Lecture Notes in Computer Science  
The wide variety of small, computationally weak devices, and the growing number of computationally intensive tasks makes the delegation of computation to large data centers a desirable solution.  ...  However, computation outsourcing is useful only when the returned result can be trusted, which makes verifiable computation (VC) a must for such scenarios.  ...  Public Verifiable Computation Verifiable computation schemes enable a client to outsource the computation of a function F to an untrusted worker, and verify the correctness of the results returned by the  ... 
doi:10.1007/978-3-642-28914-9_24 fatcat:esazllg7ofganknzd5h4chkzoa

Verifiable Delegation of Computation through Fully Homomorphic Encryption

Alpana Vijay, Vijay Kumar Sharma
2014 International Journal of Computer Applications  
wants to verify amount charged by the service provider.  ...  Since it is mostly used by lightweight devices, so mechanisms are required to verify the results of computations efficiently.  ...  Ideally it is required that the cloud should be able to compute on private data without seeing (decrypting) itreferred to as secure outsourcing of computation.  ... 
doi:10.5120/17087-7544 fatcat:zdty72bpmbbuzeffz4pm62q5gm

A Framework for Outsourcing of Secure Computation

Thomas P. Jakobsen, Jesper Buus Nielsen, Claudio Orlandi
2014 Proceedings of the 6th edition of the ACM Workshop on Cloud Computing Security - CCSW '14  
We study the problem of how to efficiently outsource a sensitive computation on secret inputs to a number of untrusted workers, under the assumption that at least one worker is honest.  ...  The clients want to delegate a secure computation of f (x1, . . . , xn) to a set of untrusted workers W1, . . . , Wm.  ...  A notable example is the case of verifiable delegation of computation [GGP10,PHGR13,BSCG + 13, BFR13, BFR13] where one (or more) computationally bounded clients want to perform a computation on an untrusted  ... 
doi:10.1145/2664168.2664170 dblp:conf/ccs/JakobsenNO14 fatcat:yq3zngygmre47ewaioi2h2kjxq

Secure Optimization Computation Outsourcing in Cloud Computing: A Case Study of Linear Programming

Cong Wang, Kui Ren, Jia Wang
2016 IEEE transactions on computers  
Cloud computing enables an economically promising paradigm of computation outsourcing.  ...  Focusing on engineering computing and optimization tasks, this paper investigates secure outsourcing of widely applicable linear programming (LP) computations.  ...  Verifiable computation delegation, where a computationally weak customer can verify the correctness of the delegated computation results from a powerful but untrusted server without investing too much  ... 
doi:10.1109/tc.2015.2417542 fatcat:acwowbtquvepteksw5hc5hyaoe

Pinocchio: Nearly Practical Verifiable Computation

B. Parno, J. Howell, C. Gentry, M. Raykova
2013 2013 IEEE Symposium on Security and Privacy  
To instill greater confidence in computations outsourced to the cloud, clients should be able to verify the correctness of the results returned.  ...  The worker then evaluates the computation on a particular input and uses the evaluation key to produce a proof of correctness.  ...  Background Verifiable Computation (VC) A public verifiable computation (VC) scheme allows a computationally limited client to outsource to a worker the evaluation of a function F on input u.  ... 
doi:10.1109/sp.2013.47 dblp:conf/sp/ParnoHG013 fatcat:ilx75lduibccnek4nfreezyx7q

Geppetto: Versatile Verifiable Computation

Craig Costello, Cedric Fournet, Jon Howell, Markulf Kohlweiss, Benjamin Kreuter, Michael Naehrig, Bryan Parno, Samee Zahur
2015 2015 IEEE Symposium on Security and Privacy  
Cloud computing sparked interest in Verifiable Computation protocols, which allow a weak client to securely outsource computations to remote parties.  ...  Recent work has dramatically reduced the client's cost to verify the correctness of their results, but the overhead to produce proofs remains largely impractical.  ...  Introduction The recent growth of mobile and cloud computing makes outsourcing computations from a weak client to a computationally powerful worker increasingly attractive economically.  ... 
doi:10.1109/sp.2015.23 dblp:conf/sp/CostelloFHKKNPZ15 fatcat:pjikpgcgpjg5zayhvhrzkmfcjm

Revocation in Publicly Verifiable Outsourced Computation [chapter]

James Alderman, Christian Janson, Carlos Cid, Jason Crampton
2015 Lecture Notes in Computer Science  
Thus, there is a desire for clients to outsource the evaluation of complex functions to an external server.  ...  In this work, we introduce the notion of Revocable Publicly Verifiable Computation (RPVC), where a cheating server is revoked and may not perform future computations (thus incurring a financial penalty  ...  Verifiable Computation Schemes and Related Work The concept of non-interactive verifiable computation was introduced by Gennaro et al.  ... 
doi:10.1007/978-3-319-16745-9_4 fatcat:ny6ip5mc7nfdbphth4gr5wzx3e

Verifiable Computations with RAM-like Running Times [article]

Tahsin Civan Mert Dönmez
2018 arXiv   pre-print
This work proposes a solution which enjoys the following two desirable properties: (1) cost of input preparation and verification is very low (low enough to allow verifiable outsourcing of computations  ...  Current and emerging trends such as cloud computing, fog computing, and more recently, multi-access edge computing (MEC) increase the interest in finding solutions to the verifiable computation problem  ...  Introduction Verifiable outsourcing of computations involves a possibly computationally weak outsourcing party (outsourcer), and one or more worker parties (evaluators) who are possibly untrusted by the  ... 
arXiv:1809.04174v1 fatcat:zohqkdjtj5dm5hcg6k42faurgu
« Previous Showing results 1 — 15 out of 318 results