Game changer: a modular framework for OPRF security
From MaRDI portal
Cites work
- A fast and simple partially oblivious PRF, with applications
- A formal treatment of end-to-end encrypted cloud storage
- 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
- Fast secure computation of set intersection
- scientific article; zbMATH DE number 1304081 (Why is no real title available?)
- Oblivious PRF on committed vector inputs and application to deduplication of encrypted data
- Oblivious pseudorandom functions from isogenies
- On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding
- OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
- Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- The 2Hash OPRF framework and efficient post-quantum instantiations
- The concrete security of two-party computation: simple definitions, and tight proofs for PSI and OPRFs
- Theory of Cryptography
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- TOPPSS: cost-minimal password-protected secret sharing based on threshold OPRF
- Verifiable oblivious pseudorandom functions from lattices: practical-ish and thresholdisable
This page was built for publication: Game changer: a modular framework for OPRF security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232849)
