Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Candidate weak pseudorandom functions in AC <sup>0</sup> ○ MOD <sub>2</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ciphers for MPC and FHE / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on average case vs approximation complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Generators with Long Stretch and Low Locality from Random Local One-Way Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Attacks against Random Local Functions and Their Countermeasures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pseudorandom Functions Based on Expander Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithms for Learning in Presence of Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5875794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Functions and Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the inherent intractability of certain coding problems (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Functions: Three Decades Later / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring crypto dark matter: new simple PRF candidates and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic independence fools <i>AC</i> <sup>0</sup> circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning algorithms from natural proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking the circuit size barrier for secure computation under quasi-polynomial LPN / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of approximating the minimum distance of a linear code / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Agnostic Learning of Parities, Monomials, and Halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5092467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity, circuits, and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Candidate One-Way Functions Based on Expander Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On PAC learning algorithms for rich Boolean function classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient membership-query algorithm for learning DNF with respect to the uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic limitations on learning Boolean formulae and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic hardness of distribution-specific learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant depth circuits, Fourier transform, and learnability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ε‐biased generators in NC<sup>0</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Bias Probability Spaces: Efficient Constructions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number-theoretic constructions of efficient pseudo-random functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-random functions and factoring (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rise of Paillier: homomorphic secret sharing and public-key silent OT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4343439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of computing the minimum distance of a code / rank
 
Normal rank
Property / cites work
 
Property / cites work: The communication complexity of addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural Proofs versus Derandomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN / rank
 
Normal rank

Latest revision as of 00:38, 29 July 2024

scientific article
Language Label Description Also known as
English
Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\)
scientific article

    Statements

    Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 May 2022
    0 references
    WPRF by sparse polynomials
    0 references
    weak pseudorandom function
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers