Advertisement

How to Compartment Secrets

Trust Everybody, but Cut the Cards
  • Gaëlle Candel
  • Rémi Géraud-StewartEmail author
  • David Naccache
Conference paper
  • 63 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 12024)

Abstract

Secret sharing splits a secret s into \(\ell \) shares in such a way that \(k\le \ell \) shares suffice to reconstruct s. Let \(\rho _{i,j}\) be the probability that shareholder i disclose their share to shareholder j, with \(0 \le i,j < n\).

Given \(k \le \ell \le n\), to whom \(\ell \) individuals should we hand shares, if we wish to minimize the probability that one of them reconstitutes s?

Supplementary material

References

  1. [BDIR18]
    Benhamouda, F., Degwekar, A., Ishai, Y., Rabin, T.: On the local leakage resilience of linear secret sharing schemes. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 531–561. Springer, Cham (2018).  https://doi.org/10.1007/978-3-319-96884-1_18CrossRefGoogle Scholar
  2. [Bla79]
    Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference, vol. 48, (1979)Google Scholar
  3. [DD94]
    Dawson, Ed., Donovan, D.M.: The breadth of Shamir’s secret-sharing scheme. Comput. Secur. 13(1), 69–78 (1994)CrossRefGoogle Scholar
  4. [GW17]
    Guruswami, V., Wootters, M.: Repairing Reed-Solomon codes. IEEE Trans. Inf. Theory 63(9), 5684–5698 (2017)MathSciNetzbMATHGoogle Scholar
  5. [LMC15]
    Liu, J., Mesnager, S., Chen, L.: Secret sharing schemes with general access structures. In: Lin, D., Wang, X.F., Yung, M. (eds.) Inscrypt 2015. LNCS, vol. 9589, pp. 341–360. Springer, Cham (2016).  https://doi.org/10.1007/978-3-319-38898-4_20CrossRefGoogle Scholar
  6. [Mig82]
    Mignotte, M.: How to share a secret. In: Beth, T. (ed.) EUROCRYPT 1982. LNCS, vol. 149, pp. 371–375. Springer, Heidelberg (1983).  https://doi.org/10.1007/3-540-39466-4_27CrossRefGoogle Scholar
  7. [Sha79]
    Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)MathSciNetCrossRefGoogle Scholar
  8. [Tar72]
    Robert Endre Tarjan: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146–160 (1972)MathSciNetCrossRefGoogle Scholar
  9. [Toc15]
    Tochikubo, K.: New secret sharing schemes realizing general access structures. JIP 23(5), 570–578 (2015)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2020

Authors and Affiliations

  • Gaëlle Candel
    • 1
    • 3
  • Rémi Géraud-Stewart
    • 2
    • 3
    Email author
  • David Naccache
    • 3
  1. 1.Ingenico LabsParisFrance
  2. 2.Ingenico LabsAlixanFrance
  3. 3.DIENS, ENS, CNRS, PSL UniversityParis cedex 05France

Personalised recommendations