scientific article; zbMATH DE number 7561745
From MaRDI portal
Publication:5092467
DOI10.4230/LIPIcs.CCC.2020.17MaRDI QIDQ5092467
Yuval Filmus, Guy Kindler, Avi Kaplan, Yuval Ishai
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2\)] ⋮ MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a theorem of Razborov
- \(\Sigma_ 1^ 1\)-formulae on finite structures
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Graph complexity
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis
- Pseudorandom Functions and Lattices
- How to Compute under $${\mathcal {\varvec{AC}}}^\mathbf{0}$$ Leakage without Secure Hardware
- On the randomness complexity of efficient sampling
- Candidate weak pseudorandom functions in AC 0 ○ MOD 2
- Communication Complexity of Simultaneous Messages
- AC^0 o MOD_2 Lower Bounds for the Boolean Inner Product.
- Probabilistic rank and matrix rigidity
- Pseudorandom Functions: Three Decades Later
- Matrix rigidity and the Croot-Lev-Pach lemma
- Efficient noise-tolerant learning from statistical queries
- From average case complexity to improper learning complexity
- Extractors for Circuit Sources
- Unconditionally secure computation against low-complexity leakage
This page was built for publication:
