Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes

Simple item page
dc.creatorZhang, Zhifang
dc.creatorLiu, Mulan
dc.creatorChee, Yeow Meng
dc.creatorLing, San
dc.creatorWang, Huaxiong
dc.date2008-12-13
dc.date.accessioned2026-07-07T12:12:40Z
dc.date.available2026-07-07T12:12:40Z
dc.descriptionStrongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multiparty computation protocols. However, it remains open whether or not there exist efficient constructions of strongly multiplicative LSSS from general LSSS. In this paper, we propose the new concept of a 3-multiplicative LSSS, and establish its relationship with strongly multiplicative LSSS. More precisely, we show that any 3-multiplicative LSSS is a strongly multiplicative LSSS, but the converse is not true; and that any strongly multiplicative LSSS can be efficiently converted into a 3-multiplicative LSSS. Furthermore, we apply 3-multiplicative LSSS to the computation of unbounded fan-in multiplication, which reduces its round complexity to four (from five of the previous protocol based on strongly multiplicative LSSS). We also give two constructions of 3-multiplicative LSSS from Reed-Muller codes and algebraic geometric codes. We believe that the construction and verification of 3-multiplicative LSSS are easier than those of strongly multiplicative LSSS. This presents a step forward in settling the open problem of efficient constructions of strongly multiplicative LSSS from general LSSS.
dc.description18 pages
dc.identifierhttps://arxiv.org/abs/0812.2518
dc.identifierhttp://arxiv.org/abs/0812.2518
dc.identifierAdvances in Cryptology - Asiacrypt 2008, vol. 5350 of Lecture Notes in Computer Science, pp. 19-36, Springer-Verlag, 2008
dc.identifierdoi:10.1007/978-3-540-89255-7
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/210617
dc.subjectCryptography and Security
dc.titleStrongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
dc.typetext

Files

Collections

arXiv