University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Efficient, XOR-based ideal (t, n)-threshold schemes

Chen, Liqun, Laing, T and Martin, KM (2016) Efficient, XOR-based ideal (t, n)-threshold schemes In: 15th International Conference on Cryptography and Network Security (CANS 2016), 2016-11-14 - 2016-11-16, Milan, Italy.

CANS.pdf - Accepted version Manuscript
Available under License : See the attached licence file.

Download (392kB) | Preview
Text (licence)
Available under License : See the attached licence file.

Download (33kB) | Preview


We propose a new, lightweight (t; n) threshold secret shar- ing 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 im- proves 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 e ciency analysis. We compare our scheme to existing schemes in the literature and show that our scheme is more e cient than other schemes, especially when t is large.

Item Type: Conference or Workshop Item (Conference Paper)
Subjects : Computer Science
Divisions : Faculty of Engineering and Physical Sciences > Computing Science
Authors :
Laing, T
Martin, KM
Date : November 2016
DOI : 10.1007/978-3-319-48965-0
Copyright Disclaimer : The final publication is available at
Contributors :
Uncontrolled Keywords : threshold, secret sharing, perfect, e cient, ideal, error correction
Related URLs :
Depositing User : Symplectic Elements
Date Deposited : 04 Apr 2017 13:41
Last Modified : 16 Jan 2019 17:13

Actions (login required)

View Item View Item


Downloads per month over past year

Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800