access icon free Fair (t, n) threshold secret sharing scheme

In the setting of secret sharing, a group of parties wish to run a protocol for recovering the secret when they input their shares. The security requirement include privacy, correctness and others. One desirable property is fairness, which guarantees that if either party gets the secret, then the other party does too. However, basic secret sharing schemes, verifiable secret sharing schemes and publicly verifiable secret sharing schemes do not satisfy the fairness. Moreover, fairness is a central objective of the rational secret sharing scheme. In this work, the authors study the fairness problem of secret reconstruction in a (t, n) secret sharing scheme. They use a new approach to achieve the fairness of the protocol. They first define the fair notion of secret sharing probabilistically. Using the definition, a fair (t, n) secret sharing scheme is proposed, its security and fairness are shown against three different attack types. The proposed scheme is an extension of basic model of secret sharing (Shamir's scheme) and the approach of fairness of Dov Gordon et al.(STOC2008). Theoretical analysis shows that the proposed scheme is more efficient.

Inspec keywords: data privacy; cryptographic protocols

Other keywords: attack type; rational secret sharing scheme; fairness; secret reconstruction; secret recovery protocol; security requirement; correctness; Shamir scheme; publicly verifiable secret sharing scheme; privacy; fair (t, n) threshold secret sharing scheme

Subjects: Protocols; Data security; Cryptography; Cryptography theory

References

    1. 1)
      • 5. Stadler, M.: ‘Publicly verifiable secret sharing’. Advances in Cryptology – EUROCRYPT'96, 1996, 1070, pp. 190199.
    2. 2)
      • 21. Cleve, R.: ‘Limits on the security of coin flips when half the processors are faulty’. STOC1986, 1986, pp. 364369.
    3. 3)
      • 4. Feldman, P.: ‘A practical scheme for non-interactive verifiable secret sharing’. Proc. 28th IEEE Symp. on Foundations of Computer Science (FOCS'87), 1987, pp. 427437.
    4. 4)
      • 25. Lin, H.Y., Harn, L.: ‘Fair reconstruction of a secret’, Inf. Process. Lett., 1995, 55, pp. 4547 (doi: 10.1016/0020-0190(95)00045-E).
    5. 5)
      • 26. He, J., Dawson, E.: ‘How to fairly reconstruct a shared secret’. Proc. Int. Conf. Cryptography: Policy and Algorithms, 1995, pp. 115124.
    6. 6)
      • 11. Pedersen, T.P.: ‘Distributed provers and verifiable secret sharing based on the discrete logarithm problem’. PhD thesis, Aarhus University, Computer Science Department, Aarhus, Denmark, March1992.
    7. 7)
      • 15. Kol, G., Naor, M.: ‘Games for exchanging information’. STOC2008, 2008, pp. 423432.
    8. 8)
      • 1. Shamir, A.: ‘How to share a secret’, Commun. ACM, 1979, 22, (11), pp. 612613 (doi: 10.1145/359168.359176).
    9. 9)
      • 16. Maleka, S., Shareef, A., Pandu Rangan, C.: ‘Rational secret sharing with repeated games’. ISPEC2008, 2008(LNCS, 4991), pp. 334346.
    10. 10)
      • 7. Schoenmakers, B.: ‘A simple publicly verifiable secret sharing scheme and its application to Electronic Voting’. Advances in Cryptology – Crypto'99 Proc., 1999(LNCS, 1666), pp. 148164.
    11. 11)
      • 17. Fuchsbauer, G., Katz, J., Naccache, D.: ‘Efficient rational secret sharing in standard communication networks’. TCC2010, 2010(LNCS, 5978), pp. 419436.
    12. 12)
      • 12. Halpern, J., Teague, V.: ‘Rational secret sharing and multiparty computation: extended abstract’. STOC2004, 2004, pp. 623632.
    13. 13)
      • 3. Pedersen, T.P.: ‘Non-interactive and information-theoretic secure verifiable secret sharing’. Advances in Cryptology – CRYPTO'91, 1992, vol. 576, pp. 129140.
    14. 14)
      • 13. Dodis, Y., Rabin, T.: ‘Cryptography and game theory’, in Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (Eds.): ‘Algorithmic game theory’ (Cambridge University Press, 2007), pp. 181207.
    15. 15)
      • 28. Hwang, R.J., Chang, C.C.: ‘Enhancing the efficiency of (v, r, n)-fairness secret sharing scheme’. Proc. 18th Int. Conf. on Advanced Information Networking and Application (AINA2004), 2004, pp. 208211.
    16. 16)
      • 2. Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: ‘Verifiable secret sharing and achieving simultaneity in the presence of faults’. Proc. 26th IEEE Symp. on Foundations of Computer Sciences (FOCS'85), 1985, pp. 383395.
    17. 17)
      • 6. Fujisaki, E., Okamoto, T.: ‘A practical and provably secure scheme for publicly verifiable secret sharing and its applications’. Advances in Cryptology – EUROCRYPT'98, 1998, 1403, pp. 3246.
    18. 18)
      • 10. Blakley, G.R.: ‘Safeguarding cryptographic keys’. Proc. National Computer Conf., AFIPS, 1979, vol. 48, pp. 313317.
    19. 19)
      • 22. Dov Gordon, S., Hazay, C., Katz, J., Lindell, Y.: ‘Complete fairness in secure two-party computation’. STOC2008, 2008, pp. 413422.
    20. 20)
      • 8. Tian, Y.L., Peng, C.G., Zhang, R.P., Chen, Y.L.: ‘A practical publicly verifiable secret sharing scheme based on bilinear pairing’. Proc. Second Int. Conf. on Anti-counterfeiting, Security, and Identification (2008ASID), 2008, pp. 7175.
    21. 21)
      • 27. Lee, Y.C., Laih, C.S.: ‘A V-fairness (t, n) secret sharing scheme’, IEE Proc. Comput. Digit. Tech., 1997, 144, (1), pp. 2327 (doi: 10.1049/ip-cdt:19970821).
    22. 22)
      • 29. Ong, S.J., Parkes, D.C., Rosen, A., Vadhan, S.: ‘Fairness with an honest minority and a rational majority’. Proc. Fourth Theory of Cryptography Conf. (TCC2009), 2009, vol. 5444, pp. 3653.
    23. 23)
      • 23. Dov Gordon, S., Katz, J.: ‘Complete fairness in secure multi-party computation without an honest majority’. TCC2009, 2009, pp. 1935.
    24. 24)
      • 9. Harn, L., Lin, C.: ‘Detection and identification of cheaters in (t, n) secret sharing scheme’, Des. Codes Cryptogr., 2009, 52, (1), pp. 1524 (doi: 10.1007/s10623-008-9265-8).
    25. 25)
      • 19. Zhang, Z.F.: ‘Unconditionally secure rational secret sharing in standard communication networks’, http: //eprint.iacr.org/2010/462.
    26. 26)
      • 20. Tian, Y.L., Ma, J.F., Peng, C.G., et al: ‘One-time rational secret sharing scheme based on Bayesian game’, Wuhan Univ. J. Nat. Sci., 2011, 16, (5), pp. 430434 (doi: 10.1007/s11859-011-0775-2).
    27. 27)
      • 24. Tompa, M., Woll, H.: ‘How to share a secret with cheaters’, J. Cryptol., 1988, 1, (2), pp. 133138.
    28. 28)
      • 18. Zhang, Z.F.: ‘Rational secret sharing as extensive’, http://eprint.iacr.org/2010/184.
    29. 29)
      • 14. Katz, J.: ‘Bridging game theory and cryptography: recent results and future directions’. TCC2008, 2008(LNCS, 4948), pp. 251272.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-ifs.2012.0064
Loading

Related content

content/journals/10.1049/iet-ifs.2012.0064
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Comment
A comment has been published for this article:
Comments on ‘Fair (t, n) threshold secret sharing scheme’