Threshold oblivious pseudorandom functions from isogeny group actions
From MaRDI portal
Cites work
- : a unified framework for computational verifiable secret sharing
- \textsf{CSI-RAShi}: distributed key generation for CSIDH
- A direct key recovery attack on SIDH
- A full proof of the BGW protocol for perfectly secure multiparty computation
- A post-quantum round-optimal oblivious PRF from isogenies
- Actively secure OT extension with optimal overhead
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Algorand: a secure and efficient distributed ledger
- An efficient key recovery attack on SIDH
- An isogeny-based ID protocol using structured public keys
- Breaking SIDH in polynomial time
- Collapse-binding quantum commitments without random oracles
- Compact, efficient and UC-secure isogeny-based oblivious transfer
- Composable oblivious pseudo-random functions via garbled circuits
- Computational verifiable secret sharing revisited
- Cryptanalysis of an oblivious PRF from supersingular isogenies
- Crypto dark matter on the torus. Oblivious PRFs from shallow PRFs and TFHE
- Cryptographic group actions and applications
- CSI-FiSh: efficient isogeny based signatures through class group computations
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Faster proofs and VRFs from isogenies
- Faster SCALLOP from non-prime conductor suborders in medium sized quadratic fields
- General secure multi-party computation from any linear secret-sharing scheme
- How to share a secret
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- scientific article; zbMATH DE number 177618 (Why is no real title available?)
- scientific article; zbMATH DE number 4187706 (Why is no real title available?)
- M-SIDH and MD-SIDH: countering SIDH attacks by masking information
- New proof systems and an OPRF from CSIDH
- Number-theoretic constructions of efficient pseudo-random functions
- Oblivious pseudorandom functions from isogenies
- On actively secure fine-grained access structures from isogeny assumptions
- OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
- Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
- Outsourced pattern matching
- PEGASIS: practical effective class group action using 4-dimensional isogenies
- Practical robust DKG protocols for CSIDH
- Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- Round-robin is optimal: lower bounds for group action based protocols
- SCALLOP-HD: group action from 2-dimensional isogenies
- SCALLOP: scaling the CSI-FiSh
- Simple two-message OT in the explicit isogeny model
- The 2Hash OPRF framework and efficient post-quantum instantiations
- Theory of Cryptography
- Threshold schemes from isogeny assumptions
- TOPPSS: cost-minimal password-protected secret sharing based on threshold OPRF
- Transaction protection by beacons
- Universally composable security: a new paradigm for cryptographic protocols
- Verifiable oblivious pseudorandom functions from lattices: practical-ish and thresholdisable
- Verifiable random functions
- VSS from distributed ZK proofs and applications
This page was built for publication: Threshold oblivious pseudorandom functions from isogeny group actions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7390879)
