Results 221 to 230 of about 3,559 (249)
Some of the next articles are maybe not open access.
A Survey of Verifiable Computation
Mobile Networks and Applications, 2017Internet of Things (IoT) has taken place to motivate various intelligent applications with the data collected by the things”. Meanwhile, Cloud computing offers an efficient and convenient way to store, process and analyze huge amount of data. Because a Cloud Service Provider (CSP) that is employed to store and process user private data is actually not ...
Xixun Yu +2 more
openaire +3 more sources
2016
In a verifiable computation VC scheme, a client asks a server to perform some outsourced computations, and the latter returns the results as its response. The results can be verified privately or publicly. Fiore and Gennaro CCS 2012 constructed publicly verifiable protocols for secure outsourcing polynomials and matrix computations.
Yujuan Sun +5 more
openaire +1 more source
In a verifiable computation VC scheme, a client asks a server to perform some outsourced computations, and the latter returns the results as its response. The results can be verified privately or publicly. Fiore and Gennaro CCS 2012 constructed publicly verifiable protocols for secure outsourcing polynomials and matrix computations.
Yujuan Sun +5 more
openaire +1 more source
Verifiable Outsourced Computation
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017I will review recent (and not so recent) research on the topic of Verifiable Outsourced Computation. The problem of verifying the correctness of computations done by untrusted parties was a driving motivation behind some of the most celebrated results in Complexity Theory in the 90's, from Interactive Proofs to the PCP Theorem.
openaire +1 more source
Verifiable Computation of Large Polynomials
2015Due to the proliferation of powerful cloud service, verifiable computation, which makes a computationally weak client perform intensive computations possible through outsourcing tasks to a powerful server, is attracting increasing attention. The correctness of the returned result should be verified as the server may be not trusted. In this paper, we
Jiaqi Hong, Haixia Xu 0002, Peili Li
openaire +1 more source
Verifiable Computation for Randomized Algorithm
2016Verifiable computation enables a computationally weak client to delegate the difficult computation to a more powerful cloud server. When the client receives the returned result, it can verify the correctness of the result. As a new computing model, it has been widely studied.
Muhua Liu, Ying Wu 0008, Rui Xue 0001
openaire +1 more source
Modular Synthesis of Verified Verifiers of Computation with STV Algorithms
2019 IEEE/ACM 7th International Conference on Formal Methods in Software Engineering (FormaliSE), 2019Single transferable vote (STV) is a family of preferential voting systems, different instances of which are used in binding elections throughout the world. We give a formal specification of this family, from which we derive fully verified tools that verify the computation for various instances of STV vote counting.
Milad K. Ghale +2 more
openaire +1 more source
Verified computation of the matrix exponential
Advances in Computational Mathematics, 2018There are many traps to numerically computing the exponential of an $n \times n$ complex matrix $A$ (see, for example, [\textit{C. Moler} and \textit{C. Van Loan}, SIAM Rev. 45, No. 1, 3--49 (2003; Zbl 1030.65029)]). This paper analyzes two methods to compute interval matrices for $\exp (A)$.
openaire +1 more source
Confidentiality-Preserving Publicly Verifiable Computation
International Journal of Foundations of Computer Science, 2017Cloud computing enables users to outsource complicated computational tasks to a commercial computing server and relieves the users from establishing and maintaining expensive local computation systems. In this scenario, the minimum security requirement is that the result returned by the server must be correct. Publicly verifiable computation (PVC) has
Jiameng Sun +4 more
openaire +2 more sources
Verified Computation of Fast Decreasing Polynomials
Reliable Computing, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Neli S. Dimitrova, Svetoslav M. Markov
openaire +2 more sources
Stateful Multi-client Verifiable Computation
2018This paper develops an asynchronous cryptographic protocol for outsourcing arbitrary stateful computation among multiple clients to an untrusted server, while guaranteeing integrity of the data. The clients communicate only with the server and merely store a short authenticator to ensure that the server does not cheat.
Christian Cachin +3 more
openaire +2 more sources