Efficient, XOR-Based, Ideal   (t,n)− threshold Schemes

Liqun Chen; Thalia Laing; Keith Martin

doi:10.1007/978-3-319-48965-0_28

Efficient, XOR-Based, Ideal (t,n)− threshold Schemes

Liqun Chen, Thalia Laing, Keith Martin

Research output: Chapter in Book/Report/Conference proceeding › Chapter

293 Downloads (Pure)

Abstract

We propose a new, lightweight (t,n)−(t,n)− threshold secret sharing scheme that can be implemented using only XOR operations. Our scheme is based on an idea extracted from a patent application by Hewlett Packard that utilises error correction codes. Our scheme improves on the patent by requiring fewer randomly generated bits and by reducing the size of shares given to each player, thereby making the scheme ideal. We provide a security proof and efficiency analysis. We compare our scheme to existing schemes in the literature and show that our scheme is more efficient than other schemes, especially when t is large.

Original language	English
Title of host publication	Proceedings of 15th International Conference on Cryptology and Network Security (CANS 2016)
Publisher	Springer
Pages	467-483
Number of pages	17
Volume	10052
ISBN (Electronic)	978-3-319-48965-0
ISBN (Print)	978-3-319-48964-3
DOIs	https://doi.org/10.1007/978-3-319-48965-0_28
Publication status	E-pub ahead of print - 28 Oct 2016

Publication series

Name	Lecture Notes in Computer Science
Volume	10052

Access to Document

10.1007/978-3-319-48965-0_28

Accepted ManuscriptAccepted author manuscript, 383 KB

http://link.springer.com/chapter/10.1007%2F978-3-319-48965-0_28#Sec11

Cite this

@inbook{4d90c9e290504d7cac8eb76698bc3147,

title = "Efficient, XOR-Based, Ideal (t,n)− threshold Schemes",

abstract = "We propose a new, lightweight (t,n)−(t,n)− threshold secret sharing scheme that can be implemented using only XOR operations. Our scheme is based on an idea extracted from a patent application by Hewlett Packard that utilises error correction codes. Our scheme improves on the patent by requiring fewer randomly generated bits and by reducing the size of shares given to each player, thereby making the scheme ideal. We provide a security proof and efficiency analysis. We compare our scheme to existing schemes in the literature and show that our scheme is more efficient than other schemes, especially when t is large.",

author = "Liqun Chen and Thalia Laing and Keith Martin",

year = "2016",

month = oct,

day = "28",

doi = "10.1007/978-3-319-48965-0_28",

language = "English",

isbn = "978-3-319-48964-3",

volume = "10052",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "467--483",

booktitle = "Proceedings of 15th International Conference on Cryptology and Network Security (CANS 2016)",

}

TY - CHAP

T1 - Efficient, XOR-Based, Ideal (t,n)− threshold Schemes

AU - Chen, Liqun

AU - Laing, Thalia

AU - Martin, Keith

PY - 2016/10/28

Y1 - 2016/10/28

N2 - We propose a new, lightweight (t,n)−(t,n)− threshold secret sharing scheme that can be implemented using only XOR operations. Our scheme is based on an idea extracted from a patent application by Hewlett Packard that utilises error correction codes. Our scheme improves on the patent by requiring fewer randomly generated bits and by reducing the size of shares given to each player, thereby making the scheme ideal. We provide a security proof and efficiency analysis. We compare our scheme to existing schemes in the literature and show that our scheme is more efficient than other schemes, especially when t is large.

AB - We propose a new, lightweight (t,n)−(t,n)− threshold secret sharing scheme that can be implemented using only XOR operations. Our scheme is based on an idea extracted from a patent application by Hewlett Packard that utilises error correction codes. Our scheme improves on the patent by requiring fewer randomly generated bits and by reducing the size of shares given to each player, thereby making the scheme ideal. We provide a security proof and efficiency analysis. We compare our scheme to existing schemes in the literature and show that our scheme is more efficient than other schemes, especially when t is large.

U2 - 10.1007/978-3-319-48965-0_28

DO - 10.1007/978-3-319-48965-0_28

M3 - Chapter

SN - 978-3-319-48964-3

VL - 10052

T3 - Lecture Notes in Computer Science

SP - 467

EP - 483

BT - Proceedings of 15th International Conference on Cryptology and Network Security (CANS 2016)

PB - Springer

ER -