New proof systems and an OPRF from CSIDH
From MaRDI portal
Publication:6635825
DOI10.1007/978-3-031-57725-3_8MaRDI QIDQ6635825
Cyprien Delpech De Saint Guilhem, Robi Pedersen
Publication date: 12 November 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Linear groups with an exposition of the \textit{Galois} field theory.
- CSIDH: an efficient post-quantum commutative group action
- Short signatures from the Weil pairing
- Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512
- Threshold schemes from isogeny assumptions
- Compact, efficient and UC-secure isogeny-based oblivious transfer
- VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE
- Banquet: short and fast signatures from AES
- \textsf{CSI-RAShi}: distributed key generation for CSIDH
- SimS: a simplification of SiGamal
- He gives C-sieves on the CSIDH
- Quantum security analysis of CSIDH
- An isogeny-based ID protocol using structured public keys
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Orientations and the supersingular endomorphism ring problem
- CSI-FiSh: efficient isogeny based signatures through class group computations
- SeaSign: compact isogeny signatures from class group actions
- SQISign: compact post-quantum signatures from quaternions and isogenies
- Cryptographic group actions and applications
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
- Oblivious pseudorandom functions from isogenies
- SiGamal: a supersingular isogeny-based PKE and its application to a PRF
- Oblivious transfer and polynomial evaluation
- Actively Secure OT Extension with Optimal Overhead
- Zero-Knowledge Proofs from Secure Multiparty Computation
- On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
- Sashimi: Cutting up CSI-FiSh Secret Keys to Produce an Actively Secure Distributed Signing Protocol
- Advances in Cryptology - CRYPTO 2003
- Theory of Cryptography
- Public Key Cryptography – PKC 2004
- SCALLOP: scaling the CSI-FiSh
- Round-optimal oblivious transfer and MPC from computational CSIDH
- M-SIDH and MD-SIDH: countering SIDH attacks by masking information
- An efficient key recovery attack on SIDH
- A direct key recovery attack on SIDH
- Breaking SIDH in polynomial time
- Password-authenticated key exchange from group actions
- Full quantum equivalence of group action DLog and CDH, and more
- Cryptanalysis of an oblivious PRF from supersingular isogenies
- Two-round adaptively secure MPC from isogenies, LPN, or CDH
- An Attack on Some Signature Schemes Constructed from Five-Pass Identification Schemes
- Practical robust DKG protocols for CSIDH
- CSI-SharK: CSI-FiSh with sharing-friendly keys
- Towards post-quantum key-updatable public-key encryption via supersingular isogenies
This page was built for publication: New proof systems and an OPRF from CSIDH
