Q5092467
type: Item
instance of: scholarly article
author: Yuval Filmus
author: Yuval Ishai
author: Avi Kaplan
author: Guy Kindler
publication date: 2022-07-21T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7561745
zbMATH Keywords: circuit
zbMATH Keywords: communication complexity
zbMATH Keywords: IPPP
zbMATH Keywords: preprocessing
zbMATH Keywords: PRF
zbMATH Keywords: simultaneous messages
MaRDI profile type: MaRDI publication profile
cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures
cites work: Candidate weak pseudorandom functions in AC 0 ○ MOD 2
cites work: Probabilistic rank and matrix rigidity
cites work: Communication Complexity of Simultaneous Messages
cites work: Pseudorandom Functions and Lattices
cites work: Weakly learning DNF and characterizing statistical query learning using Fourier analysis
cites work: Unconditionally secure computation against low-complexity leakage
cites work: Pseudorandom Functions: Three Decades Later
cites work: Exploring crypto dark matter: new simple PRF candidates and their applications
cites work: AC^0 o MOD_2 Lower Bounds for the Boolean Inner Product.
cites work: From average case complexity to improper learning complexity
cites work: Q4645675
cites work: On the randomness complexity of efficient sampling
cites work: Matrix rigidity and the Croot-Lev-Pach lemma
cites work: Efficient noise-tolerant learning from statistical queries
cites work: Graph complexity
cites work: How to Compute under $${\mathcal {\varvec{AC}}}^\mathbf{0}$$ Leakage without Secure Hardware
cites work: Q5111145
cites work: Q3250141
cites work: Extractors for Circuit Sources
cites work: On a theorem of Razborov
DOI: 10.4230/LIPICS.CCC.2020.17
description: scientific article; zbMATH DE number 7561745