Almost pairwise independence and resilience to deep learning attacks
From MaRDI portal
Cites work
- A recursive construction of t-wise uniform permutations
- Almost \(k\)-wise independence versus \(k\)-wise independence
- BKZ 2.0: Better lattice security estimates
- Classical hardness of learning with errors
- Cryptographic limitations on learning Boolean formulae and finite automata
- Decorrelation: a theory for block cipher security
- Derandomized constructions of \(k\)-wise (almost) independent permutations
- Distribution-specific hardness of learning neural networks
- Efficient noise-tolerant learning from statistical queries
- scientific article; zbMATH DE number 2080649 (Why is no real title available?)
- scientific article; zbMATH DE number 1418297 (Why is no real title available?)
- scientific article; zbMATH DE number 2204782 (Why is no real title available?)
- Lizard: cut off the tail -- a practical post-quantum public-key encryption from LWE and LWR
- New hash functions and their use in authentication and set equality
- On lattices, learning with errors, random linear codes, and cryptography
- On the asymptotic complexity of solving LWE
- On the Boas-Bellman inequality in inner product spaces
- Pairwise Independence and Derandomization
- Protecting against multidimensional linear and truncated differential cryptanalysis by decorrelation
- Simple permutations mix well
- Statistical query algorithms for mean vector estimation and stochastic convex optimization
- The \(t\)-wise independence of substitution-permutation networks
- Universal classes of hash functions
- Variationally universal hashing
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis
This page was built for publication: Almost pairwise independence and resilience to deep learning attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326399)
