How to fairly reconstruct a shared secret

  • Jingmin He
  • Ed Dawson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1029)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    D.Beaver and S.Goldwasser, Multiparty computation with faulty majority, FOCS89, pp.468–473.Google Scholar
  2. [2]
    J.C.Benaloh and J.Leichter, Generalized secret sharing and monotone functions, CRYPTO'88, pp.27–35.Google Scholar
  3. [3]
    G.R.Blakley, Safeguarding cryptographic keys, Proc. AFIPS 1979 Natl. Computer Conf., vol. 48, 1979, pp 313–317.Google Scholar
  4. [4]
    E.F.Brickell and D.R.Stinson, The detection of cheaters in threshold schemes, Crypto'88, pp 564–577.Google Scholar
  5. [5]
    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.Google Scholar
  6. [6]
    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.Google Scholar
  7. [7]
    S.Goldwasser and L.Levin, Fair computation of general functions in presence of immoral majority, CRYPTO' 90, pp.77–93.Google Scholar
  8. [8]
    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.Google Scholar
  9. [9]
    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.Google Scholar
  10. [10]
    T.Rabin and M.Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority, STOC 89, pp 73–85.Google Scholar
  11. [11]
    A.Renyi, Probability Theory, North-Holland Publishing Company, Amsterdam, 1970.Google Scholar
  12. [12]
    A.Shamir, How to share a secret, CACM, vol. 22, no.11, 1979, pp 612–613.Google Scholar
  13. [13]
    T.Tedrick, How to exchange half a bit, Crypto'83, pp 147–151.Google Scholar
  14. [14]
    T.Tedrick, Fair exchange of secrets, Crypto'84, pp 434–438.Google Scholar
  15. [15]
    M.Tompa and H.Woll, How to share a secret with cheaters, Crypto'86, pp 133–138.Google Scholar
  16. [16]
    U.Vazirani and V.Vazirani, Trapdoor pseudo-random number generators with applications to protocol design, FOCS 83, pp.23–30.Google Scholar
  17. [17]
    A.Yao, How to generate and exchange secrets, FOCS 86, pp.162–167.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Jingmin He
    • 1
  • Ed Dawson
    • 1
  1. 1.Information Security Research CenterQueensland University of TechnologyBrisbaneAustralia

Personalised recommendations