On multiplicative secret sharing schemes

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

doi:10.1007/10718964_28

On multiplicative secret sharing schemes

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

School of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-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 language	English
Title of host publication	Information Security and Privacy - 5th Australasian Conference, ACISP 2000, Proceedings
Publisher	Springer, Springer Nature
Pages	342-351
Number of pages	10
Volume	1841
ISBN (Print)	3540677429
DOIs	https://doi.org/10.1007/10718964_28
Publication status	Published - 2000
Event	5th Australasian Conference on Information Security and Privacy, ACISP 2000 - Brisbane, Australia Duration: 10 Jul 2000 → 12 Jul 2000

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1841
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Other

Other	5th Australasian Conference on Information Security and Privacy, ACISP 2000
Country/Territory	Australia
City	Brisbane
Period	10/07/00 → 12/07/00

Access to Document

10.1007/10718964_28

Cite this

Wang, H., Lam, K. Y., Xiao, G. Z., & Zhao, H. (2000). On multiplicative secret sharing schemes. In Information Security and Privacy - 5th Australasian Conference, ACISP 2000, Proceedings (Vol. 1841, pp. 342-351). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1841). Springer, Springer Nature. https://doi.org/10.1007/10718964_28

Wang, Huaxiong ; Lam, Kwok Yan ; Xiao, Guo Zhen et al. / On multiplicative secret sharing schemes. Information Security and Privacy - 5th Australasian Conference, ACISP 2000, Proceedings. Vol. 1841 Springer, Springer Nature, 2000. pp. 342-351 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{ffafbbf0ba28485e8c7fefefe8346641,

title = "On multiplicative secret sharing schemes",

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.",

author = "Huaxiong Wang and Lam, {Kwok Yan} and Xiao, {Guo Zhen} and Huanhui Zhao",

year = "2000",

doi = "10.1007/10718964_28",

language = "English",

isbn = "3540677429",

volume = "1841",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer, Springer Nature",

pages = "342--351",

booktitle = "Information Security and Privacy - 5th Australasian Conference, ACISP 2000, Proceedings",

address = "United States",

note = "5th Australasian Conference on Information Security and Privacy, ACISP 2000 ; Conference date: 10-07-2000 Through 12-07-2000",

}

Wang, H, Lam, KY, Xiao, GZ & Zhao, H 2000, On multiplicative secret sharing schemes. in Information Security and Privacy - 5th Australasian Conference, ACISP 2000, Proceedings. vol. 1841, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1841, Springer, Springer Nature, pp. 342-351, 5th Australasian Conference on Information Security and Privacy, ACISP 2000, Brisbane, Australia, 10/07/00. https://doi.org/10.1007/10718964_28

On multiplicative secret sharing schemes. / Wang, Huaxiong; Lam, Kwok Yan; Xiao, Guo Zhen et al.

Information Security and Privacy - 5th Australasian Conference, ACISP 2000, Proceedings. Vol. 1841 Springer, Springer Nature, 2000. p. 342-351 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1841).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - On multiplicative secret sharing schemes

AU - Wang, Huaxiong

AU - Lam, Kwok Yan

AU - Xiao, Guo Zhen

AU - Zhao, Huanhui

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84958978740&partnerID=8YFLogxK

U2 - 10.1007/10718964_28

DO - 10.1007/10718964_28

M3 - Conference proceeding contribution

AN - SCOPUS:84958978740

SN - 3540677429

VL - 1841

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 342

EP - 351

BT - Information Security and Privacy - 5th Australasian Conference, ACISP 2000, Proceedings

PB - Springer, Springer Nature

T2 - 5th Australasian Conference on Information Security and Privacy, ACISP 2000

Y2 - 10 July 2000 through 12 July 2000

ER -

Wang H, Lam KY, Xiao GZ, Zhao H. On multiplicative secret sharing schemes. In Information Security and Privacy - 5th Australasian Conference, ACISP 2000, Proceedings. Vol. 1841. Springer, Springer Nature. 2000. p. 342-351. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/10718964_28

On multiplicative secret sharing schemes

Abstract

Publication series

Other

Access to Document

Other files and links

Fingerprint

Cite this