Verifiable computation allows a client to outsource computations to a worker with a cryptographic proof of correctness of the result that can be verified faster than performing the computation. Recently, the Pinocchio system achieved faster verification than computation in practice for the first time. Unfortunately, Pinocchio and other efficient verifiable computation systems require the client...

transforming methodology from deduction to induction and finally its generalization from the realm of nature studies to the scope of human being one by a positivistic presupposition has led to modern humanities which have a charge to study human beings nature and behaviors scientifically. the main goal of the article is to show theoretical and practical insufficiency of this method in an islami...

Mixnets are one of the main approaches to deploy secret and verifiable electronic elections. General-purpose verifiable mixnets however suffer from the drawback that the amount of data to be verified by observers increases linearly with the number of involved mix nodes, the number of decryptors, and the number of voters. Chase et al. proposed a verifiable mixnet at Eurocrypt 2012 based on so-ca...

The proposed approach works for any underlying secret sharing scheme. It is based on the concept of verification sets of participants, related to authorized set of participants. The participants interact (no third party involved) in order to check validity of their shares before they are pooled for secret recovery. Verification efficiency does not depend on the number of faulty participants.

A publicly verifiable secret sharing (PVSS) scheme is a verifiable secret sharing scheme with the property that the validity of the shares distributed by the dealer can be verified by any party; hence verification is not limited to the respective participants receiving the shares. We present a new construction for PVSS schemes, which compared to previous solutions by Stadler and later by Fujisa...

Verifiable secret sharing (VSS) schemes [1–3] rely on the assumption that parties can not reliably fabricate false secret shares which pass the verification process. Here, we show that, for certain VSS implementations that use verification commitments bounded to a finite field, this assumption is incorrect. Let there be n shares of a secret and a threshold of t secret shares required to get the...

Threshold secret sharing schemes are used to divide a given secret by a dealer in parts such that no less than the threshold number of shareholders can reconstruct the secret. However, these schemes are susceptible to the malicious behavior of a shareholder or a dealer. To prevent such attacks, it is necessary to make a provision for verification of the integrity of the shares distributed by th...