Oblivious transfer using non-abelian groups
From MaRDI portal
Publication:6203598
DOI10.1007/978-981-19-7272-0_3OpenAlexW4318946517MaRDI QIDQ6203598
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
- Unnamed Item
- Analysis of a certain polycyclic-group-based cryptosystem
- Group-based cryptography
- An algebraic method for public-key cryptography
- Length-based attacks in polycyclic groups
- Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
- The Simplest Protocol for Oblivious Transfer
- Aspects of Nonabelian Group Based Cryptography: A Survey and Open Problems
- Thompson’s Group and Public Key Cryptography
- Founding Cryptography on Oblivious Transfer – Efficiently
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- ON THE CONJUGACY PROBLEM IN CERTAIN METABELIAN GROUPS
- Advances in Cryptology - CRYPTO 2003
- Length-based cryptanalysis: the case of Thompson's group
This page was built for publication: Oblivious transfer using non-abelian groups