Abstract
In this paper we consider the secret reconstruction problem in a secret sharing scheme. We show how to use a slowly-information-revealing process to achieve a fair reconstruction of a shared secret. We give a detailed analysis on the advantage cheaters could gain in such a process.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D.Beaver and S.Goldwasser, Multiparty computation with faulty majority, FOCS89, pp.468–473.
J.C.Benaloh and J.Leichter, Generalized secret sharing and monotone functions, CRYPTO'88, pp.27–35.
G.R.Blakley, Safeguarding cryptographic keys, Proc. AFIPS 1979 Natl. Computer Conf., vol. 48, 1979, pp 313–317.
E.F.Brickell and D.R.Stinson, The detection of cheaters in threshold schemes, Crypto'88, pp 564–577.
D.Chaum, I.Damgard and J.van de Graaf, Multiparty computations ensuring privacy of each party's input and correctness of the result, CRYPTO'87, pp.87–119.
B.Chor, S.Goldwasser, S.Micali and B.Awerbuch, Verifiable secret sharing and achieving simultaneity in the presence of faults, FOCS 85, pp 383–395.
S.Goldwasser and L.Levin, Fair computation of general functions in presence of immoral majority, CRYPTO' 90, pp.77–93.
M.Ito, A.Saito and T.Nishizeki, Secret sharing scheme realizing general access structure, Proc. IEEE Global Telecommunications Conf., Globecom 87, Tokyo, Japan, 1987, pp.99–102.
M.Luby, S.Micali and C.Rackoff, How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin, FOCS 83, pp 11–21.
T.Rabin and M.Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority, STOC 89, pp 73–85.
A.Renyi, Probability Theory, North-Holland Publishing Company, Amsterdam, 1970.
A.Shamir, How to share a secret, CACM, vol. 22, no.11, 1979, pp 612–613.
T.Tedrick, How to exchange half a bit, Crypto'83, pp 147–151.
T.Tedrick, Fair exchange of secrets, Crypto'84, pp 434–438.
M.Tompa and H.Woll, How to share a secret with cheaters, Crypto'86, pp 133–138.
U.Vazirani and V.Vazirani, Trapdoor pseudo-random number generators with applications to protocol design, FOCS 83, pp.23–30.
A.Yao, How to generate and exchange secrets, FOCS 86, pp.162–167.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, J., Dawson, E. (1996). How to fairly reconstruct a shared secret. In: Dawson, E., Golić, J. (eds) Cryptography: Policy and Algorithms. CPA 1995. Lecture Notes in Computer Science, vol 1029. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032351
Download citation
DOI: https://doi.org/10.1007/BFb0032351
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60759-5
Online ISBN: 978-3-540-49363-1
eBook Packages: Springer Book Archive