Oblivious pseudorandom functions in non-commutative groups
From MaRDI portal
Cites work
- A computational introduction to number theory and algebra
- A post-quantum round-optimal oblivious PRF from isogenies
- A subexponential quantum algorithm for the semidirect discrete logarithm problem
- An algebraic method for public-key cryptography
- Applications of finite non-abelian simple groups to cryptography in the quantum era
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Entity authentication schemes using braid word reduction
- scientific article; zbMATH DE number 5982274 (Why is no real title available?)
- scientific article; zbMATH DE number 5383593 (Why is no real title available?)
- scientific article; zbMATH DE number 3815540 (Why is no real title available?)
- scientific article; zbMATH DE number 1759777 (Why is no real title available?)
- Number-theoretic constructions of efficient pseudo-random functions
- Oblivious pseudorandom functions from isogenies
- OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
- Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- SiGamal: a supersingular isogeny-based PKE and its application to a PRF
- SPDH-Sign: Towards Efficient, Post-quantum Group-Based Signatures
- Subsets of groups in public-key cryptography
- The root extraction problem in braid group-based cryptography
- Theory of Cryptography
- Thompson’s Group and Public Key Cryptography
This page was built for publication: Oblivious pseudorandom functions in non-commutative groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310940)
