On construction of cumulative secret sharing schemes

Hossein Ghodosi; Josef Pieprzyk; Rei Safavi-Naini; Huaxiong Wang

doi:10.1007/BFb0053749

On construction of cumulative secret sharing schemes

Hossein Ghodosi, Josef Pieprzyk, Rei Safavi-Naini, Huaxiong Wang

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

4 Citations (Scopus)

Abstract

Secret sharing schemes are one of the most important primitives in distributed systems. Cumulative secret sharing schemes provide a method to share a secret among a number of participants with arbitrary access structures. This paper presents two different methods for constructing cumulative secret sharing schemes. The first method produces a simple and efficient cumulative scheme. The second method provides a cheater identifiable cumulative scheme. Both proposed schemes are perfect.

Original language	English
Title of host publication	Information Security and Privacy
Subtitle of host publication	Third Australasian Conference, ACISP’98 Brisbane, Australia, July 13–15, 1998 Proceedings
Editors	Colin Boyd, Ed Dawson
Place of Publication	Berlin; New york
Publisher	Springer, Springer Nature
Pages	379-390
Number of pages	12
ISBN (Electronic)	9783540691013
ISBN (Print)	3540647325, 9783540647324
DOIs	https://doi.org/10.1007/BFb0053749
Publication status	Published - Jul 1998
Externally published	Yes
Event	3rd Australasian Conference on Information Security and Privacy, ACISP - 1998 - Brisbane, Australia Duration: 13 Jul 1998 → 15 Jul 1998

Publication series

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

Other

Other	3rd Australasian Conference on Information Security and Privacy, ACISP - 1998
Country/Territory	Australia
City	Brisbane
Period	13/07/98 → 15/07/98

Access to Document

10.1007/BFb0053749

Cite this

Ghodosi, H., Pieprzyk, J., Safavi-Naini, R., & Wang, H. (1998). On construction of cumulative secret sharing schemes. In C. Boyd, & E. Dawson (Eds.), Information Security and Privacy: Third Australasian Conference, ACISP’98 Brisbane, Australia, July 13–15, 1998 Proceedings (pp. 379-390). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1438). Springer, Springer Nature. https://doi.org/10.1007/BFb0053749

Ghodosi, Hossein ; Pieprzyk, Josef ; Safavi-Naini, Rei et al. / On construction of cumulative secret sharing schemes. Information Security and Privacy: Third Australasian Conference, ACISP’98 Brisbane, Australia, July 13–15, 1998 Proceedings. editor / Colin Boyd ; Ed Dawson. Berlin; New york : Springer, Springer Nature, 1998. pp. 379-390 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{e7ae1e7337ce40a6a19df7f8028cebf4,

title = "On construction of cumulative secret sharing schemes",

abstract = "Secret sharing schemes are one of the most important primitives in distributed systems. Cumulative secret sharing schemes provide a method to share a secret among a number of participants with arbitrary access structures. This paper presents two different methods for constructing cumulative secret sharing schemes. The first method produces a simple and efficient cumulative scheme. The second method provides a cheater identifiable cumulative scheme. Both proposed schemes are perfect.",

author = "Hossein Ghodosi and Josef Pieprzyk and Rei Safavi-Naini and Huaxiong Wang",

year = "1998",

month = jul,

doi = "10.1007/BFb0053749",

language = "English",

isbn = "3540647325",

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

publisher = "Springer, Springer Nature",

pages = "379--390",

editor = "Colin Boyd and Ed Dawson",

booktitle = "Information Security and Privacy",

address = "United States",

note = "3rd Australasian Conference on Information Security and Privacy, ACISP - 1998 ; Conference date: 13-07-1998 Through 15-07-1998",

}

Ghodosi, H, Pieprzyk, J, Safavi-Naini, R & Wang, H 1998, On construction of cumulative secret sharing schemes. in C Boyd & E Dawson (eds), Information Security and Privacy: Third Australasian Conference, ACISP’98 Brisbane, Australia, July 13–15, 1998 Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1438, Springer, Springer Nature, Berlin; New york, pp. 379-390, 3rd Australasian Conference on Information Security and Privacy, ACISP - 1998, Brisbane, Queensland, Australia, 13/07/98. https://doi.org/10.1007/BFb0053749

On construction of cumulative secret sharing schemes. / Ghodosi, Hossein; Pieprzyk, Josef; Safavi-Naini, Rei et al.
Information Security and Privacy: Third Australasian Conference, ACISP’98 Brisbane, Australia, July 13–15, 1998 Proceedings. ed. / Colin Boyd; Ed Dawson. Berlin; New york: Springer, Springer Nature, 1998. p. 379-390 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1438).

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

TY - GEN

T1 - On construction of cumulative secret sharing schemes

AU - Ghodosi, Hossein

AU - Pieprzyk, Josef

AU - Safavi-Naini, Rei

AU - Wang, Huaxiong

PY - 1998/7

Y1 - 1998/7

N2 - Secret sharing schemes are one of the most important primitives in distributed systems. Cumulative secret sharing schemes provide a method to share a secret among a number of participants with arbitrary access structures. This paper presents two different methods for constructing cumulative secret sharing schemes. The first method produces a simple and efficient cumulative scheme. The second method provides a cheater identifiable cumulative scheme. Both proposed schemes are perfect.

AB - Secret sharing schemes are one of the most important primitives in distributed systems. Cumulative secret sharing schemes provide a method to share a secret among a number of participants with arbitrary access structures. This paper presents two different methods for constructing cumulative secret sharing schemes. The first method produces a simple and efficient cumulative scheme. The second method provides a cheater identifiable cumulative scheme. Both proposed schemes are perfect.

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

U2 - 10.1007/BFb0053749

DO - 10.1007/BFb0053749

M3 - Conference proceeding contribution

AN - SCOPUS:0008192443

SN - 3540647325

SN - 9783540647324

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

SP - 379

EP - 390

BT - Information Security and Privacy

A2 - Boyd, Colin

A2 - Dawson, Ed

PB - Springer, Springer Nature

CY - Berlin; New york

T2 - 3rd Australasian Conference on Information Security and Privacy, ACISP - 1998

Y2 - 13 July 1998 through 15 July 1998

ER -

Ghodosi H, Pieprzyk J, Safavi-Naini R, Wang H. On construction of cumulative secret sharing schemes. In Boyd C, Dawson E, editors, Information Security and Privacy: Third Australasian Conference, ACISP’98 Brisbane, Australia, July 13–15, 1998 Proceedings. Berlin; New york: Springer, Springer Nature. 1998. p. 379-390. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/BFb0053749

On construction of cumulative secret sharing schemes

Abstract

Publication series

Other

Access to Document

Other files and links

Fingerprint

Cite this