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.
|Title of host publication
|Proceedings of 15th International Conference on Cryptology and Network Security (CANS 2016)
|Number of pages
|E-pub ahead of print - 28 Oct 2016
|Lecture Notes in Computer Science