Paper 2005/143

Multiparty Computation Based on Connectivity of Graphs

Liangliang Xiao, Mulan Liu, and Zhifang Zhang

Abstract

In this paper, we contribute the construction of practical perfect multiparty computation protocols based on the connectivity of graphs.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Keywords
Multiparty computationLinear secret sharing schemeMonotone span program
Contact author(s)
mlliu @ amss ac cn
History
2005-05-19: received
Short URL
https://ia.cr/2005/143
License
Creative Commons Attribution
CC BY

BibTeX 

@misc{cryptoeprint:2005/143,
      author = {Liangliang Xiao and Mulan Liu and Zhifang Zhang},
      title = {Multiparty Computation Based on Connectivity of Graphs},
      howpublished = {Cryptology {ePrint} Archive, Paper 2005/143},
      year = {2005},
      url = {https://eprint.iacr.org/2005/143}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.