Results 41 to 50 of about 4,798 (280)
Efficient Verifiable Multi-Key Searchable Encryption in Cloud Computing
IEEE Access, 2019 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
An active and verifiable trust evaluation approach for edge computing
Journal of Cloud Computing: Advances, Systems and Applications, 2020 Billions of Internet of Thing (IoT) devices are deployed in edge network. They are used to monitor specific event, process and to collect huge data to control center with smart decision based on the collected data. However, some malicious IoT devices may
Wen Mo +3 more
doaj +1 more source
Verifying spatial properties of array computations [PDF]
Proceedings of the ACM on Programming Languages, 2017 Arrays computations are at the core of numerical modelling and computational science applications. However, low-level manipulation of array indices is a source of program error. Many practitioners are aware of the need to ensure program correctness, yet very few of the techniques from the programming research community are applied by scientists. We aim
Dominic A. Orchard +3 more
openaire +3 more sources
Hybrid Publicly Verifiable Computation [PDF]
, 2016 Publicly Verifiable Outsourced Computation PVC allows weak devices to delegate computations to more powerful servers, and to verify the correctness of results. Delegation and verification rely only on public parameters, and thus PVC lends itself to large multi-user systems where entities need not be registered.
Alderman, James +3 more
openaire +2 more sources
Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers [PDF]
, 2010 Verifiable Computation enables a computationally weak client to outsource the computation of a function F on various inputs x_1,...,x_k to one or more workers.
Rosario Gennaro +2 more
core +1 more source
Fast, Verified Computation for Candle.
, 2023 This paper describes how we have added an efficient function for computation to the kernel of the Candle interactive theorem prover. Candle is a CakeML port of HOL Light which we have, in prior work, proved sound w.r.t. the inference rules of the higher-order logic.
Abrahamsson, Oskar, Myreen, Magnus O.
openaire +3 more sources
Verified Computations for Hyperbolic 3-Manifolds [PDF]
Experimental Mathematics, 2015 For a given cusped 3-manifold $M$ admitting an ideal triangulation, we describe a method to rigorously prove that either $M$ or a filling of $M$ admits a complete hyperbolic structure via verified computer calculations. Central to our method are an implementation of interval arithmetic and Krawczyk's Test. These techniques represent an improvement over
Neil R. Hoffman +5 more
openaire +3 more sources
Computable analysis for verified exact real computation [PDF]
, 2020 We use ideas from computable analysis to formalize exact real number computation in the Coq proof assistant. Our formalization is built on top of the Incone library, a Coq library for computable analysis. We use the theoretical framework that computable analysis provides to systematically generate target specifications for real number algorithms. First
Konečný, Michal +2 more
openaire +3 more sources
网络与信息安全学报, 2016 In view of the problem that users’ informations are leaked and tampered possiblely exists at service terminal in existing outsourcing cloud computing protocols,a secure efficient and verifiable outsourcing protocol about determinant computing in the ...
Rui SUN, You-Liang TIAN
doaj +3 more sources
Verifiable Subgraph Matching With Cryptographic Accumulators in Cloud Computing
IEEE Access, 2019 Due to the rapid development of social networks, bio-informatics, internet-of-things etc., subgraph matching query can be found in various applications.
Yixiao Zhu +3 more
doaj +1 more source