Skip to main content

On the Power of Computational Secret Sharing

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2904))

Abstract

Secret sharing is a very important primitive in cryptography and distributed computing. In this work, we consider computational secret sharing (CSS) which provably allows a smaller share size (and hence greater efficiency) than its information-theoretic counterparts. Extant CSS schemes result in succinct share-size and are in a few cases, like threshold access structures, optimal. However, in general, they are not efficient (share-size not polynomial in the number of players n), since they either assume efficient perfect schemes for the given access structure (as in [10]) or make use of exponential (in n) amount of public information (like in [5]). In this paper, our goal is to explore other classes of access structures that admit of efficient CSS, without making any other assumptions. We construct efficient CSS schemes for every access structure in monotone P. As of now, most of the efficient information-theoretic schemes known are for access structures in algebraic NC 2. Monotone P and algebraic NC 2 are not comparable in the sense one does not include other. Thus our work leads to secret sharing schemes for a new class of access structures. In the second part of the paper, we introduce the notion of secret sharing with a semi-trusted third party, and prove that in this relaxed model efficient CSS schemes exist for a wider class of access structures, namely monotone NP.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beguin, P., Cresti, A.: General short computational secret sharing schemes. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 194–208. Springer, Heidelberg (1995)

    Google Scholar 

  2. Beimel, A., Ishai, Y.: On the Power of Non-Linear Secret Sharing. In: Proceedings of 16th IEEE Structure in Complexity Theory (2001)

    Google Scholar 

  3. Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 27–36. Springer, Heidelberg (1990)

    Google Scholar 

  4. Bellare, M., Micali, S.: Non-interactive oblivous transfer and applications. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 547–557. Springer, Heidelberg (1990)

    Google Scholar 

  5. Cachin: On-line secret sharing. In: IMA: IMA Conference on Cryptography and Coding, LNCS lately (earlier: Cryptography and Coding II, Clarendon Press, 1992) (1995)

    Google Scholar 

  6. Franklin, M.K., Reiter, M.K.: Fair exchange with a semi-trusted third party. In: ACM Conference on Computer and Communications Security, pp. 1–5 (1997)

    Google Scholar 

  7. Grigni, Sipser: Monotone Complexity. In: PATBOOL: Boolean Function Complexity. London Mathematical Society Lecture Note Series, vol. 169, Cambridge University Press, Cambridge (1992)

    Google Scholar 

  8. Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing general access structure. In: Proceedings of IEEE Globecom 1987, pp. 99–102. IEEE, Los Alamitos (1987)

    Google Scholar 

  9. Karchmer, M., Wigderson, A.: On span programs. In: Proceedings of the 8th Annual IEEE Structure in Complexity Theory, pp. 102–111 (1993)

    Google Scholar 

  10. Krawczyk, H.: Secret sharing made short. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 136–146. Springer, Heidelberg (1994)

    Google Scholar 

  11. Naor, M., Pinkas, B.: Efficient Oblivious Transfer Protocols. In: SODA 2001, pp. 448–457 (2001)

    Google Scholar 

  12. Rabin, M.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Aiken Computation Laboratory, Harvard University (1981)

    Google Scholar 

  13. Rabin, M.: Efficient dispersal of information for security, load-balancing and faulttolerance. JACM 36, 335–348 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  14. Razborov, A.: A lower bound on the monotone network complexity of the logical permanent. Mat. Zametki 37(6), 887–900 (1985) (in russian)

    MathSciNet  Google Scholar 

  15. Yao, A.C.: How to generate and exchange secrets. In: Proc. of STOC, pp. 162–167 (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vinod, V., Narayanan, A., Srinathan, K., Rangan, C.P., Kim, K. (2003). On the Power of Computational Secret Sharing. In: Johansson, T., Maitra, S. (eds) Progress in Cryptology - INDOCRYPT 2003. INDOCRYPT 2003. Lecture Notes in Computer Science, vol 2904. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24582-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24582-7_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20609-5

  • Online ISBN: 978-3-540-24582-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics