Results 21 to 30 of about 38,400 (270)
Verifiable Quantum Cloud Computation Scheme Based on Blind Computation
IEEE Access, 2020 In this paper, we propose a verifiable quantum cloud computation scheme based on blind quantum computation which effectively solves the privacy and verifiability problem for clients when interfacing with quantum computer in cloud computation.
Jing Li +3 more
doaj +1 more source
Efficient Generation of Program Execution Hash
IEEE Access, 2022 Distributed computing systems often require verifiable computing techniques in case their node is untrusted. To verify a node’s computation result, proof-of-work (PoW) is often utilized as a basis of verifiable computing method; however, this ...
Eunyeong Ahn +4 more
doaj +1 more source
Verifying BQP Computations on Noisy Devices with Minimal Overhead
PRX Quantum, 2021 With the development of delegated quantum computation, clients will want to ensure confidentiality of their data and algorithms and the integrity of their computations.
Dominik Leichtle +3 more
doaj +1 more source
Verifiable Homomorphic Encrypted Computations for Cloud Computing [PDF]
International Journal of Advanced Computer Science and Applications, 2021 Cloud computing is becoming an essential part of computing, especially for enterprises. As the need for cloud computing increases, the need for cloud data privacy, con-fidentially, and integrity are also becoming essential. Among potential solutions, homomorphic encryption can provide the needed privacy and confidentiality. Unlike traditional cryptosys-
Ruba Awadallah +2 more
openaire +1 more source
Verifying computations with state [PDF]
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, 2013 When a client outsources a job to a third party (e.g., the cloud), how can the client check the result, without re-executing the computation? Recent work in proof-based verifiable computation has made significant progress on this problem by incorporating deep results from complexity theory and cryptography into built systems.
Benjamin Braun +5 more
openaire +1 more source
Correctness Verifiable Outsourcing Computation Scheme of Shortest Path Querying over Encrypted Graph Data [PDF]
Jisuanji kexueMass 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
Verified Self-Explaining Computation [PDF]
, 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.
Stolarek, Jan, Cheney, James
openaire +4 more sources
Improved Resource State for Verifiable Blind Quantum Computation
Entropy, 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
Verifiable Privacy-Preserving Computing
, 2023 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 ...
Bontekoe, Tariq +2 more
openaire +2 more sources
Verifiable Computing Using Computation Fingerprints Within FHE [PDF]
2021 IEEE 20th International Symposium on Network Computing and Applications (NCA), 2021 We suggest using Fully Homomorphic Encryption (FHE) to be used, not only to keep the privacy of information but also, to verify computations with no additional significant overhead, using only part of the variables length for verification. This method supports the addition of encrypted values as well as multiplication of encrypted values by the ...
Dolev, Shlomi, Kalma, Arseni
openaire +2 more sources