\textsc{Leap}: a fast, lattice-based OPRF with application to private set intersection
From MaRDI portal
Publication:6891191
Cites work
- A fast and simple partially oblivious PRF, with applications
- A post-quantum round-optimal oblivious PRF from isogenies
- Advances in Cryptology - CRYPTO 2003
- Composable oblivious pseudo-random functions via garbled circuits
- Cryptanalysis of an oblivious PRF from supersingular isogenies
- Crypto dark matter on the torus. Oblivious PRFs from shallow PRFs and TFHE
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Efficient pseudorandom correlation generators: silent OT extension and more
- Estimate all the \(\{\)LWE, NTRU\(\}\) schemes!
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Fast lattice-based encryption: stretching SPRING
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1256767 (Why is no real title available?)
- scientific article; zbMATH DE number 1418291 (Why is no real title available?)
- Improved alternating-moduli PRFs and post-quantum signatures
- Maliciously secure oblivious linear function evaluation with constant overhead
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
- New proof systems and an OPRF from CSIDH
- Number-theoretic constructions of efficient pseudo-random functions
- Oblivious PRF on committed vector inputs and application to deduplication of encrypted data
- Oblivious pseudorandom functions from isogenies
- Oblivious transfer and polynomial evaluation
- On lattices, learning with errors, random linear codes, and cryptography
- On the concrete hardness of learning with errors
- On the hardness of learning with rounding over small modulus
- OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
- Outsourced pattern matching
- Pseudorandom functions and lattices
- Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- SCALLOP: scaling the CSI-FiSh
- Secure two-party computation is practical
- Shorter hash-and-sign lattice-based signatures
- SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
- SPHF-friendly non-interactive commitments
- SPRING: Fast Pseudorandom Functions from Rounded Ring Products
- The simplest protocol for oblivious transfer
- Theory of Cryptography
- Verifiable oblivious pseudorandom functions from lattices: practical-ish and thresholdisable
- VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE
This page was built for publication: \textsc{Leap}: a fast, lattice-based OPRF with application to private set intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891191)
