Abstract
A Boolean function b is a hard core predicate for a one-way function f if b is polynomial time computable but b(x) is difficult to predict from f(x). A general family of hard core predicates is a family of functions containing a hard core predicate for any one-way function. A seminal result of Goldreich and Levin asserts that the family of parity functions is a general family of hard core predicates. We show that no general family of hard core predicates can consist of functions with O(n 1−∈) average sensitivity, for any ∈ > 0. As a result, such families cannot consist of monotone functions, functions computed by generalized threshold gates, or symmetric d-threshold functions, for d = O(n 1/2−∈) and ∈ > 0. This also subsumes a 1997 result of Goldmann and Näslund which asserts that such families cannot consist of functions computable in AC0. The above bound on sensitivity is obtained by (lower) bounding the high order terms of the Fourier transform.
Part of this work was done while visiting McGill University
Supported by NSF NYI Grant No. CCR-9457799 and a David and Lucile Packard Fellowship for Science and Engineering. This research was done while the author was a postdoc at the University of Texas at Austin.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
H. Dym and H. P. McKean. Fourier Series and Integrals, volume 14 of Probability and Mathematical Statistics. Academic Press, 1972.
M. Goldmann and M. Näslund. The complexity of computing hard core predicates. In B. S. Kaliski Jr., editor, Advances in Cryptology—CRYPTO’ 97, volume 1294 of Lecture Notes in Computer Science, pages 1–15. Springer-Verlag, 17–20 Aug. 1997.
O. Goldreich. Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Springer-Verlag, 1999.
O. Goldreich and L. A. Levin. A hard-core predicate for all one-way functions. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 25–32, Seattle, Washington, 15–17 May 1989.
S. Goldwasser and S. Micali. Probabilistic encryption. J. Comput. Syst. Sci., 28(2):270–299, Apr. 1984.
C. Gotsman and N. Linial. Spectral properties of threshold functions. Combinatorica, 14(1):35–50, 1994.
J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby. Construction of a pseudorandom generator from any one-way function. SIAM J. Comp., 28(4):1364–1396, 1998.
J. Kahn, G. Kalai, and N. Linial. The influence of variables on Boolean functions (extended abstract). In 29th Annual Symposium on Foundations of Computer Science, pages 68–80, White Plains, New York, 24–26 Oct. 1988. IEEE.
N. Linial. Private communication. December, 1998.
N. Linial, Y. Mansour, and N. Nisan. Constant depth circuits, Fourier transform, and learnability. Journal of the ACM, 40(3): 607–620, 1993.
M. Luby. Pseudorandomness and Cryptographic Applications. Princeton University Press, 1996.
Y. Mansour, N. Nisan, and P. Tiwari. The computational complexity of universal hashing. Theoretical Computer Science, 107(1):121–133, 4 Jan. 1993.
M. Näslund. Universal hash functions and hard core bits. In EUROCRYPT: Advances in Cryptology: Proceedings of EUROCRYPT, 1995.
M. Näslund. All bits in ax+b mod p are hard (extended abstract). In N. Koblitz, editor, Advances in Cryptology—CRYPTO’ 96, volume 1109 of Lecture Notes in Computer Science, pages 114–128. Springer-Verlag, 18–22 Aug. 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goldmann, M., Russell, A. (2000). Spectral Bounds on General Hard Core Predicates. In: Reichel, H., Tison, S. (eds) STACS 2000. STACS 2000. Lecture Notes in Computer Science, vol 1770. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46541-3_51
Download citation
DOI: https://doi.org/10.1007/3-540-46541-3_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67141-1
Online ISBN: 978-3-540-46541-6
eBook Packages: Springer Book Archive