Skip to main content
Springer Nature Link
Log in

Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry Codes

  • Conference paper
Cryptography and Coding (IMACC 2009)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 5921))

Included in the following conference series:

Abstract

Key predistribution schemes (KPSs) and one-time broadcast encryption schemes (OTBESs) are unconditionally secure protocols for key distribution in networks. The efficiency of these schemes has been measured in previous works in terms of their information rate, that is, the ratio between the length of the secret keys and the length of the secret information that must be stored by every user. Several constructions with optimal information rate have been proposed, but in them the secret keys are taken from a finite field with at least as many elements as the number of users in the network. This can be an important drawback in very large networks in which the nodes have limited computational resources as, for instance, wireless sensor networks. Actually, key predistribution schemes have been applied recently in the design of key distribution protocols for such networks.

In this paper we present a method to construct key predistribution schemes from linear codes that provide new families of KPSs and OTBESs for an arbitrarily large number of users and with secret keys of constant size. As a consequence of the Gilbert-Varshamov bound, we can prove that our KPSs are asymptotically more efficient than previous constructions, specially if we consider KPSs that are secure against coalitions formed by a constant fraction of the users. We analyze as well the KPSs that are obtained from families of algebraic geometry linear codes that are above the Gilbert-Varshamov bound, as the ones constructed from the curves of Garcia and Stichtenoth. Finally, we discuss how the use of KPSs based on algebraic geometry codes can provide more efficient OTBESs.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Beimel, A., Chor, B.: Communication in key distribution schemes. IEEE Trans. Inform. Theory 40, 19–28 (1996)

    Article  MathSciNet  Google Scholar 

  2. Berkovits, S.: How To Broadcast A Secret. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 535–541. Springer, Heidelberg (1991)

    Google Scholar 

  3. Blom, R.: An Optimal Class of Symmetric Key Generation Systems. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol. 209, pp. 335–338. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  4. Blundo, C., Cresti, A.: Space requirements for broadcast encryption. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 287–298. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  5. Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U., Yung, M.: Perfectly-Secure Key Distribution for Dynamic Conferences. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 471–486. Springer, Heidelberg (1993)

    Google Scholar 

  6. Blundo, C., Frota Mattos, L.A., Stinson, D.R.: Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 387–400. Springer, Heidelberg (1996)

    Google Scholar 

  7. Brickell, E.F.: Some ideal secret sharing schemes. J. Combin. Math. and Combin. Comput. 9, 105–113 (1989)

    MathSciNet  Google Scholar 

  8. Chen, H.: Codes on Garcia-Stichtenoth curves with true minimum distance greater than Feng-Rao distance. IEEE Transactions on Information Theory 45(8), 706–709 (1999)

    Article  MATH  Google Scholar 

  9. Chen, H., Cramer, R.: Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computation over Small Fields. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 521–536. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  10. Chen, H., Cramer, R., Goldwasser, S., de Haan, R., Vaikuntanathan, V.: Secure Computation from Random Error Correcting Codes. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 291–310. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. Chen, H., Cramer, R., de Haan, R., Pueyo, I.C.: Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 451–470. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Delgosha, F., Fekri, F.: Threshold Key-Establishment in Distributed Sensor Networks Using a Multivariate Scheme. In: Proceedings of the 25th IEEE International Conference on Computer Communications INFOCOM 2006, pp. 1–12 (2006)

    Google Scholar 

  13. Du, W., Deng, J., Han, Y.S., Varshney, P.K., Katz, J., Khalili, A.: A pairwise key predistribution scheme for wireless sensor networks. ACM Trans. Inf. Syst. Secur. 8, 228–258 (2005)

    Article  Google Scholar 

  14. Fiat, A., Naor, M.: Broadcast encryption. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 480–491. Springer, Heidelberg (1994)

    Google Scholar 

  15. Garcia, A., Stichtenoth, H.: On the Asymptotic Behaviour of Some Towers of Function Fields over Finite Fields. J. Number Theory 61, 248–273 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  16. Goppa, V.D.: Codes on algebraic curves. Soviet Math. Dokl. 24, 170–172 (1981)

    MATH  Google Scholar 

  17. Grassl, M.: Bounds on the minimum distance of linear codes, http://www.codetables.de

  18. Kurosawa, K., Yoshida, T., Desmedt, Y., Burmester, M.: Some Bounds and a Construction for Secure Broadcast Encryption. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 420–433. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  19. Lee, J., Stinson, D.R.: Deterministic Key Predistribution Schemes for Distributed Sensor Networks. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol. 3357, pp. 294–307. Springer, Heidelberg (2004)

    Google Scholar 

  20. van Lint, J.H., Wilson, R.M.: A Course in Combinatorics. Cambridge University Press, Cambridge (1992)

    MATH  Google Scholar 

  21. Liu, D., Ning, P., Li, R.: Establishing pairwise keys in distributed sensor networks. ACM Trans. Inf. Syst. Secur. 8, 41–77 (2005)

    Article  Google Scholar 

  22. Massey, J.L.: Minimal codewords and secret sharing. In: Proceedings of the 6th Joint Swedish-Russian Workshop on Information Theory, pp. 269–279 (1993)

    Google Scholar 

  23. Matsumoto, T., Imai, H.: On the Key Predistribution System: A Practical Solution to the Key Distribution Problem. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 185–193. Springer, Heidelberg (1988)

    Google Scholar 

  24. Matthews, G.L.: Weierstrass semigroups and codes from the quotients of Hermitian curve. Des. Codes Cryptogr. 37, 473–492 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  25. Padró, C., Gracia, I., Martín, S.: Improving the trade-off between strorage and communication in broadcast encryption schemes. Discrete Appl. Math. 143, 213–220 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  26. Padró, C., Gracia, I., Martín Molleví, S., Morillo, P.: Linear Key Predistribution Schemes. Des. Codes Cryptogr. 25, 281–298 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  27. Padró, C., Gracia, I., Martín, S., Morillo, P.: Linear broadcast encryption schemes. Discrete Appl. Math. 128, 223–238 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  28. Shamir, A.: How to share a secret. Commun. of the ACM 22, 612–613 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  29. Stinson, D.R.: On some methods for unconditionally secure key distribution and broadcast encryption. Des. Codes Cryptogr. 12, 215–243 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  30. Stinson, D.R., van Trung, T.: Some New Results on Key Distribution Patterns and Broadcast Encryption. Des. Codes Cryptogr. 14, 261–279 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  31. Stinson, D.R., Wei, R.: An application of ramp schemes to broadcast encryption. Inform. Process. Lett. 69, 131–135 (1999)

    Article  MathSciNet  Google Scholar 

  32. Tsfasman, M.A., Vlăduţ, S.G.: Algebraic-Geometric Codes. Kluwer Academic Publishers Group, Dordrecht (1991)

    MATH  Google Scholar 

  33. Xing, C.: Algebraic geometry codes with asymptotic parameters better than Gilbert-Varshamov bound and Tsfasman-Vladut-Zink bound. IEEE Transactions on Information Theory 47(1), 347–352 (2002)

    Article  Google Scholar 

  34. Xing, C., Chen, H.: Improvement on parameters of one-point AG codes from Hermitian curves. IEEE Transactions on Information Theory 47(2), 535–537

    Google Scholar 

  35. Yang, K., Kumar, P.V.: On the true minimum distance of Hermitian codes. Coding Theory and Algebraic Geometry, Lecture Notes in Math. 1518, 99–107 (1992)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Software Engineering Institute, East China Normal University, Shanghai, China

    Hao Chen

  2. Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore

    San Ling, Huaxiong Wang & Chaoping Xing

  3. Departament de Matemàtica Aplicada IV, Universitat Politècnica de Catalunya, Barcelona, Spain

    Carles Padró

Authors
  1. Hao Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. San Ling
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Carles Padró
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Huaxiong Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Chaoping Xing
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The Selmer Centre Department of Informatics, University of Bergen, P.O. Box 7800, N-5020, Bergen, Norway

    Matthew G. Parker

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, H., Ling, S., Padró, C., Wang, H., Xing, C. (2009). Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry Codes. In: Parker, M.G. (eds) Cryptography and Coding. IMACC 2009. Lecture Notes in Computer Science, vol 5921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10868-6_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10868-6_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10867-9

  • Online ISBN: 978-3-642-10868-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics