Exploring crypto dark matter: new simple PRF candidates and their applications
From MaRDI portal
Publication:1631360
DOI10.1007/978-3-030-03810-6_25zbMath1430.94059OpenAlexW2899793533MaRDI QIDQ1631360
Alain Passelègue, Amit Sahai, Dan Boneh, David J. Wu, Yuval Ishai
Publication date: 6 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03810-6_25
Related Items (15)
Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2\)] ⋮ MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications ⋮ Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions ⋮ On the algebraic immunity of direct sum constructions ⋮ Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization ⋮ Asymptotically quasi-optimal cryptography ⋮ Matrix PRFs: constructions, attacks, and applications to obfuscation ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ \texttt{POLKA}: towards leakage-resistant post-quantum CCA-secure public key encryption ⋮ On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator ⋮ Learning with physical rounding for linear and quadratic leakage functions ⋮ Direct computation of branching programs and its applications to more efficient lattice-based cryptography ⋮ Unnamed Item ⋮ Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions ⋮ Algorithms and lower bounds for de morgan formulas of low-communication leaf gates
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interpolating polynomials from their values
- Interpolation of polynomials given by straight-line programs
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Synthesizers and their application to the parallel construction of pseudo-random functions
- The complexity of sparse polynomial interpolation over finite fields
- Rasta: a cipher with low ANDdepth and few ANDs per bit
- LPN decoded
- Key Homomorphic PRFs and Their Applications
- New and Improved Key-Homomorphic Pseudorandom Functions
- Cryptography from Learning Parity with Noise
- Pseudorandom Functions and Lattices
- Ciphers for MPC and FHE
- Two Halves Make a Whole
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Candidate weak pseudorandom functions in AC 0 ○ MOD 2
- Testing low-degree polynomials over prime fields
- Candidate One-Way Functions Based on Expander Graphs
- Constant depth circuits, Fourier transform, and learnability
- Number-theoretic constructions of efficient pseudo-random functions
- Fast Pseudorandom Functions Based on Expander Graphs
- Pseudo-random functions and factoring (extended abstract)
- Sparse interpolation over finite fields via low-order roots of unity
- Improved Garbled Circuit: Free XOR Gates and Applications
- A theory of the learnable
- A Pseudorandom Generator from any One-way Function
- Testing Basic Boolean Formulae
- Cryptographic Hardness of Random Local Functions–Survey
- Pseudorandom Functions: Three Decades Later
- Cryptographic hardness of distribution-specific learning
- Learning algorithms from natural proofs
- : Increasing the Security and Efficiency of
- How to Garble Arithmetic Circuits
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
- Theory of Cryptography
- Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN
- The communication complexity of addition
- Natural proofs
- Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs
- Noise-tolerant learning, the parity problem, and the statistical query model
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
This page was built for publication: Exploring crypto dark matter: new simple PRF candidates and their applications
