scientific article; zbMATH DE number 7561745

DOI10.4230/LIPICS.CCC.2020.17MaRDI QIDQ5092467FDOQ5092467

Authors: Yuval Filmus, Yuval Ishai, Avi Kaplan, Guy Kindler 

Publication date: 21 July 2022

Title of this publication is not available (Why is that?)

zbMATH Keywords

IPPPcircuitcommunication complexitypreprocessingPRFsimultaneous messages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• \(\Sigma_ 1^ 1\)-formulae on finite structures
• Extractors for Circuit Sources
• Efficient noise-tolerant learning from statistical queries
• On the randomness complexity of efficient sampling
• Graph complexity
• On a theorem of Razborov
• Weakly learning DNF and characterizing statistical query learning using Fourier analysis
• Title not available (Why is that?)
• Pseudorandom functions and lattices
• Communication Complexity of Simultaneous Messages
• Pseudorandom Functions: Three Decades Later
• Exploring crypto dark matter: new simple PRF candidates and their applications
• Candidate weak pseudorandom functions in AC ⁰ ○ MOD ₂
• How to compute under \({\mathcal{AC}}^{0}\) leakage without secure hardware
• Unconditionally secure computation against low-complexity leakage
• Probabilistic rank and matrix rigidity
• Matrix rigidity and the Croot-Lev-Pach lemma
• Title not available (Why is that?)
• From average case complexity to improper learning complexity
• AC^0 o MOD_2 Lower Bounds for the Boolean Inner Product.
• Title not available (Why is that?)

Cited In (5)

• Recent Developments in the Theory of Pre-processing
• Limits of preprocessing
• Preprocessing under uncertainty
• Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\)
• MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications

This page was built for publication:

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