Oblivious transfer using non-abelian groups
From MaRDI portal
Publication:6203598
DOI10.1007/978-981-19-7272-0_3OpenAlexW4318946517MaRDI QIDQ6203598FDOQ6203598
Authors: Maggie Habeeb 
Publication date: 5 April 2024
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-981-19-7272-0_3
Cites Work
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- An algebraic method for public-key cryptography
- Thompson’s Group and Public Key Cryptography
- Title not available (Why is that?)
- Length-based cryptanalysis: the case of Thompson's group
- Founding Cryptography on Oblivious Transfer – Efficiently
- Group-based cryptography
- Length-based attacks in polycyclic groups
- Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
- Advances in Cryptology - CRYPTO 2003
- Analysis of a certain polycyclic-group-based cryptosystem
- Aspects of nonabelian group based cryptography: a survey and open problems
- The simplest protocol for oblivious transfer
- ON THE CONJUGACY PROBLEM IN CERTAIN METABELIAN GROUPS
This page was built for publication: Oblivious transfer using non-abelian groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6203598)
