Exploring crypto dark matter: new simple PRF candidates and their applications
type: Item
instance of: scholarly article
title: Exploring crypto dark matter: new simple PRF candidates and their applications
zbMATH Open document ID: 1430.94059
DOI: 10.1007/978-3-030-03810-6_25
author: Dan Boneh
author: Yuval Ishai
author: Alain Passelègue
author: Amit Sahai
author: David J. Wu
publication date: 2018-12-06T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6989759
MaRDI profile type: Publication
full work available at URL: 978-3-030-03810-6 25
OpenAlex ID: W2899793533
cites work: Candidate weak pseudorandom functions in AC 0 ○ MOD 2
cites work: Ciphers for MPC and FHE
cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
cites work: Cryptographic Hardness of Random Local Functions–Survey
cites work: How to Garble Arithmetic Circuits
cites work: Fast Pseudorandom Functions Based on Expander Graphs
cites work: Sparse interpolation over finite fields via low-order roots of unity
cites work: New and Improved Key-Homomorphic Pseudorandom Functions
cites work: Pseudorandom Functions and Lattices
cites work: Q2707451
cites work: Learning Behaviors of Automata from Multiplicity and Equivalence Queries
cites work: Q4341754
cites work: Noise-tolerant learning, the parity problem, and the statistical query model
cites work: Pseudorandom Functions: Three Decades Later
cites work: Key Homomorphic PRFs and Their Applications
cites work: Learning algorithms from natural proofs
cites work: Theory of Cryptography
cites work: Rasta: a cipher with low ANDdepth and few ANDs per bit
cites work: Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
cites work: LPN decoded
cites work: Interpolation of polynomials given by straight-line programs
cites work: : Increasing the Security and Efficiency of
cites work: Candidate One-Way Functions Based on Expander Graphs
cites work: On the Cryptographic Applications of Random Functions (Extended Abstract)
cites work: Q3729902
cites work: A Pseudorandom Generator from any One-way Function
cites work: Q3549728
cites work: Testing low-degree polynomials over prime fields
cites work: Cryptographic hardness of distribution-specific learning
cites work: Improved Garbled Circuit: Free XOR Gates and Applications
cites work: Constant depth circuits, Fourier transform, and learnability
cites work: Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs
cites work: Q4231922
cites work: Synthesizers and their application to the parallel construction of pseudo-random functions
cites work: Number-theoretic constructions of efficient pseudo-random functions
cites work: Pseudo-random functions and factoring (extended abstract)
cites work: Testing Basic Boolean Formulae
cites work: Cryptography from Learning Parity with Noise
cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
cites work: Natural proofs
cites work: A theory of the learnable
cites work: The communication complexity of addition
cites work: The complexity of sparse polynomial interpolation over finite fields
cites work: Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN
cites work: Two Halves Make a Whole
cites work: Q3851616
cites work: Interpolating polynomials from their values
description: scientific article; zbMATH DE number 6989759