Journals / International Journal of Information Security Science / 2013 / Cilt: 2 - Sayı: 4

A secure multicast protocol based on pairings on elliptic curves

Pages
108–118
Publication Date
2013-12-30
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

It is shown how this protocol improves some alternatives existing for real time communications.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:The aim of this paper is to introduce a protocol for multicast distribution of secrets providing perfect forward and backward secrecy.
📊
Key Findings & Data:The protocol is based on pairings on elliptic curves and has low cost communications and key storage.
💡
Conclusion & Impact:It is shown how this protocol improves some alternatives existing for real time communications.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:—Information security · multicast communications · elliptic curves cryptography

Abstract

The aim of this paper is to introduce a protocol for multicast distribution of secrets providing perfect forward and backward secrecy. The protocol is based on pairings on elliptic curves and has low cost communications and key storage. It is shown how this protocol improves some alternatives existing for real time communications.

🔖

Cite This Article

ALVAREZ-BERMEJO, J. A., LÓPEZ-RAMOS, J. A. (2013). A secure multicast protocol based on pairings on elliptic curves. International Journal of Information Security Science, Cilt: 2 - Sayı: 4, 108–118. https://ajindex.com/articles/833059

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (15)

  1. N. Antequera and J. A. Lopez-Ramos, Pairings and secure multicast, Proceedings of the 11th International Conference on Computational and Mathematical Methods in Science and Engi- neering CMMSE 2011, Alicante, 2011, 114–119.
  2. J. M. Arrufat, J.A. Alvarez-Bermejo and J. A. Lopez-Ramos, Una implementaci´on paralela del CRA con aplicaciones crip- togr´aficas,VIII Jornadas de Matem´atica Discreta y Algor´ıtmica, Proceedings, Almer´ıa 2012, July 11th-13th, 2012, 267–274.
  3. J.-L. Beuchat, E. Lopez-Trejo, L. Martinez-Ramos, S. Mitsunari, and Francisco Rodriguez-Henriquez, Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves,Cryp- tology and Network Security (CANS 2009), LNCS 5888, 2009, 413–432.
  4. I. F. Blake, G. Seroussi and N. P. Smart, Advances in Elliptic Curve Cryptography, London Mathematical Society LNS Series 317, Cambridge University Press, Cambridge, 2005.
  5. D. Boneh and R. J. Lipton, Quantum cryptanalysis of hidden linear functions, Advances in Cryptology-CRYPTO ’95, Lecture Notes in Computer Sciences 963, Springer-Verlag, Berlin, 1995, 424–437.
  6. D. Boneh and A. Silverberg, Applications of Multilinear Forms to Cryptography,Contemp. Mathematics 324, 2003, 71–90.
  7. K. -C. Chan and S. -H. G. Chan, Key management approaches to offer data confidentiality for secure multicast, Network, IEEE 17(5), 2003, 30–39.
  8. G. -H. Chiou and W. -T. Chen, Secure broadcasting using the secure lock, IEEE Trans. Softw. Eng. 15(8), 1989, 929–934.
  9. R. Di Pietro and L. V. Mancini, Efficient and Secure Keys Management for Wireless Mobile Communications, Proceedings of the second ACM international workshop on Principles of mobile computing, 2002, 66–73.
  10. D. Dolev, C. Dwork, and M. Naor, Non-malleable cryptography, Proceedings of the 23rd Annual Symposium on Theory of Computing, ACM, 1991.
  11. D. Dolev, C. Dwork, and M. Naor, Non-malleable cryptography, SIAM J. Comput. 30(2), 2000, 391–437.
  12. S. Goldwasser and S. Micali, Probabilistic encryption, J. Com- put. System Sci. 28, 1984, 270–299.
  13. A. Joux, A One Round Protocol for Tripartite Diffe-Hellman, J. Cryptology 17, 2004, 263–276.
  14. D. Kammler, D. Zhang, P. Schwabe, H. Scharwaechter, M. Langenberg, D. Auras, G. Ascheid, R. Leupers, R. Mathar, and H. Meyr, Designing an ASIP for cryptographic pairings over Barreto-Naehrig curves,Cryptology ePrint Archive, Report 2009/056, 2009.
  15. P. S. Kruus and J. P. Macker, Techniques and issues in multicast security, Proceedings of Military Communications Conference, MILCOM 1998, 1998, 1028–103