Combining oblivious pseudorandom functions
From MaRDI portal
Cites work
- A direct key recovery attack on SIDH
- A Framework for Efficient and Composable Oblivious Transfer
- A post-quantum round-optimal oblivious PRF from isogenies
- An efficient key recovery attack on SIDH
- Breaking SIDH in polynomial time
- Compact, efficient and UC-secure isogeny-based oblivious transfer
- 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
- Efficient and round-optimal oblivious transfer and commitment with adaptive security
- 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
- scientific article; zbMATH DE number 4187706 (Why is no real title available?)
- Hybrid password authentication key exchange in the UC framework
- Oblivious pseudorandom functions from isogenies
- On Robust Combiners for Oblivious Transfer and Other Primitives
- On Robust Combiners for Private Information Retrieval and Other Primitives
- On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding
- OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
- PAKE combiners and efficient post-quantum instantiations
- Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
- Robuster Combiners for Oblivious Transfer
- Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- Security analysis of the WhatsApp end-to-end encrypted backup protocol
- SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
- Supersingular curves you can trust
- The 2Hash OPRF framework and efficient post-quantum instantiations
- The relationship between public key encryption and oblivious transfer
- Theory of Cryptography
- Theory of Cryptography
- Universally composable security: a new paradigm for cryptographic protocols
- Verifiable oblivious pseudorandom functions from lattices: practical-ish and thresholdisable
This page was built for publication: Combining oblivious pseudorandom functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299793)