Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
DE
EN
Books
Journals
Events
Topic Page
Marketing
Log in
Learn more about individual access
Request company access
13th International Engine Congress 2026 | 24 + 25 February 2026

Meeting Place for the Powertrain and Sustainable Fuels Community

Take part as a speaker in the 13th International Engine Congress 2026, the Meeting Place for the Powertrain, and Sustainable Fuels Community for the exchange of experience. Submit a subject proposal online about our main subject areas: Passenger car engine technology, Commercial vehicle engine technology and Sustainable Fuels & Energy!
EXTENDED SEARCH
Log in
Top
Published in:
Read chapter Read first chapter

2023 | OriginalPaper | Chapter

Oblivious Transfer Using Non-abelian Groups

Author : Maggie E. Habeeb

Published in: Frontiers in Industrial and Applied Mathematics

Publisher: Springer Nature Singapore

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

The chapter delves into the significance of oblivious transfer protocols in cryptography, tracing their origins to Rabin's introduction in 1981. It discusses the generalization of these protocols and their applications in secure multiparty computations and commitments. The main focus is on two novel protocols based on non-abelian groups, inspired by the Ko-Lee and Anshel-Anshel-Goldfeld key exchanges, which offer post-quantum security. The chapter also explores the security considerations and challenges in implementing these protocols, highlighting the need for appropriate platform groups to ensure their effectiveness. The discussion on the computational complexity of the conjugacy search problem in certain metabelian groups provides insights into potential secure platforms for these protocols.
AI Generated

This summary of the content was generated with the help of AI.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter Distribution of Noise in Linear Recurrent Fractal Interpolation Functions for Data Sets with -Stable Noise
next chapter Solution of Population Balance Equation Using Homotopy Analysis Method
Literature
1.
Anshel, I., Anshel, M., Goldfeld, D.: An algebraic method for public key cryptography. Math. Res. Lett. 6, 287–291 (1999)CrossRefMATH
2.
Cheon, J., Jun, B.: A polynomial time algorithm for the braid diffie-hellman conjugacy problem. CRYPTO 2003. Lecture Notes in Computer Science, vol. 2729, pp. 212–224 (2003)
3.
Chou, T., Orlandi, C.: The simplest protocol for oblivious transfer. In: Proceedings of the 4th International Conference on Progress in Cryptology, LATIN-CRYPT 2015, pp. 40–58 (2015)
4.
Fine, B., Habeeb, M., Kahrobaei, D., Rosenberger, G.: Aspects of nonabelian group based cryptography: a survey and open problems. JP J. Algebr. Number Theory Appl. 21(1), 1–40 (2011)MATH
5.
Garber, D., Kahrobaei, D.D., Lam, H.T.: Length based attack for polycyclic groups. J. Math. Cryptol. De Gruyter 33–44 (2015)
6.
Gryak, J., Kahrobaei, D., Martinez-Perez, C.: On the conjugacy problem in certain metabelian groups. Glasgow Math. J. 61(2), 251–269 (2019)CrossRefMATH
7.
Hughes, J., Tannenbaum, A.: Length based attacks for certain group based encryption rewriting systems, workshop seci02 sécurité de la communication sur internet (2002)
8.
Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer-efficiently. Advances in Cryptology-CRYPTO: CRYPTO 2008. Lecture Notes in Computer Science, vol. 5157, pp. 572–591 (2008)
9.
Kilian, J.: Founding cryptography on oblivious transfer. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 2–4 May 1988, Chicago, Illinois, USA, pp. 20–31 (1988)
10.
Ko, K.H., Lee, S.J., Cheon, J.H., Han, J.W., Kang, J., Park, C.: New public key cryptosystem using braid groups. Advances in Cryptology, CRYPTO 2000. LNCS, vol. 1880, pp. 166–183. Santa Barbara, CA (2000)
11.
Kotov, M., Ushakov, A.: Analysis of a certain polycyclic group based cryptosystem. J. Math. Cryptol. 9(3), 161–167 (2015)CrossRefMATH
12.
Li, J., Li, X., Wang, L., He, D., Niu, X.: Oblivious transfer protocols based on group factoring problem. Advances in Broad-Band Wireless Computing, Communication and Applications. BWCCA 2016. Lecture Notes on Data Engineering and Communications Technologies, vol. 2 (2017)
13.
Myasnikov, A., Shpilrain, V., Ushakov, A.: Group Based Cryptography. Advanced Courses in Mathematics, CRM Barcelona. Birkhauser Verlag, Basel (2008)MATH
14.
Rabin, M.O.: How to exchange secrets with oblivious transfer. Technical Report TR-81. Aiken Computation Laboratory, Harvard University (1981)
15.
Ruinskiy, D., Shamir, A., Tsaban, B.: Length based cryptanalysis: the case of Thompson’s group. J. Math. Cryptol. 1, 359–372 (2007)CrossRefMATH
16.
Shor, P.W.: Polynomial time algorithms for prime factorization and discrete logarithms on a quantum computer. J. Sci. Statist. Comput. 26, 1484 (1997)MATH
17.
Shpilrain, V., Ushakov, A.: Thompson’s group and public key cryptography. Lecture Notes Computer Science, vol. 3531, pp. 151–164 (2005)
18.
Tsaban, B.: Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography. J. Cryptol. 28, 601–622 (2015)CrossRefMATH
Metadata
Title
Oblivious Transfer Using Non-abelian Groups
Author
Maggie E. Habeeb
Copyright Year
2023
Publisher
Springer Nature Singapore
Book
Frontiers in Industrial and Applied Mathematics

Print ISBN: 978-981-19-7271-3

Electronic ISBN: 978-981-19-7272-0

Copyright Year: 2023

DOI
https://doi.org/10.1007/978-981-19-7272-0_3

Premium Partners

    Image Credits