Oblivious pseudorandom functions from isogenies
type: Item
instance of: scholarly article
title: Oblivious pseudorandom functions from isogenies
DOI: 10.1007/978-3-030-64834-3_18
author: Dan Boneh
author: Dmitry Kogan
author: Katharine Woo
publication date: 2023-03-21T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 14K02
Mathematics Subject Classification ID: 14H52
zbMATH DE Number: 7666674
zbMATH Keywords: isogenies
zbMATH Keywords: supersingular elliptic curves
zbMATH Keywords: secure pseudorandom function
describes a project that uses: SIKE
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-030-64834-3 18
OpenAlex ID: W3111514642
cites work: On the cost of computing isogenies between supersingular elliptic curves
cites work: The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
cites work: Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
cites work: Quantum security analysis of CSIDH
cites work: Simulatable Adaptive Oblivious Transfer
cites work: CSIDH: an efficient post-quantum commutative group action
cites work: Cryptographic hash functions from expander graphs
cites work: Q3671884
cites work: Efficient Compression of SIDH Public Keys
cites work: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
cites work: Theory of Cryptography
cites work: Secure integration of asymmetric and symmetric encryption schemes
cites work: On the Security of Supersingular Isogeny Cryptosystems
cites work: Identification protocols and signature schemes based on supersingular isogeny problems
cites work: Computational problems in supersingular elliptic curve isogenies
cites work: Blind Identity-Based Encryption and Simulatable Oblivious Transfer
cites work: Distributed SSH key management with proactive RSA threshold signatures
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Isogeny-Based Quantum-Resistant Undeniable Signatures
cites work: Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
cites work: OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
cites work: Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
cites work: Fast Secure Computation of Set Intersection
cites work: General linear group action on tensors: a candidate for post-quantum cryptography
cites work: A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
cites work: Another look at some isogeny hardness assumptions
cites work: Q4250771
cites work: Number-theoretic constructions of efficient pseudo-random functions
cites work: Parallel collision search with cryptanalytic applications
cites work: He gives C-sieves on the CSIDH
cites work: Faster algorithms for isogeny problems using torsion point images
cites work: SpOT-light: lightweight private set intersection from sparse OT extension
cites work: The Arithmetic of Elliptic Curves
cites work: Claw finding algorithms using quantum walk
cites work: Simple oblivious transfer protocols compatible with supersingular isogenies
cites work: TOPPSS: Cost-Minimal Password-Protected Secret Sharing Based on Threshold OPRF
Recommended article: Cryptanalysis of an oblivious PRF from supersingular isogenies
Recommended article: Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
Recommended article: On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding
Recommended article: Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
Recommended article: Compact, efficient and UC-secure isogeny-based oblivious transfer
description: scientific article; zbMATH DE number 7666674