Results 281 to 290 of about 2,887,711 (311)
Some of the next articles are maybe not open access.

Verifiable Blind Quantum Computation With Identity Authentication for Multi-Type Clients

IEEE Transactions on Information Forensics and Security
Blind quantum computation (BQC) provides a solution for clients with limited quantum capabilities to delegate their quantum computational tasks to remote quantum servers while keeping their own data private.
Qin Li, Lvzhou Li
exaly   +2 more sources

Verifiable Computation using Smart Contracts

Cloud Computing Security Workshop, 2019
Outsourcing computation has been widely used to allow weak clients to access computational resources of a cloud. A natural security requirement for the client is to be able to efficiently verify the received computation result.
S. Avizheh   +3 more
semanticscholar   +1 more source

Public verifiable measurement-only blind quantum computation based on entanglement witnesses

Quantum Information Processing, 2023
Recently, Sato et al. proposed an public verifiable blind quantum computation (BQC) protocol by inserting a third-party arbiter. However, it is not true public verifiable in a sense, because the arbiter is determined in advance and participates in the ...
Wenjie Liu   +3 more
semanticscholar   +1 more source

Primitives towards verifiable computation: a survey

Frontiers of Computer Science, 2018
Licheng Wang   +2 more
exaly   +2 more sources

Libras: A Fair, Secure, Verifiable, and Scalable Outsourcing Computation Scheme Based on Blockchain

IEEE Transactions on Information Forensics and Security
Existing multitask outsourcing computations struggle to guarantee the fairness for participants and the correctness of the computation results. Some solutions use blockchain to address the fairness issue in outsourcing computations.
Lijuan Huo   +5 more
semanticscholar   +1 more source

Verified computation of the matrix exponential

Advances in Computational Mathematics, 2018
There 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

Verifiable Computation for Randomized Algorithm

2016
Verifiable 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

Publicly Verifiable Secure Multi-Party Computation Framework Based on Bulletin Board

IEEE Transactions on Services Computing
Although secure multi-party computation breaks down data barriers, its utility is reduced when participants have limited computation and communication resources.
Xiaotong Li   +6 more
semanticscholar   +1 more source

Verified Computation of Fast Decreasing Polynomials

Reliable Computing, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Neli S. Dimitrova, Svetoslav M. Markov
openaire   +2 more sources

Multi-Client Verifiable Computation Service for Outsourced Data

2017 IEEE International Conference on Web Services (ICWS), 2017
Rui Xue
exaly   +2 more sources

Home - About - Disclaimer - Privacy