Fast pseudorandom correlation functions from sparse LPN
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- scientific article; zbMATH DE number 1559560 (Why is no real title available?)
- scientific article; zbMATH DE number 7706037 (Why is no real title available?)
- A Unified Approach to MPC with Preprocessing Using OT
- A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions
- Advances in Cryptology - CRYPTO 2003
- Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions
- Code-based zero-knowledge from VOLE-in-the-head and their applications: simpler, faster, and smaller
- Correlated pseudorandom functions from variable-density LPN
- Correlated pseudorandomness from expand-accumulate codes
- Distributed Point Functions and Their Applications
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Expand-convolute codes for pseudorandom correlation generators from LPN
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Fast pseudorandom functions based on expander graphs
- Fast public-key silent OT and more from constrained Naor-Reingold
- Faster signatures from MPC-in-the-head
- Function secret sharing
- Improved private set intersection for sets with small entries
- Indistinguishability obfuscation from bilinear maps and LPN variants
- Instantiating the hash-then-evaluate paradigm: strengthening PRFs, PCFs, and OPRFs
- Lossy cryptography from code-based assumptions
- Low-complexity cryptographic hash functions
- Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
- Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
- Multiparty Computation from Somewhat Homomorphic Encryption
- Non-interactive threshold BBS+ from pseudorandom correlations
- Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks
- Oblivious transfer with constant computational overhead
- On Pseudorandom Generators with Linear Stretch in NC0
- On the soundness of algebraic attacks against code-based assumptions
- Overdrive: making SPDZ great again
- Pseudorandom correlation functions from variable-density LPN, revisited
- Public-key cryptography from different assumptions
- QuietOT: lightweight oblivious transfer with a public-key setup
- Really fast syndrome-based hashing
- Secure arithmetic computation with constant computational overhead
- Short signatures from regular syndrome decoding in the head
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Somewhat homomorphic encryption from linear homomorphism and sparse LPN
- Spooky Encryption and Its Applications
- The hardness of LPN over any integer ring and field for PCG applications
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- TinyKeys: a new approach to efficient multi-party computation
- Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions
- VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE
- XOR codes and sparse learning parity with noise
- \textsf{ReSolveD}: shorter signatures from regular syndrome decoding and VOLE-in-the-head
This page was built for publication: Fast pseudorandom correlation functions from sparse LPN
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232725)
