Cryptology ePrint Archive: Report 2005/337

Statistical Multiparty Computation Based on Random Walks on Graphs

Liangliang Xiao, Mulan Liu, and 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.

Category / Keywords: cryptographic protocols / secret sharing, distributed cryptography

Date: received 19 Sep 2005

Contact author: mlliu at amss ac cn, zfz@amss ac cn

Available format(s): PDF | BibTeX Citation

Version: 20050927:145707 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]