Verifiable Secret Sharing as Secure Computation
نویسندگان
چکیده
We present a stronger notion of veriiable secret sharing and exhibit a protocol implementing it. We show that our new notion is preferable to the old ones whenever veriiable secret sharing is used as a tool within larger protocols, rather than being a goal in itself.
منابع مشابه
An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملAn Efficient Secret Sharing-based Storage System for Cloud-based Internet of Things
Internet of things (IoTs) is the newfound information architecture based on the internet that develops interactions between objects and services in a secure and reliable environment. As the availability of many smart devices rises, secure and scalable mass storage systems for aggregate data is required in IoTs applications. In this paper, we propose a new method for storing aggregate data in Io...
متن کاملTolerating Generalized Mobile Adversaries in Secure Multiparty Computation
We study a distributed adversarial model of computation in which the faults are non-stationary and can move through the network (like viruses) as well as non-threshold (there is no specific bound on the number of corrupted players at any given time). We show how to construct multiparty protocols that are perfectly secure against such generalized mobile adversaries. The key element in our soluti...
متن کاملAn efficient threshold verifiable multi-secret sharing
In 2004, C.-C. Yang, T.-Y. Chang and M.-S. Hwang proposed an efficient multi-secret sharing scheme based on two-variable one-way function and Shamir's secret sharing. In order to add the verifiable property into previous scheme, J. Shao and Z. Cao proposed an efficient (t,n) verifiable multi-secret sharing based on YCH [C.-C. Yang, T.-Y. Chang, M.-S. Hwang, A (t,n) multi-secret sharing scheme, ...
متن کاملMultiparty Computation, an Introduction
These lecture notes introduce the notion of secure multiparty computation. We introduce some concepts necessary to define what it means for a multiparty protocol to be secure, and survey some known general results that describe when secure multiparty computation is possible. We then look at some general techniques for building secure multiparty protocols, including protocols for commitment and ...
متن کامل