Pseudorandom correlation functions for garbled circuits
From MaRDI portal
Cites work
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- Advances in Cryptology - CRYPTO 2003
- Authenticated garbling from simple correlations
- Black-box reusable NISC with random oracles
- Breaking the circuit size barrier for secure computation under DDH
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
- Correlated pseudorandom functions from variable-density LPN
- Correlated pseudorandomness from expand-accumulate codes
- Correlated pseudorandomness from the hardness of quasi-abelian decoding
- Efficient non-interactive secure computation
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Efficient three-party computation from cut-and-choose
- Error detecting and error correcting codes
- Expand-convolute codes for pseudorandom correlation generators from LPN
- Function secret sharing
- Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
- Half-tree: halving the cost of tree expansion in COT and DPF
- Homomorphic secret sharing from lattices without FHE
- Homomorphic secret sharing from Paillier encryption
- Homomorphic secret sharing with verifiable evaluation
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- Improved Garbled Circuit: Free XOR Gates and Applications
- Improved private set intersection for sets with small entries
- Instantiating the hash-then-evaluate paradigm: strengthening PRFs, PCFs, and OPRFs
- Large message homomorphic secret sharing from DCR and applications
- LATIN 2004: Theoretical Informatics
- 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
- On homomorphic secret sharing from polynomial-modulus LWE
- Polynomial Codes Over Certain Finite Fields
- Pseudorandom correlation functions from variable-density LPN, revisited
- Reusable garbled circuits and succinct functional encryption
- Space/time trade-offs in hash coding with allowable errors
- The magic of ELFs
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
This page was built for publication: Pseudorandom correlation functions for garbled circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233203)
