Fast Pseudorandom Functions Based on Expander Graphs (Q3179351): 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: A Dichotomy for Local Small-Bias Generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-key cryptography from different assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas / 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: Pseudorandom Generators with Long Stretch and Low Locality from Random Local One-Way Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bootstrapping Obfuscators via Fast Pseudorandom Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic Hardness of Random Local Functions–Survey / 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: Q4341754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple permutations mix even better / rank
 
Normal rank
Property / cites work
 
Property / cites work: From non-adaptive to adaptive pseudorandom functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Functions and Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the security of Goldreich's one-way function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Input locality and hardness amplification / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the One-Way Function Candidate Proposed by Goldreich / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator / rank
 
Normal rank
Property / cites work
 
Property / cites work: From average case complexity to improper learning complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Random Satisfiability Problems with Planted Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3729902 / 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: An Almost <i>m</i>-wise Independent Random Permutation of the Cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional Encryption with Bounded Collusions via Multi-party Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for exponentiation in finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pseudorandom Generator from any One-way Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple permutations mix well / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic hardness of distribution-specific learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic hardness for learning intersections of halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Prefix Computation / 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: Bounds to Complexities of Networks for Sorting and for Switching / 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: 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: Q2768333 / 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: Relations Among Complexity Measures / 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: Q3762226 / rank
 
Normal rank

Latest revision as of 05:23, 13 July 2024

scientific article
Language Label Description Also known as
English
Fast Pseudorandom Functions Based on Expander Graphs
scientific article

    Statements

    Fast Pseudorandom Functions Based on Expander Graphs (English)
    0 references
    0 references
    0 references
    21 December 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references