Results 21 to 30 of about 3,559 (249)
Practical Verifiable Computation by Using a Hardware-Based Correct Execution Environment
The verifiable computation paradigm has been studied extensively as a means to verifying the result of outsourced computation. In said scheme, the verifier requests computation from the prover and verifies the result by checking the output and proof ...
Junghee Lee +4 more
doaj +1 more source
Verifiable Privacy-Preserving Computing
Privacy-preserving computation (PPC) methods, such as secure multiparty computation (MPC) and homomorphic encryption (HE), are deployed increasingly often to guarantee data confidentiality in computations over private, distributed data. Similarly, we observe a steep increase in the adoption of zero-knowledge proofs (ZKPs) to guarantee (public ...
Tariq Bontekoe +2 more
openaire +2 more sources
Outsourcing computation has become increasingly popular due to its cost-effectiveness, enabling users with limited resources to conduct large-scale computations on potentially untrusted cloud platforms. In order to safeguard privacy, verifiable computing
Yang Yang, Guanghua Song
doaj +1 more source
Interactive Proofs for Rounding Arithmetic
Interactive proofs are a type of verifiable computing that secures the integrity of computations. The need is increasing as more computations are outsourced to untrusted parties, e.g., cloud computing platforms.
Shuo Chen +3 more
doaj +1 more source
A Certified Compiler for Verifiable Computing [PDF]
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
Verified Self-Explaining Computation [PDF]
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
RAitc: Securely Auditing the Remotely Executed Applications
One of the most important security challenges in remote computing (e.g., cloud computing) is protecting users’ applications running on the service platform from malicious attacks.
Lei Zhou, Entao Luo, Guojun Wang
doaj +1 more source
Verifying Outsourced Computation in an Edge Computing Marketplace
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
Generalising KAT to Verify Weighted Computations [PDF]
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
Efficient Verifiable Multi-Key Searchable Encryption in Cloud Computing
The notion of Multi-Key Searchable Encryption (MKSE) enables data owners to outsource their data into a cloud server, while supporting fine-grained data sharing with the authorized users. Note that the traditional MKSE is vulnerable to data leakage. That
Yaping Su +3 more
doaj +1 more source

