Results 61 to 70 of about 2,887,711 (311)
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
Verified Compilation of Floating-Point Computations [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boldo, Sylvie +3 more
openaire +2 more sources
A Publicly Verifiable Multi-Secret Sharing Scheme With Outsourcing Secret Reconstruction
A publicly verifiable secret sharing (PVSS) scheme enjoys the public verification and the lower cost of communication than VSS scheme. However, the existing PVSS schemes cannot be applied in the scenarios of the devices with low computation ability and ...
Changlu Lin +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
Function-Dependent Commitments for Verifiable Multi-Party Computation [PDF]
In cloud computing, delegated computing raises the security issue of guaranteeing data authenticity during a remote computation. Existing solutions do not simultaneously provide fast correctness verification, strong security properties, and information ...
Johannes Buchmann +8 more
core +1 more source
A Hardware-Based Correct Execution Environment Supporting Virtual Memory
The rapid increase in data generation has led to outsourcing computation to cloud service providers, allowing clients to handle large tasks without investing resources.
Daehyeon Lee +8 more
doaj +1 more source
How to Verify a Quantum Computation
We give a new theoretical solution to a leading-edge experimental challenge, namely to the verification of quantum computations in the regime of high computational complexity. Our results are given in the language of quantum interactive proof systems. Specifically, we show that any language in $\mathsf{BQP}$ has a quantum interactive proof system with ...
openaire +3 more sources
ABSTRACT Background PIK3CA‐related overgrowth spectrum (PROS) includes several rare overgrowth disorders resulting from somatic gain‐of‐function mutations in PIK3CA. Despite treatment advances, including the recent approval of alpelisib for PROS in the United States, literature detailing the patient experience with PROS is limited.
Vamsi Bollu +8 more
wiley +1 more source
Unconditionally verifiable blind computation [PDF]
Blind Quantum Computing (BQC) allows a client to have a server carry out a quantum computation for them such that the client’s input, output and computation remain private. A desirable property for any BQC protocol is verification, whereby the client can
Joseph F. Fitzsimons +6 more
core +1 more source
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

