Results 51 to 60 of about 2,887,711 (311)

Permissionless Blockchain Systems as Pseudo-Random Number Generators for Decentralized Consensus

open access: yesIEEE Access, 2023
Consensus algorithms that function in permissionless blockchain systems must randomly select new block proposers in a decentralised environment. Our contribution is a new blockchain consensus algorithm called Proof-of-Publicly Verifiable Randomness ...
Riaan Bezuidenhout   +2 more
doaj   +1 more source

Universally verifiable multiparty computation from threshold homomorphic cryptosystems [PDF]

open access: yes, 2015
Multiparty computation can be used for privacy-friendly outsourcing of computations on private inputs of multiple parties. A computation is outsourced to several computation parties; if not too many are corrupted (e.g., no more than half), then they ...
Schoenmakers, B.; id_orcid   +1 more
core   +2 more sources

Enhancing Privacy Preservation in Verifiable Computation through Random Permutation Masking to Prevent Leakage

open access: yesInformation, 2023
Outsourcing computation has become increasingly popular due to its cost-effectiveness, enabling users with limited resources to conduct large-scale computations on potentially untrusted cloud platforms. In order to safeguard privacy, verifiable computing
Yang Yang, Guanghua Song
doaj   +1 more source

Verifying spatial properties of array computations [PDF]

open access: yesProceedings 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

Practical and Provably Secure Distributed Aggregation: Verifiable Additive Homomorphic Secret Sharing

open access: yesCryptography, 2020
Often clients (e.g., sensors, organizations) need to outsource joint computations that are based on some joint inputs to external untrusted servers.
Georgia Tsaloli   +2 more
doaj   +1 more source

Verifiable secure computation of linear fractional programming using certificate validation

open access: yes, 2020
Outsourcing of scientific computations is attracting increasing attention since it enables the customers with limited computing resource and storage devices to outsource the sophisticated computation workloads into powerful service providers. However, it
Sultan, Laman R.   +7 more
core   +1 more source

How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption [PDF]

open access: yes, 2011
The wide variety of small, computationally weak devices, and the growing number of computationally intensive tasks makes the delegation of computation to large data centers a desirable solution.
Bryan Parno   +2 more
core   +1 more source

BV-ICVs: A privacy-preserving and verifiable federated learning framework for V2X environments using blockchain and zkSNARKs

open access: yesJournal of King Saud University: Computer and Information Sciences, 2023
As part of vehicle to everything (V2X) environments, intelligent connected vehicles (ICVs) generate a large amount of data, which can be exploited securely and effectively through decentralized techniques such as federated learning (FL).
Abla Smahi   +6 more
doaj   +1 more source

Fast, Verified Computation for Candle.

open access: yes, 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]

open access: yesExperimental 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

Home - About - Disclaimer - Privacy