Abstract
We study the following natural question: Which cryptographic primitives (if any) can be realized by functions with constant input locality, namely functions in which every bit of the input influences only a constant number of bits of the output? This continues the study of cryptography in low complexity classes. It was recently shown by Applebaum et al. (FOCS 2004) that, under standard cryptographic assumptions, most cryptographic primitives can be realized by functions with constant output locality, namely ones in which every bit of the output is influenced by a constant number of bits from the input.
We (almost) characterize what cryptographic tasks can be performed with constant input locality. On the negative side, we show that primitives which require some form of non-malleability (such as digital signatures, message authentication, or non-malleable encryption) cannot be realized with constant input locality. On the positive side, assuming the intractability of certain problems from the domain of error correcting codes (namely, hardness of decoding a random binary linear code or the security of the McEliece cryptosystem), we obtain new constructions of one-way functions, pseudorandom generators, commitments, and semantically-secure public-key encryption schemes whose input locality is constant. Moreover, these constructions also enjoy constant output locality and thus they give rise to cryptographic hardware that has constant-depth, constant fan-in and constant fan-out. As a byproduct, we obtain a pseudorandom generator whose output and input locality are both optimal (namely, 3).
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
M. Alekhnovich, More on average case vs approximation complexity, in Proc. 44th FOCS, 2003, pp. 298–307
B. Applebaum, Y. Ishai, E. Kushilevitz, Computationally private randomizing polynomials and their applications. Comput. Complex. 15(2), 115–162 (2006). Preliminary version in Proc. 20th CCC, 2005
B. Applebaum, Y. Ishai, E. Kushilevitz, Cryptography in NC0. SIAM J. Comput. 36(4), 845–888 (2006). Preliminary version in Proc. 45th FOCS, 2004
B. Applebaum, Y. Ishai, E. Kushilevitz, On pseudorandom generators with linear stretch in NC0, in Proc. 10th Random, 2006
B. Applebaum, Y. Ishai, E. Kushilevitz, Cryptography with constant latency. Manuscript, 2009
S. Arora, S. Safra, Probabilistic checking of proofs: A new characterization of np. J. ACM 45(1), 70–122 (1998). Preliminary version in Proc. 33rd FOCS, 1992
S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems. J. ACM 45(3), 501–555 (1998). Preliminary version in Proc. 33rd FOCS, 1992
L. Babai, Random oracles separate PSPACE from the polynomial-time hierarchy. Inf. Process. Lett. 26(1), 51–53 (1987)
E.R. Berlekamp, R.J. McEliece, H.C. van Tilborg, On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24(3), 384–386 (1978)
M. Blum, Coin flipping by telephone: a protocol for solving impossible problems. SIGACT News 15(1), 23–27 (1983)
M. Blum, S. Micali, How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput. 13, 850–864 (1984). Preliminary version in Proc. 23rd FOCS, 1982
A. Blum, M. Furst, M. Kearns, R.J. Lipton, Cryptographic primitives based on hard learning problems, in Advances in Cryptology: Proc. of CRYPTO ’93, LNCS, vol. 773 (1994), pp. 278–291
A. Blum, A. Kalai, H. Wasserman, Noise-tolerant learning, the parity problem, and the statistical query model. J. ACM 50(4), 506–519 (2003). Preliminary version in Proc. 32nd STOC, 2000
R.B. Boppana, J.C. Lagarias, One-way functions and circuit complexity. Inf. Comput. 74(3), 226–240 (1987)
S.A. Cook, The complexity of theorem-proving procedures, in STOC ’71: Proceedings of the Third Annual ACM Symposium on Theory of Computing, New York, NY, USA (ACM Press, New York, 1971), pp. 151–158
M. Cryan, P.B. Miltersen, On pseudorandom generators in NC0, in Proc. 26th MFCS, 2001, pp. 272–284
D. Dolev, C. Dwork, M. Naor, Non-malleable cryptography. SIAM J. Comput. 30(2), 391–437 (2000)
U. Feige, J. Killian, M. Naor, A minimal model for secure computation (extended abstract), in Proc. of the 26th STOC, 1994, pp. 554–563
V. Feldman, P. Gopalan, S. Khot, A.K. Ponnuswami, New results for learning noisy parities and halfspaces, in Proc. 47th FOCS, 2006, pp. 563–574
O. Goldreich, Candidate one-way functions based on expander graphs. Electron. Colloq. Comput. Complex. (ECCC) 7(090) (2000)
O. Goldreich, Foundations of Cryptography: Basic Tools (Cambridge University Press, Cambridge, 2001)
O. Goldreich, Foundations of Cryptography: Basic Applications (Cambridge University Press, Cambridge, 2004)
O. Goldreich, L. Levin, A hard-core predicate for all one-way functions, in Proc. 21st STOC, 1989, pp. 25–32
O. Goldreich, S. Goldwasser, S. Micali, How to construct random functions. J. ACM 33, 792–807 (1986)
O. Goldreich, H. Krawczyk, M. Luby, On the existence of pseudorandom generators. SIAM J. Comput. 22(6), 1163–1175 (1993). Preliminary version in Proc. 29th FOCS, 1988
S. Goldwasser, S. Micali, Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270–299 (1984). Preliminary version in Proc. STOC ’82
J. Håstad, R. Impagliazzo, L.A. Levin, M. Luby, A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364–1396 (1999)
T. Holenstein, Pseudorandom generators from one-way functions: A simple construction for any hardness, in Proc. 3rd TCC, 2006, pp. 443–461
N.J. Hopper, M. Blum, Secure human identification protocols, in Advances in Cryptology: Proc. of ASIACRYPT ’01, LNCS, vol. 2248 (2001), pp. 52–66
R. Impagliazzo, M. Luby, One-way functions are essential for complexity based cryptography, in Proc. of the 30th FOCS, 1989, pp. 230–235
R. Impagliazzo, M. Naor, Efficient cryptographic schemes provably as secure as subset sum. J. Cryptol. 9(4), 199–216 (1996). Preliminary version in FOCS ’89
Y. Ishai, E. Kushilevitz, Randomizing polynomials: A new representation with applications to round-efficient secure computation, in Proc. 41st FOCS, 2000, pp. 294–304
Y. Ishai, E. Kushilevitz, Perfect constant-round secure computation via perfect randomizing polynomials, in Proc. 29th ICALP, 2002, pp. 244–256
H. Janwa, O. Moreno, Mceliece public key cryptosystems using algebraic-geometric codes. Des. Codes Cryptogr. 8(3), 293–307 (1996)
A. Juels, S. Weis, Authenticating pervasive devices with human protocols, in Advances in Cryptology: Proc. of CRYPTO ’05, LNCS, vol. 3621 (2005), pp. 293–308
J. Katz, J.-S. Shin, Parallel and concurrent security of the hb and hb+ protocols, in Advances in Cryptology: Proc. of Eurocrypt 06’, LNCS, vol. 4004 (2006), pp. 73–87
J. Katz, M. Yung, Complete characterization of security notions for probabilistic private-key encryption, in Proc. 32nd STOC, 2000, pp. 245–254
M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R.E. Schapire, L. Sellie, On the learnability of discrete distributions, in Proc. 26th STOC, 1994, pp. 273–282
M.J. Kearns, Efficient noise-tolerant learning from statistical queries. J. ACM 45(6), 983–1006 (1998)
J. Kilian, Founding cryptography on oblivious transfer, in Proc. 20th STOC, 1988, pp. 20–31
L.A. Levin, Universal sequential search problems. PINFTRANS: Probl. Inf. Transm. Translated from Problemy Peredachi Informatsii (Russian) 9 (1973)
N. Linial, Y. Mansour, N. Nisan, Constant depth circuits, Fourier transform, and learnability. J. ACM 40(3), 607–620 (1993). Preliminary version in Proc. 30th FOCS, 1989
V. Lyubashevsky, The parity problem in the presence of noise, decoding random linear codes, and the subset sum problem, in Proc. 9th Random, 2005
R.J. McEliece, A public-key cryptosystem based on algebraic coding theory. Technical Report DSN PR 42-44, Jet Prop. Lab., 1978
E. Mossel, A. Shpilka, L. Trevisan, On ε-biased generators in NC0, in Proc. 44th FOCS, 2003, pp. 136–145
M. Naor, O. Reingold, Synthesizers and their application to the parallel construction of pseudo-random functions. J. Comput. Syst. Sci. 58(2), 336–375 (1999). Preliminary version in Proc. 36th FOCS, 1995
C. Papadimitriou, M. Yannakakis, Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43, 425–440 (1991). Preliminary version in Proc. 20th STOC, 1988
O. Regev, On lattices, learning with errors, random linear codes, and cryptography, in Proc. 37th STOC, 2005, pp. 84–93
M. Sudan, Algorithmic introduction to coding theory—lecture notes, 2002. http://theory.csail.mit.edu/~madhu/FT01/
R. Varshamov, Estimate of the number of signals in error correcting codes. Dokl. Akad. Nauk SSSR 117, 739–741 (1957)
E. Viola, On constructing parallel pseudorandom generators from one-way functions, in Proc. IEEE Conference on Computational Complexity 2005, pp. 183–197
A.C. Yao, Theory and application of trapdoor functions, in Proc. 23rd FOCS, 1982, pp. 80–91
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by I. Damgaard
This paper was solicted by the Editors-in-Chief as one of the best papers from EUROCRYPT 2008, based on the recommendation of the program committee.
Research supported by grant 1310/06 from the Israel Science Foundation.
Supported by NSF grants CNS-0627526, CCF-0426582 and CCF-0832797. Most of this work done while studying in the Technion.
Supported by BSF grant 2004361 and NSF grants 0205594, 0430254, 0456717, 0627781, 0716389.
Supported by grant 2002354 from the U.S.-Israel Binational Science Foundation.
Rights and permissions
About this article
Cite this article
Applebaum, B., Ishai, Y. & Kushilevitz, E. Cryptography with Constant Input Locality. J Cryptol 22, 429–469 (2009). https://doi.org/10.1007/s00145-009-9039-0
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00145-009-9039-0