Results 31 to 40 of about 3,559 (249)
Hybrid Publicly Verifiable Computation [PDF]
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
An active and verifiable trust evaluation approach for edge computing
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]
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
Computable analysis for verified exact real computation [PDF]
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
At present, secure multi-party computing is an effective solution for organizations and institutions that want to derive greater value and benefit from the collaborative computing of their data.
Yongbo Jiang, Yuan Zhou, Tao Feng
doaj +1 more source
Fast, Verified Computation for Candle.
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]
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
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
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
ABSTRACT Pediatric gastroenteropancreatic neuroendocrine neoplasms (GEP‐NENs) are extremely rare and clinically heterogeneous. Management has largely been extrapolated from adult practice. This European Standard Clinical Practice Guideline (ESCP), developed by the EXPeRT network in collaboration with adult NEN experts, provides (adult) evidence ...
Michaela Kuhlen +23 more
wiley +1 more source

