Oblivious pseudorandom functions from isogenies
From MaRDI portal
Recommendations
- Cryptanalysis of an oblivious PRF from supersingular isogenies
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Compact, efficient and UC-secure isogeny-based oblivious transfer
Cites work
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Advances in Cryptology - CRYPTO 2003
- Another look at some isogeny hardness assumptions
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer
- Claw finding algorithms using quantum walk
- Computational problems in supersingular elliptic curve isogenies
- Cryptographic hash functions from expander graphs
- CSIDH: an efficient post-quantum commutative group action
- Distributed SSH key management with proactive RSA threshold signatures
- Efficient compression of SIDH public keys
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Fast secure computation of set intersection
- Faster algorithms for isogeny problems using torsion point images
- General linear group action on tensors: a candidate for post-quantum cryptography
- He gives C-sieves on the CSIDH
- scientific article; zbMATH DE number 3825707 (Why is no real title available?)
- scientific article; zbMATH DE number 1304081 (Why is no real title available?)
- Identification protocols and signature schemes based on supersingular isogeny problems
- Isogeny-based quantum-resistant undeniable signatures
- Number-theoretic constructions of efficient pseudo-random functions
- On the cost of computing isogenies between supersingular elliptic curves
- On the Security of Supersingular Isogeny Cryptosystems
- OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
- Parallel collision search with cryptanalytic applications
- Quantum security analysis of CSIDH
- Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
- Secure integration of asymmetric and symmetric encryption schemes
- Simple oblivious transfer protocols compatible with supersingular isogenies
- Simulatable Adaptive Oblivious Transfer
- SpOT-light: lightweight private set intersection from sparse OT extension
- The Arithmetic of Elliptic Curves
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- Theory of Cryptography
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- TOPPSS: cost-minimal password-protected secret sharing based on threshold OPRF
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
Cited in
(32)- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- On the decisional Diffie-Hellman problem for class group actions on oriented elliptic curves
- Improved torsion-point attacks on SIDH variants
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- On the security of OSIDH
- Supersingular curves you can trust
- Proving knowledge of isogenies: a survey
- Round-optimal oblivious transfer and MPC from computational CSIDH
- A new isogeny representation and applications to cryptography
- SIDH proof of knowledge
- Cryptanalysis of an oblivious PRF from supersingular isogenies
- Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based OT
- Exploring SIDH-based signature parameters
- \textsf{FESTA}: fast encryption from supersingular torsion attacks
- \textsf{PERKS}: persistent and distributed key acquisition for secure storage from passwords
- Composable oblivious pseudo-random functions via garbled circuits
- A post-quantum round-optimal oblivious PRF from isogenies
- New proof systems and an OPRF from CSIDH
- Parameter-hiding order-revealing encryption without pairings
- Crypto dark matter on the torus. Oblivious PRFs from shallow PRFs and TFHE
- Latke: a framework for constructing identity-binding PAKEs
- Improved alternating-moduli PRFs and post-quantum signatures
- The 2Hash OPRF framework and efficient post-quantum instantiations
- \textsc{Leap}: a fast, lattice-based OPRF with application to private set intersection
- How (not) to hash into class groups of imaginary quadratic fields?
- Verifiable oblivious pseudorandom functions from lattices: practical-ish and thresholdisable
- Faster proofs and VRFs from isogenies
- Game changer: a modular framework for OPRF security
- Combining oblivious pseudorandom functions
- Oblivious pseudorandom functions in non-commutative groups
- On the active security of the PEARL-SCALLOP group action
- Capybara and Tsubaki: verifiable random functions from group actions and isogenies
This page was built for publication: Oblivious pseudorandom functions from isogenies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2692394)
