Results 41 to 50 of about 38,058 (157)

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

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

Publicly Verifiable Multi-stage Secret Sharing on General Access Structures [PDF]

open access: yesJisuanji kexue yu tansuo, 2023
A publicly verifiable secret sharing allows anyone to detect the cheating of dealer or participants only from the public information. In order to expand the application scope of multi-secret sharing, firstly, a publicly verifiable multi-stage secret ...
SONG Yun, WANG Ningning, XIAO Menglin, SHAO Zhiyi
doaj   +1 more source

Multi-party Quantum Computation [PDF]

open access: yes, 2001
We investigate definitions of and protocols for multi-party quantum computing in the scenario where the secret data are quantum systems. We work in the quantum information-theoretic model, where no assumptions are made on the computational power of the ...
Smith, Adam
core   +4 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

Verified Computation with Probabilities [PDF]

open access: yes, 2012
Because machine calculations are prone to errors that can sometimes accumulate disastrously, computer scientists use special strategies called verified computation to ensure output is reliable. Such strategies are needed for computing with probability distributions.
Ferson, Scott, Siegrist, Jack
openaire   +2 more sources

Generalising KAT to Verify Weighted Computations [PDF]

open access: yesScientific Annals of Computer Science, 2019
Kleene algebra with tests (KAT) was introduced as an algebraic structure to model and reason about classic imperative programs, i.e. sequences of discrete transitions guarded by Boolean tests. This paper introduces two generalisations of this structure able to express programs as weighted transitions and tests with outcomes in non necessarily bivalent ...
Leandro Gomes   +2 more
openaire   +5 more sources

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

Streaming Verification of Graph Computations via Graph Structure [PDF]

open access: yes, 2019
We give new algorithms in the annotated data streaming setting - also known as verifiable data stream computation - for certain graph problems. This setting is meant to model outsourced computation, where a space-bounded verifier limited to sequential ...
Chakrabarti, Amit, Ghosh, Prantar
core   +1 more source

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
Hoffman, N.   +5 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy