### Fair and Sound Secret Sharing from Homomorphic Time-Lock Puzzles

Jodie Knapp and Elizabeth A. Quaglia

##### Abstract

Achieving fairness and soundness in non-simultaneous rational secret sharing schemes has proved to be challenging. On the one hand, soundness can be ensured by providing side information related to the secret as a check, but on the other, this can be used by deviant players to compromise fairness. To overcome this, the idea of incorporating a time delay was suggested in the literature: in particular, time-delay encryption based on memory-bound functions has been put forth as a solution. In this paper, we propose a different approach to achieve such delay, namely using homomorphic time-lock puzzles (HTLPs), introduced at CRYPTO 2019, and construct a fair and sound rational secret sharing scheme in the non-simultaneous setting from HTLPs. HTLPs are used to embed sub-shares of the secret for a predetermined time. This allows to restore fairness of the secret reconstruction phase, despite players having access to information related to the secret which is required to ensure soundness of the scheme. Key to our construction is the fact that the time-lock puzzles are homomorphic so that players can compactly evaluate sub-shares. Without this efficiency improvement, players would have to independently solve each puzzle sent from the other players to obtain a share of the secret, which would be computationally inefficient. We argue that achieving both fairness and soundness in a non-simultaneous scheme using a time delay based on CPU-bound functions rather than memory-bound functions is more cost effective and realistic in relation to the implementation of the construction.

Note: This work is partly supported by the EPSRC and the UK government as part of the Centre for Doctoral Training in Cyber Security at Royal Holloway, University of London (EP/P009301/1).

Available format(s)
Category
Cryptographic protocols
Publication info
Published elsewhere. MAJOR revision.The 14th International Conference on Provable and Practical Security (ProvSec 2020)
Keywords
secret sharingfair exchangethreshold cryptographytime-lock puzzles
Contact author(s)
jodie knapp 2018 @ rhul ac uk
elizabeth quaglia @ rhul ac uk
History
2020-09-17: revised
See all versions
Short URL
https://ia.cr/2020/1078

CC BY

BibTeX

@misc{cryptoeprint:2020/1078,
author = {Jodie Knapp and Elizabeth A.  Quaglia},
title = {Fair and Sound Secret Sharing from Homomorphic Time-Lock Puzzles},
howpublished = {Cryptology ePrint Archive, Paper 2020/1078},
year = {2020},
note = {\url{https://eprint.iacr.org/2020/1078}},
url = {https://eprint.iacr.org/2020/1078}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.