The 2Hash OPRF framework and efficient post-quantum instantiations
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4187706 (Why is no real title available?)
- CSI-FiSh: efficient isogeny based signatures through class group computations
- CSIDH: an efficient post-quantum commutative group action
- Composable oblivious pseudo-random functions via garbled circuits
- Cryptanalysis of an oblivious PRF from supersingular isogenies
- Cryptanalysis of the generalised Legendre pseudorandom function
- Crypto dark matter on the torus. Oblivious PRFs from shallow PRFs and TFHE
- 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
- Exploring crypto dark matter: new simple PRF candidates and their applications
- LegRoast: efficient post-quantum signatures from the Legendre PRF
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
- OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- Oblivious pseudorandom functions from isogenies
- On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding
- Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
- Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- SCALLOP-HD: group action from 2-dimensional isogenies
- SCALLOP: scaling the CSI-FiSh
- Security analysis of the WhatsApp end-to-end encrypted backup protocol
- SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
- TOPPSS: cost-minimal password-protected secret sharing based on threshold OPRF
- Universally composable relaxed password authenticated key exchange
- Verifiable oblivious pseudorandom functions from lattices: practical-ish and thresholdisable
Cited in
(2)
This page was built for publication: The 2Hash OPRF framework and efficient post-quantum instantiations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891164)