Efficient, XOR-based, Ideal (t; n)-threshold Schemes. / Chen, Liqun; Laing, Thalia; Martin, Keith.

Proceedings of 15th International Conference on Cryptology and Network Security (CANS 2016). Vol. 10052 Springer, 2016. p. 467-483 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceedingChapter

E-pub ahead of print

Documents

Links

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 languageEnglish
Title of host publicationProceedings of 15th International Conference on Cryptology and Network Security (CANS 2016)
PublisherSpringer
Pages467-483
Number of pages17
Volume10052
ISBN (Electronic)978-3-319-48965-0
ISBN (Print)978-3-319-48964-3
DOIs
StateE-pub ahead of print - 28 Oct 2016

Publication series

NameLecture Notes in Computer Science
This open access research output is licenced under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.

ID: 26941891