Results 21 to 30 of about 2,533 (255)

Secure Collaborative Publicly Verifiable Computation

open access: yesIEEE Access, 2017
Publicly Verifiable Computation (PVC) enables computationally weak trusted sources to outsource several computations to some more powerful public untrusted clouds.
Qiang Wang   +4 more
doaj   +1 more source

Correctness Verifiable Outsourcing Computation Scheme of Shortest Path Querying over Encrypted Graph Data [PDF]

open access: yesJisuanji kexue
Mass graph data such as geolocation and social networks are widely used and contain massive privacy,usually,it requires varied query services through secure outsourcing computation schemes.However,it is still an open challenge to design correctness ...
DING Hongfa, YU Yingying, JIANG Heling
doaj   +1 more source

A Certified Compiler for Verifiable Computing [PDF]

open access: yes2016 IEEE 29th Computer Security Foundations Symposium (CSF), 2016
In cryptology, verifiable computing aims at verifying the remote execution of a program on an untrusted machine, based on its I/O and constant-sized evidence collected during its execution. Recent cryptographic schemes and compilers enable practical verifiable computations for some programs written in C, but their soundness with regards to C semantics ...
Fournet, Cédric   +2 more
openaire   +2 more sources

Improved Resource State for Verifiable Blind Quantum Computation

open access: yesEntropy, 2020
Recent advances in theoretical and experimental quantum computing raise the problem of verifying the outcome of these quantum computations. The recent verification protocols using blind quantum computing are fruitful for addressing this problem ...
Qingshan Xu, Xiaoqing Tan, Rui Huang
doaj   +1 more source

Privacy-preserving verifiable delegation of polynomial and matrix functions

open access: yesJournal of Mathematical Cryptology, 2020
Outsourcing computation has gained significant popularity in recent years due to the development of cloud computing and mobile services. In a basic outsourcing model, a client delegates computation of a function f on an input x to a server. There are two
Zhang Liang Feng, Safavi-Naini Reihaneh
doaj   +1 more source

Verified Self-Explaining Computation [PDF]

open access: yes, 2019
Common programming tools, like compilers, debuggers, and IDEs, crucially rely on the ability to analyse program code to reason about its behaviour and properties. There has been a great deal of work on verifying compilers and static analyses, but far less on verifying dynamic analyses such as program slicing.
Jan Stolarek, James Cheney
openaire   +2 more sources

Verifying Outsourced Computation in an Edge Computing Marketplace

open access: yesMachine Learning & Applications, 2022
An edge computing marketplace could enable IoT devices (Outsourcers) to outsource computation to any participating node (Contractors) in their proximity. In return, these nodes receive a reward for providing computation resources. In this work, we propose a scheme that verifies the integrity of arbitrary deterministic functions in the presence of both ...
Christopher Harth-Kitzerow   +1 more
openaire   +2 more sources

Verifiable outsourced attribute-based encryption with access update

open access: yes网络与信息安全学报, 2019
In order to meet the secure and reliable access requirements for the encrypted data stored in the public cloud,a verifiable outsourced attribute-based encryption scheme with access update was proposed.Based on a standard KP-ABE scheme,verifiable ...
Suqing LIN
doaj   +3 more sources

CExp: secure and verifiable outsourcing of composite modular exponentiation with single untrusted server

open access: yesDigital Communications and Networks, 2017
Outsourcing computing allows users with resource-constrained devices to outsource their complex computation workloads to cloud servers that may not be honest.
Shuai Li   +3 more
doaj   +1 more source

Generalising KAT to Verify Weighted Computations [PDF]

open access: yesScientific Annals of Computer Science, 2019
Kleene algebra with tests (KAT) was introduced as an algebraic structure to model and reason about classic imperative programs, i.e. sequences of discrete transitions guarded by Boolean tests. This paper introduces two generalisations of this structure able to express programs as weighted transitions and tests with outcomes in non necessarily bivalent ...
Gomes, Leandro   +2 more
openaire   +6 more sources

Home - About - Disclaimer - Privacy