CryptoDB

Paper: Statistical Multiparty Computation Based on Random Walks on Graphs

Authors: Liangliang Xiao Mulan Liu Zhifang Zhang URL: http://eprint.iacr.org/2005/337 Search ePrint Search Google 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.
BibTeX
@misc{eprint-2005-12671,
title={Statistical Multiparty Computation Based on Random Walks on Graphs},
booktitle={IACR Eprint archive},
keywords={cryptographic protocols / secret sharing, distributed cryptography},
url={http://eprint.iacr.org/2005/337},
note={ mlliu@amss.ac.cn, zfz@amss.ac.cn 13045 received 19 Sep 2005},
author={Liangliang Xiao and Mulan Liu and Zhifang Zhang},
year=2005
}