Compact, efficient and UC-secure isogeny-based oblivious transfer
type: Item
instance of: scholarly article
title: Compact, efficient and UC-secure isogeny-based oblivious transfer
zbMATH Open document ID: 1479.94207
DOI: 10.1007/978-3-030-77870-5_8
author: Yi-Fu Lai
author: Steven D. Galbraith
author: Cyprien Delpech De Saint Guilhem
publication date: 2021-12-08T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 81P94
zbMATH DE Number: 7440580
zbMATH Keywords: secure multiparty
zbMATH Keywords: post-quantum OT protocols
MaRDI profile type: Publication
full work available at URL: 978-3-030-77870-5 8
OpenAlex ID: W3082533815
cites work: Cryptographic group actions and applications
cites work: Q3210162
cites work: Faster computation of isogenies of large prime degree
cites work: CSI-FiSh: efficient isogeny based signatures through class group computations
cites work: Security and composition of multiparty cryptographic protocols
cites work: Q4228521
cites work: Q4434869
cites work: CSIDH: an efficient post-quantum commutative group action
cites work: The Simplest Protocol for Oblivious Transfer
cites work: Q4343427
cites work: Universally Composable Oblivious Transfer from Lossy Encryption and the McEliece Assumptions
cites work: Two-round oblivious transfer from CDH or LPN
cites work: Oblivious Transfer Based on the McEliece Assumptions
cites work: SeaSign: compact isogeny signatures from class group actions
cites work: Fast quantum algorithms for computing the unit group and class group of a number field
cites work: Efficient secure two-party protocols. Techniques and constructions
cites work: Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
cites work: Efficient Fully-Simulatable Oblivious Transfer
cites work: On Lions and elligators: an efficient constant-time implementation of CSIDH
cites work: Efficient oblivious transfer protocols
cites work: Foundations of Cryptography
cites work: A Framework for Efficient and Composable Oblivious Transfer
cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
cites work: Simple oblivious transfer protocols compatible with supersingular isogenies
description: scientific article; zbMATH DE number 7440580