Pseudorandom Functions: Three Decades Later
From MaRDI portal
Publication:5021131
DOI10.1007/978-3-319-57048-8_3zbMath1481.94086OpenAlexW2604862294MaRDI QIDQ5021131
Publication date: 12 January 2022
Published in: Tutorials on the Foundations of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-57048-8_3
Related Items (14)
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 ⋮ Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes ⋮ Exploring crypto dark matter: new simple PRF candidates and their applications ⋮ 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 ⋮ Correlated pseudorandomness from expand-accumulate codes ⋮ Correlated pseudorandomness from the hardness of quasi-abelian decoding ⋮ Expand-convolute codes for pseudorandom correlation generators from LPN ⋮ Unnamed Item ⋮ Minicrypt primitives with algebraic structure and applications ⋮ Unnamed Item ⋮ Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions
Uses Software
Cites Work
- The average sensitivity of bounded-depth circuits
- Differential cryptanalysis of DES-like cryptosystems
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- One way functions and pseudorandom generators
- A hierarchy of polynomial time lattice basis reduction algorithms
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Factoring polynomials with rational coefficients
- Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
- Pseudorandom generators for space-bounded computation
- A polynomial-time algorithm for learning noisy linear threshold functions
- On the construction of pseudorandom permutations: Luby-Rackoff revisited
- Synthesizers and their application to the parallel construction of pseudo-random functions
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
- Provable security of (tweakable) block ciphers based on substitution-permutation networks
- Cryptographic lower bounds for learnability of Boolean functions on the uniform distribution
- On the Hardness of Learning with Rounding over Small Modulus
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Pseudorandomness for network algorithms
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Learning with Rounding, Revisited
- Key Homomorphic PRFs and Their Applications
- Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions
- Pseudorandomness for Regular Branching Programs via Fourier Analysis
- Constrained Pseudorandom Functions and Their Applications
- New and Improved Key-Homomorphic Pseudorandom Functions
- The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator
- Foiling Birthday Attacks in Length-Doubling Transformations
- Pseudorandom Functions and Lattices
- Bootstrapping Obfuscators via Fast Pseudorandom Functions
- SPRING: Fast Pseudorandom Functions from Rounded Ring Products
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- Candidate weak pseudorandom functions in AC 0 ○ MOD 2
- New Algorithms for Learning in Presence of Errors
- The GGM Construction Does NOT Yield Correlation Intractable Function Ensembles
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Constant depth circuits, Fourier transform, and learnability
- Efficient noise-tolerant learning from statistical queries
- Number-theoretic constructions of efficient pseudo-random functions
- The GGM Function Family Is a Weakly One-Way Family of Functions
- How to Encipher Messages on a Small Domain
- Solving Hidden Number Problem with One Bit Oracle and Advice
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Pseudo-random functions and factoring (extended abstract)
- Resettable zero-knowledge (extended abstract)
- Parity, circuits, and the polynomial-time hierarchy
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
- Keying Hash Functions for Message Authentication
- How to Protect DES Against Exhaustive Key Search
- Bloom Filters in Adversarial Environments
- From Selective to Adaptive Security in Functional Encryption
- SWIFFT: A Modest Proposal for FFT Hashing
- On Agnostic Learning of Parities, Monomials, and Halfspaces
- On Ideal Lattices and Learning with Errors over Rings
- Learning juntas
- Indistinguishability Amplification
- A theory of the learnable
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Simple Constructions of Almost k-wise Independent Random Variables
- On Threshold Circuits and Polynomial Computation
- A Pseudorandom Generator from any One-way Function
- Foundations of Cryptography
- Software protection and simulation on oblivious RAMs
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- The Shrinkage Exponent of de Morgan Formulas is 2
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
- 10.1162/153244302760200669
- Improved Mixing Time Bounds for the Thorp Shuffle
- Hardness Preserving Reductions via Cuckoo Hashing
- Analysis of Boolean Functions
- Public-key cryptosystems from the worst-case shortest vector problem
- How to use indistinguishability obfuscation
- Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
- FPGA Implementations of SPRING
- Communication Complexity and Quasi Randomness
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Reed-Muller codes achieve capacity on erasure channels
- Algebraic attacks against random local functions and their countermeasures
- Learning algorithms from natural proofs
- On the Implementation of Huge Random Objects
- On the (im)possibility of obfuscating programs
- Functional Signatures and Pseudorandom Functions
- Characterizing pseudoentropy and simplifying pseudorandom generator constructions
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Theory of Cryptography
- New Proofs for NMAC and HMAC: Security Without Collision-Resistance
- Natural proofs
- Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs
- On lattices, learning with errors, random linear codes, and cryptography
- Noise-tolerant learning, the parity problem, and the statistical query model
- Computational Complexity
- The BNS-Chung criterion for multi-party communication complexity
- A new proof of Szemerédi's theorem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Pseudorandom Functions: Three Decades Later
