Book Chapter10.1007/978-3-030-84259-8_17
Low-Complexity Weak Pseudorandom Functions in \(\mathtt {AC}0[\mathtt {MOD}2]\)
Elette Boyle,Geoffroy Couteau,Niv Gilboa,Yuval Ishai,Lisa Kohl,Peter Scholl +5 more
- 16 Aug 2021
- pp 487-516
2
TL;DR: Weak pseudorandom functions (WPRF) as mentioned in this paper are a keyed function that can be efficiently distinguished from totally random input-output pairs (x, y) under a random key k.
read more
Abstract: A weak pseudorandom function (WPRF) is a keyed function \(f_k:\{0,1\}^n\rightarrow \{0,1\}\) such that, for a random key k, a collection of samples \((x, f_k(x))\), for uniformly random inputs x, cannot be efficiently distinguished from totally random input-output pairs (x, y). We study WPRFs in \(\mathtt {AC}0[\mathtt {MOD}2] \), the class of functions computable by \(\mathtt {AC}0 \) circuits with parity gates, making the following contributions.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity
Zhiyuan Fan,Jiatu Li,Tianqi Yang +2 more
- 09 Jun 2022
TL;DR: The black-box natural proof barrier is introduced and it is shown that a large range of techniques for bootstrapping results cannot be combined with ”black-box” lower bound proofs to obtain a breakthrough.
Instantiating the Hash-Then-Evaluate Paradigm: Strengthening PRFs, PCFs, and OPRFs
Chris Brzuska,Geoffroy Couteau,Christoph Egger,Pihla Karanko,Pierre Meyer +4 more
TL;DR: This paper instantiates the hash-then-evaluate paradigm for PRFs, PCFs, and OPRFs, strengthening their security by replacing public pre-processing with a non-adaptive PRF, and demonstrates its applicability to secure multiparty computation and other cryptographic protocols.
References
A theory of the learnable
Leslie G. Valiant
- 05 Nov 1984
TL;DR: This paper regards learning as the phenomenon of knowledge acquisition in the absence of explicit programming, and gives a precise methodology for studying this phenomenon from a computational viewpoint.
On the inherent intractability of certain coding problems (Corresp.)
TL;DR: The fact that the general decoding problem for linear codes and the general problem of finding the weights of a linear code are both NP-complete is shown strongly suggests, but does not rigorously imply, that no algorithm for either of these problems which runs in polynomial time exists.
1.7K
Parity, circuits and the polynomial time hierarchy
TL;DR: A super-polynomial lower bound is given for the size of circuits of fixed depth computing the parity function and connections are given to the theory of programmable logic arrays and to the relativization of the polynomial-time hierarchy.
1.2K
Algebraic attacks on stream ciphers with linear feedback
Nicolas T. Courtois,Willi Meier +1 more
- 04 May 2003
TL;DR: This paper shows how to substantially lower the degree of these equations by multiplying them by well-chosen multivariate polynomials, and is able to break Toyocrypt in 249 CPU clocks, with only 20 Kbytes of keystream, the fastest attack proposed so far.
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
R. Smolensky
- 01 Jan 1987
TL;DR: It is proved that depth k circuits with gates NOT, OR and MODp where p is a prime require Exp(&Ogr;(n1/2k)) gates to calculate MODr functions for any r ≠ pm.