Welcome to the resource topic for 2005/337
Title:
Statistical Multiparty Computation Based on Random Walks on Graphs
Authors: Liangliang Xiao, Mulan Liu, Zhifang Zhang
Abstract:With respect to a special class of access structures based on connectivity of graphs, we start from a linear secret sharing scheme
and turn it into a secret sharing scheme with perfect security and exponentially small error probability by randomizing the
reconstruction algorithm through random walks on graphs. It reduces the polynomial work space to logarithmic. Then we build the corresponding statistical multiparty computation protocol by using the secret sharing scheme. The results of this paper also imply the inherent connections and influences among secret sharing, randomized algorithms, and secure multi-party computation.
ePrint: https://eprint.iacr.org/2005/337
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .