Results 11 to 20 of about 38,400 (270)

Analysis and Application of Verifiable Computation Techniques in Blockchain Systems for the Energy Sector

open access: yesFrontiers in Blockchain, 2021
The energy system is becoming increasingly decentralized. This development requires integrating and coordinating a rising number of actors and small units in a complex system.
Andreas Zeiselmair    +7 more
doaj   +3 more sources

Practical Verifiable Computation by Using a Hardware-Based Correct Execution Environment

open access: yesIEEE Access, 2020
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   +3 more sources

Verifiable Computing Applications in Blockchain

open access: yesIEEE Access, 2021
From weak clients outsourcing computational tasks to more powerful machines, to distributed blockchain nodes needing to agree on the state of the ledger in the presence of adversarial nodes, there is a growing need to efficiently verify the results of ...
Silvio Simunic   +2 more
doaj   +3 more sources

Geppetto: Versatile Verifiable Computation [PDF]

open access: yes2015 IEEE Symposium on Security and Privacy, 2015
Cloud computing sparked interest in Verifiable Computation protocols, which allow a weak client to securely outsource computations to remote parties. Recent work has dramatically reduced the client's cost to verify the correctness of their results, but the overhead to produce proofs remains largely impractical.
Costello, Craig   +7 more
openaire   +4 more sources

Multikey Verifiable Homomorphic Encryption

open access: yesIEEE Access, 2022
A homomorphic encryption (HE) scheme is an advanced encryption technology which allows any user receiving ciphertexts to perform computations over them in a public manner. An important application of an HE scheme is a private delegating computation where
Yi Lu, Keisuke Hara, Keisuke Tanaka
doaj   +1 more source

Computable analysis for verified exact real computation [PDF]

open access: yesLeibniz International Proceedings in Informatics (LIPIcs), 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   +4 more sources

A Verifiable Access Control Scheme for Mobile Cloud Storage [PDF]

open access: yesJisuanji gongcheng, 2016
In order to meet the secure requirements of data sharing in mobile cloud storage environment,a verifiable access control scheme based on Ciphertext-policy Attribute-based Encryption(CP-ABE) is proposed from the aspects of data security access control and
WANG Qian,XIONG Shuming
doaj   +1 more source

A Fair, Verifiable and Privacy-Protecting Data Outsourcing Transaction Scheme Based on Smart Contracts

open access: yesIEEE Access, 2022
The continuous production of large-scale data makes data outsourcing computation a trend. In order to ensure that data outsourcing transaction is trusted and fair, it needs the supervision and judgment of a third party.
Lina Li   +4 more
doaj   +1 more source

Towards verified cloud computing environments [PDF]

open access: yes2012 International Conference on High Performance Computing & Simulation (HPCS), 2012
As the usage of the cloud becomes pervasive in our lives, it is needed to ensure the reliability, safety and security of cloud environments. In this paper we study a usual software stack of a cloud environment from the perspective of formal verification. This software stack ranges from applications to the hypervisor.
Loulergue, Frédéric   +3 more
openaire   +2 more sources

Computing and Verifying Depth Orders [PDF]

open access: yesSIAM Journal on Computing, 1992
Summary: A depth order on a set of line segments in 3-space is an order such that line segment \(a\) comes before line segment \(a'\) in the order when \(a\) lies below \(a'\) or, in other words, when there is a vertical ray that first intersects \(a'\) and then intersects \(a\). Efficient algorithms for the computation and verification of depth orders
DEBERG, M   +2 more
openaire   +5 more sources

Home - About - Disclaimer - Privacy