Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes

DOI10.1007/978-3-540-89255-7_2zbMath1172.94607OpenAlexW1556393797MaRDI QIDQ3600362

Zhifang Zhang, Yeow Meng Chee, Huaxiong Wang, San Ling, Mu-Lan Liu

Publication date: 10 February 2009

Published in: Advances in Cryptology - ASIACRYPT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89255-7_2

zbMATH Keywords

secure multi-party computationmonotone span programstrongly multiplicative linear secret sharing scheme

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

On \(d\)-multiplicative secret sharing ⋮ Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures

Cites Work

• Unnamed Item
• Unnamed Item
• Multiplicative Linear Secret Sharing Schemes Based on Connectivity of Graphs
• A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra
• Strongly Multiplicative Hierarchical Threshold Secret Sharing
• Progress in Cryptology - INDOCRYPT 2003
• On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
• Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves
• Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields

This page was built for publication: Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes