Skip to main content
SpringerLink
Log in

Provable Secure Constant-Round Group Key Agreement Protocol Based on Secret Sharing

  • Conference paper
International Joint Conference SOCO’13-CISIS’13-ICEUTE’13

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 239))

Abstract

Group Key Agreement (GKA) allows multiple users to collaboratively compute a common secret key. Motivated by the very few existing GKA protocols based on secret sharing with formal security proofs, we propose a new method to build such protocols. We base our construction on secret n-sharing, an untraditional perspective of secret sharing that brings several advantages. Our proposal achieves better security than the existing work while it maintains a constant number of communication rounds regardless the group size.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blakley, G.: Safeguarding Cryptographic Keys. In: Proceedings of the 1979 AFIPS National Computer Conference, pp. 313–317 (1979)

    Google Scholar 

  2. Bresson, E., Catalano, D.: Constant Round Authenticated Group Key Agreement via Distributed Computation. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 115–129. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Bresson, E., Chevassut, O., Pointcheval, D.: Provably Authenticated Group Diffie-Hellman Key Exchange - The Dynamic Case. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 290–309. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Bresson, E., Chevassut, O., Pointcheval, D.: Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 321–336. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Bresson, E., Chevassut, O., Pointcheval, D., Quisquater, J.J.: Provably Authenticated Group Diffie-Hellman Key Exchange. In: Proceedings of the 8th ACM Conference on Computer and Communications Security (CCS 2001), pp. 255–264 (2001)

    Google Scholar 

  6. Bresson, E., Manulis, M.: Securing group key exchange against strong corruptions. In: Proceedings of ASIA CSS 2008, pp. 249–260 (2008)

    Google Scholar 

  7. Cao, C., Yang, C., Ma, J., Moon, S.J.: Constructing UC Secure and Constant-Round Group Key Exchange Protocols via Secret Sharing. EURASIP J. Wireless Comm. and Networking (2008)

    Google Scholar 

  8. Gorantla, M.C., Boyd, C., González Nieto, J.M.: Modeling Key Compromise Impersonation Attacks on Group Key Exchange Protocols. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 105–123. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Harn, L., Lin, C.: Authenticated Group Key Transfer Protocol based on Secret Sharing. IEEE Trans. Comput. 59(6), 842–846 (2010)

    Article  MathSciNet  Google Scholar 

  10. Hsu, C., Zeng, B., Cheng, Q., Cui, G.: A Novel Group Key Transfer Protocol. Cryptology ePrint Archive, Report 2012/043 (2012)

    Google Scholar 

  11. Karnin, E.D., Greene, J.W., Hellman, M.E.: On Secret Sharing Systems. IEEE Transactions on Information Theory 29(1), 35–41 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  12. Katz, J., Shin, J.S.: Modeling Insider Attacks on Group Key-Exchange Protocols. In: Proceedings of the 12th ACM Conference on Computer and Communications Security (CCS 2005), pp. 180–189 (2005)

    Google Scholar 

  13. Nam, J., Kim, M., Paik, J., Jeon, W., Lee, B., Won, D.: Cryptanalysis of a Group Key Transfer Protocol based on Secret Sharing. In: Kim, T.-h., Adeli, H., Slezak, D., Sandnes, F.E., Song, X., Chung, K.-i., Arnett, K.P. (eds.) FGIT 2011. LNCS, vol. 7105, pp. 309–315. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  14. Olimid, R.F.: On the Security of an Authenticated Group Key Transfer Protocol Based on Secret Sharing. In: Mustofa, K., Neuhold, E.J., Tjoa, A.M., Weippl, E., You, I. (eds.) ICT-EurAsia 2013. LNCS, vol. 7804, pp. 399–408. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  15. Olimid, R.F.: Cryptanalysis of a Password-based Group Key Exchange Protocol Using Secret Sharing. Appl. Math. Inf. Sci. 7(4), 1585–1590 (2013)

    Article  Google Scholar 

  16. Pieprzyk, J., Li, C.H.: Multiparty Key Agreement Protocols. In: IEEE Proceedings - Computers and Digital Techniques, pp. 229–236 (2000)

    Google Scholar 

  17. Sáez, G.: Generation of Key Predistribution Schemes using Secret Sharing Schemes. Discrete Applied Mathematics 128(1), 239–249 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  18. Shamir, A.: How to Share a Secret. Commun. ACM 22(11), 612–613 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  19. Sun, Y., Wen, Q., Sun, H., Li, W., Jin, Z., Zhang, H.: An Authenticated Group Key Transfer Protocol based on Secret Sharing. Procedia Engineering 29, 403–408 (2012)

    Article  Google Scholar 

  20. Yuan, W., Hu, L., Li, H., Chu, J.: An Efficient Password-based Group Key Exchange Protocol Using Secret Sharing. Appl. Math. Inf. Sci. 7(1), 145–150 (2013)

    Article  MathSciNet  Google Scholar 

  21. Zhao, J., Gu, D., Gorantla, M.C.: Stronger Security Model of Group Key Agreement. In: Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security (ASIACCS 2011), pp. 435–440 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Bucharest, Bucharest, Romania

    Ruxandra F. Olimid

Authors
  1. Ruxandra F. Olimid
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ruxandra F. Olimid .

Editor information

Editors and Affiliations

  1. Department of Civil Engineering, University of Burgos, Burgos, Spain

    Álvaro Herrero

  2. Department of Civil Engineering, University of Burgos, Burgos, Spain

    Bruno Baruque

  3. German Workforce ADL Partnership Laboratory, Waltershausen, Germany

    Fanny Klett

  4. Scientific Network for Innovation and Research Excellence, Machine Intelligence Research Labs (MIR Labs), Auburn, Washington, USA

    Ajith Abraham

  5. Department of Computer Science Faculty of Ele. Eng. & Computer Science, VŠB-TU Ostrava, Ostrava, Czech Republic

    Václav Snášel

  6. Department of Computer Science, University of Sao Paulo at Sao Carlos, Sao Carlos, Brazil

    André C.P.L.F. de Carvalho

  7. DeustoTech Computing, University of Deusto, Bilbao, Spain

    Pablo García Bringas

  8. Department of Computer Science Faculty of Elec. Eng. and Comp. Science, VŠB-TU Ostrava, Ostrava, Czech Republic

    Ivan Zelinka

  9. University of Salamanca, Salamanca, Spain

    Héctor Quintián

  10. University of Salamanca, Salamanca, Spain

    Emilio Corchado

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Olimid, R.F. (2014). Provable Secure Constant-Round Group Key Agreement Protocol Based on Secret Sharing. In: Herrero, Á., et al. International Joint Conference SOCO’13-CISIS’13-ICEUTE’13. Advances in Intelligent Systems and Computing, vol 239. Springer, Cham. https://doi.org/10.1007/978-3-319-01854-6_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-01854-6_50

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-01853-9

  • Online ISBN: 978-3-319-01854-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation