Sampling graphs without forbidden subgraphs and unbalanced expanders with negligible error

DOI10.1109/FOCS.2019.00020MaRDI QIDQ6944217zbMATH OpenFDO

Authors Eliran Kachlon, Benny Applebaum

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2019.00020

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(7)

• Authenticated BitGC for actively secure rate-one 2PC
• \textsf{BitGC}: garbled circuits with 1 bit per gate
• Somewhat homomorphic encryption from linear homomorphism and sparse LPN
• Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
• Indistinguishability obfuscation from well-founded assumptions
• Improved search-to-decision reduction for random local functions
• Structured-seed local pseudorandom generators and their applications

This page was built for publication: Sampling graphs without forbidden subgraphs and unbalanced expanders with negligible error

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6944217)