Pseudorandom functions: three decades later
From MaRDI portal
Recommendations
Cites work
- 10.1162/153244302760200669
- A hierarchy of polynomial time lattice basis reduction algorithms
- A new proof of Szemerédi's theorem
- A polynomial-time algorithm for learning noisy linear threshold functions
- A Pseudorandom Generator from any One-way Function
- A theory of the learnable
- Algebraic attacks against random local functions and their countermeasures
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
- Analysis of Boolean Functions
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Bootstrapping Obfuscators via Fast Pseudorandom Functions
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate weak pseudorandom functions in \(\mathrm{AC}^0\circ\mathrm{MOD}_2\)
- Characterizing pseudoentropy and simplifying pseudorandom generator constructions
- Communication Complexity and Quasi Randomness
- Computational Complexity
- Constant depth circuits, Fourier transform, and learnability
- Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
- Constrained pseudorandom functions and their applications
- Constructing small-bias sets from algebraic-geometric codes
- Cryptographic lower bounds for learnability of Boolean functions on the uniform distribution
- Cryptography with constant computational overhead
- Differential cryptanalysis of DES-like cryptosystems
- Efficiency improvements in constructing pseudorandom generators from one-way functions
- Efficient noise-tolerant learning from statistical queries
- Factoring polynomials with rational coefficients
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Foiling birthday attacks in length-doubling transformations
- Foundations of Cryptography
- FPGA implementations of SPRING and their countermeasures against side-channel attacks
- From selective to adaptive security in functional encryption
- Functional signatures and pseudorandom functions
- Hardness of continuous local search: query complexity and cryptographic lower bounds
- Hardness preserving reductions via cuckoo hashing
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- How to Encipher Messages on a Small Domain
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- How to Protect DES Against Exhaustive Key Search
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 417582 (Why is no real title available?)
- scientific article; zbMATH DE number 4191103 (Why is no real title available?)
- scientific article; zbMATH DE number 4035726 (Why is no real title available?)
- scientific article; zbMATH DE number 1304081 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- scientific article; zbMATH DE number 1942446 (Why is no real title available?)
- scientific article; zbMATH DE number 2079924 (Why is no real title available?)
- scientific article; zbMATH DE number 6861917 (Why is no real title available?)
- scientific article; zbMATH DE number 1394292 (Why is no real title available?)
- scientific article; zbMATH DE number 1406792 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- Improved mixing time bounds for the Thorp shuffle
- Indistinguishability Amplification
- Introduction to modern cryptography.
- Key homomorphic PRFs and their applications
- Keying hash functions for message authentication
- Learning algorithms from natural proofs
- Learning juntas
- Learning with rounding, revisited. New reduction, properties and applications
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
- Natural proofs
- New Algorithms for Learning in Presence of Errors
- New and improved key-homomorphic pseudorandom functions
- New Proofs for NMAC and HMAC: Security Without Collision-Resistance
- Noise-tolerant learning, the parity problem, and the statistical query model
- Norms, XOR lemmas, and lower bounds for polynomials and protocols
- Number-theoretic constructions of efficient pseudo-random functions
- On agnostic learning of parities, monomials, and halfspaces
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On non-black-box simulation and the impossibility of approximate obfuscation
- On the (im)possibility of obfuscating programs
- On the construction of pseudorandom permutations: Luby-Rackoff revisited
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- On the hardness of learning with rounding over small modulus
- On the implementation of huge random objects
- On Threshold Circuits and Polynomial Computation
- One way functions and pseudorandom generators
- Parity, circuits, and the polynomial-time hierarchy
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Provable security of (tweakable) block ciphers based on substitution-permutation networks
- Pseudo-random functions and factoring (extended abstract)
- Pseudorandom functions and lattices
- Pseudorandom generators for space-bounded computation
- Pseudorandomness for network algorithms
- Pseudorandomness for regular branching programs via Fourier analysis
- Public-key cryptosystems from the worst-case shortest vector problem
- Reed-Muller codes achieve capacity on erasure channels
- Resettable zero-knowledge (extended abstract)
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Simple Constructions of Almost k-wise Independent Random Variables
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Software protection and simulation on oblivious RAMs
- Solving Hidden Number Problem with One Bit Oracle and Advice
- SPRING: Fast Pseudorandom Functions from Rounded Ring Products
- Substitution-permutation networks, pseudorandom functions, and natural proofs
- SWIFFT: A Modest Proposal for FFT Hashing
- Synthesizers and their application to the parallel construction of pseudo-random functions
- The average sensitivity of bounded-depth circuits
- The BNS-Chung criterion for multi-party communication complexity
- The complexity of approximating a nonlinear program
- The GGM construction does NOT yield correlation intractable function ensembles
- The GGM Function Family Is a Weakly One-Way Family of Functions
- The impossibility of obfuscation with auxiliary input or a universal simulator
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The Shrinkage Exponent of de Morgan Formulas is 2
- Theory of Cryptography
- Tight bounds on the Fourier spectrum of \(\mathsf{AC}^0\)
Cited in
(26)- Synthesizers and their application to the parallel construction of pseudo-random functions
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\)
- Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions
- Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions
- From non-adaptive to adaptive pseudorandom functions
- Efficient pseudorandom functions via on-the-fly adaptation
- scientific article; zbMATH DE number 1302852 (Why is no real title available?)
- scientific article; zbMATH DE number 1418300 (Why is no real title available?)
- Limits on the efficiency of (ring) LWE based non-interactive key exchange
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- scientific article; zbMATH DE number 7561745 (Why is no real title available?)
- scientific article; zbMATH DE number 7250145 (Why is no real title available?)
- Minicrypt primitives with algebraic structure and applications
- Correlated pseudorandomness from expand-accumulate codes
- Correlated pseudorandomness from the hardness of quasi-abelian decoding
- Expand-convolute codes for pseudorandom correlation generators from LPN
- Subversion-resilient authenticated encryption without random oracles
- Limits of preprocessing
- A direct PRF construction from Kolmogorov complexity
- Stationary syndrome decoding for improved PCGs
- Attribute-based encryption using sum-product decomposition of Boolean functions
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- Performance improvement for the GGM-construction of pseudorandom functions
This page was built for publication: Pseudorandom functions: three decades later
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5021131)
