On multiplicative secret sharing schemes

Huaxiong Wang, Kwok Yan Lam, Guo Zhen Xiao, Huanhui Zhao

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

2 Citations (Scopus)

Abstract

As known, multiplicative secret sharing schemes over Abe-lian groups play an important role in threshold cryptography, such as in threshold RSA signature schemes. In this paper we present a new approach for constructing multiplicative threshold schemes over finite Abelian groups, which generalises a scheme proposed by Blackburn, Bur-mester, Desmedt and Wild in Eurocrypt'96. Our method is based on a notion of multiple perfect hash families, which we introduce in this paper. We also give several constructions for multiple perfect hash families from resolvable BIBD, difference matrix and error-correcting code.

Original languageEnglish
Title of host publicationInformation Security and Privacy - 5th Australasian Conference, ACISP 2000, Proceedings
PublisherSpringer, Springer Nature
Pages342-351
Number of pages10
Volume1841
ISBN (Print)3540677429
DOIs
Publication statusPublished - 2000
Event5th Australasian Conference on Information Security and Privacy, ACISP 2000 - Brisbane, Australia
Duration: 10 Jul 200012 Jul 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1841
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other5th Australasian Conference on Information Security and Privacy, ACISP 2000
CountryAustralia
CityBrisbane
Period10/07/0012/07/00

Fingerprint Dive into the research topics of 'On multiplicative secret sharing schemes'. Together they form a unique fingerprint.

Cite this