Round-optimal oblivious transfer and MPC from computational CSIDH

DOI10.1007/978-3-031-31368-4_14zbMath1527.94017OpenAlexW4367663849MaRDI QIDQ6070767

Pratik Sarkar, Saikrishna Badrinarayanan, Sikhar Patranabis, Srinivasan Raghuraman, Daniel Masny, Pratyay Mukherjee

Publication date: 24 November 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-31368-4_14

zbMATH Keywords

multi-party computation protocolsquantum-safe oblivious transfer

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Unnamed Item
• Unnamed Item
• Two-message statistically sender-private OT from LWE
• Two-round multiparty secure computation from minimal assumptions
• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
• Faster algorithms for isogeny problems using torsion point images
• CSIDH: an efficient post-quantum commutative group action
• Promise zero knowledge and its applications to round optimal MPC
• Blazing fast OT for three-round UC OT extension
• Compact, efficient and UC-secure isogeny-based oblivious transfer
• Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
• Breaking the decisional Diffie-Hellman problem for class group actions using genus theory
• UC-secure OT from LWE, revisited
• Rational isogenies from irrational endomorphisms
• Two-round oblivious transfer from CDH or LPN
• Round optimal secure multiparty computation from minimal assumptions
• On statistical security in two-party computation
• Group signatures and more from isogenies and lattices: generic, simple, and efficient
• A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
• Simple oblivious transfer protocols compatible with supersingular isogenies
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• CSI-FiSh: efficient isogeny based signatures through class group computations
• Verifiable delay functions from supersingular isogenies and pairings
• Secure two-party computation in a quantum world
• SeaSign: compact isogeny signatures from class group actions
• Efficient and round-optimal oblivious transfer and commitment with adaptive security
• Cryptographic group actions and applications
• Oblivious pseudorandom functions from isogenies
• Efficient Non-interactive Secure Computation
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Actively Secure OT Extension with Optimal Overhead
• Universally composable two-party and multi-party secure computation
• A Framework for Efficient and Composable Oblivious Transfer
• Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Universally Composable Oblivious Transfer from Lossy Encryption and the McEliece Assumptions
• Fiat-Shamir: from practice to theory
• Oblivious Transfer Based on the McEliece Assumptions
• On lattices, learning with errors, random linear codes, and cryptography
• Password-authenticated key exchange from group actions
• Statistical security in two-party computation revisited
• Triply adaptive UC NIZK
• Cryptanalysis of an oblivious PRF from supersingular isogenies
• Two-round adaptively secure MPC from isogenies, LPN, or CDH
• Statistically sender-private OT from LPN and derandomization

This page was built for publication: Round-optimal oblivious transfer and MPC from computational CSIDH