New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
From MaRDI portal
Publication:2051795
Recommendations
- Cryptographic hardness for learning intersections of halfspaces
- When won't membership queries help?
- On the hardness of learning intersections of two halfspaces
- Cryptographic lower bounds for learnability of Boolean functions on the uniform distribution
- Complexity theoretic hardness results for query learning
Cites work
- A theory of the learnable
- Advances in Cryptology - CRYPTO 2003
- Advances in cryptology -- CRYPTO 2014. 34th annual cryptology conference, Santa Barbara, CA, USA, August 17--21, 2014. Proceedings, Part I
- Advances in cryptology -- CRYPTO 2017. 37th annual international cryptology conference, Santa Barbara, CA, USA, August 20--24, 2017. Proceedings. Part I
- An invariance principle for polytopes
- Black-box obfuscation for \(d\)-CNFs
- Candidate Multilinear Maps from Ideal Lattices
- Correcting errors without leaking partial information
- Cryptanalysis of GGH map
- Cryptanalysis of the multilinear map over the integers
- Cryptographic hardness for learning intersections of halfspaces
- Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers
- Foundations of Cryptography
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption over the integers with shorter public keys
- Fully homomorphic encryption using ideal lattices
- Graph-induced multilinear maps from lattices
- How to obfuscate programs directly
- How to Shuffle in Public
- scientific article; zbMATH DE number 5485546 (Why is no real title available?)
- scientific article; zbMATH DE number 1088253 (Why is no real title available?)
- scientific article; zbMATH DE number 1775397 (Why is no real title available?)
- Impossibility of VBB obfuscation with ideal constant-degree graded encodings
- Indistinguishability obfuscation for Turing machines: constant overhead and amortization
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from constant-degree graded encoding schemes
- Indistinguishability obfuscation from functional encryption
- Indistinguishability obfuscation from semantically-secure multilinear encodings
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Indistinguishability obfuscation: from approximate to exact
- Learning an intersection of a constant number of halfspaces over a uniform distribution
- Learning intersections and thresholds of halfspaces
- Learning intersections of halfspaces with a margin
- New Multilinear Maps Over the Integers
- New negative results on differing-inputs obfuscation
- Obfuscating circuits via composite-order graded encoding
- Obfuscating Point Functions with Multibit Output
- Obfuscation of hyperplane membership
- On extractability obfuscation
- On obfuscating point functions
- On obfuscation with random oracles
- On the (im)possibility of obfuscating programs
- On the complexity of polyhedral separability
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- PAC learning intersections of halfspaces with membership queries
- Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
- Perfect NIZK with Adaptive Soundness
- Practical multilinear maps over the integers
- Protecting obfuscation against algebraic attacks
- Secure obfuscation for encrypted signatures
- Securely Obfuscating Re-encryption
- Security analysis of multilinear maps over the integers
- The impossibility of obfuscation with auxiliary input or a universal simulator
- Theory of cryptography. 11th theory of cryptography conference, TCC 2014, San Diego, CA, USA, February 24--26, 2014. Proceedings
- Theory of cryptography. 12th theory of cryptography conference, TCC 2015, Warsaw, Poland, March 23--25, 2015. Proceedings, Part II
- Theory of cryptography. 4th theory of cryptography conference, TCC 2007, Amsterdam, The Netherlands, February 21--24, 2007. Proceedings.
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- When won't membership queries help?
Cited in
(2)
This page was built for publication: New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051795)
