Post-quantum public-key pseudorandom correlation functions for OT
From MaRDI portal
Cites work
- A decade of lattice cryptography
- A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions
- Advances in Cryptology - CRYPTO 2003
- Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
- Constrained PRFs for \(\mathrm{NC}^1\) in traditional groups
- Constrained pseudorandom functions and their applications
- Constrained pseudorandom functions for inner-product predicates from weaker assumptions
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Correlated pseudorandom functions from variable-density LPN
- Correlated pseudorandomness from expand-accumulate codes
- Correlated pseudorandomness from the hardness of quasi-abelian decoding
- Correlated-input secure hash functions
- Efficient multiparty protocols using circuit randomization
- Efficient pseudorandom correlation generators for any finite field
- 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
- Fast pseudorandom functions based on expander graphs
- Fast public-key silent OT and more from constrained Naor-Reingold
- Fast Reed-Solomon interactive oracle proofs of proximity
- FOLEAGE: \(\mathbb{F}_4\)OLE-based multi-party computation for Boolean circuits
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Functional signatures and pseudorandom functions
- scientific article; zbMATH DE number 1256767 (Why is no real title available?)
- Multi-key homomorphic secret sharing
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On ideal lattices and learning with errors over rings
- On the soundness of algebraic attacks against code-based assumptions
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
- Overdrive: making SPDZ great again
- Precomputing oblivious transfer
- Private constrained PRFs (and more) from LWE
- Privately constraining and programming PRFs, the LWE way
- Pseudorandom correlation functions from variable-density LPN, revisited
- Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
- QuietOT: lightweight oblivious transfer with a public-key setup
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Spooky Encryption and Its Applications
- Stationary syndrome decoding for improved PCGs
- Succinct homomorphic secret sharing
- 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
This page was built for publication: Post-quantum public-key pseudorandom correlation functions for OT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443582)