Feebly secure cryptographic primitives
- 28 Downloads
In 1992, A. Hiltgen provided first construction of provably (slightly) secure cryptographic primitives, namely, feebly one-way functions. These functions are provably harder to invert than to compute, but the complexity (viewed as the circuit complexity over circuits with arbitrary binary gates) is amplified only by a constant factor (in Hiltgen’s works, the factor approaches 2).
In traditional cryptography, one-way functions are the basic primitive of private-key shemes, while public-key schemes are constructed using trapdoor functions. We continue Hiltgen’s work by providing examples of feebly secure trapdoor functions where the adversary is guaranteed to spend more time than honest participants (also by a constant factor). We give both a (simpler) linear and a (better) nonlinear construction. Bibliography: 25 titles.
KeywordsConstant Factor Circuit Complexity Cryptographic Primitive Trapdoor Function Honest Participant
Unable to display preview. Download preview PDF.
- 1.E. Allender, “Circuit complexity before the dawn of the new millennium,” in Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science (1996), pp. 1–18.Google Scholar
- 6.D. Grigoriev. E. A. Hirsch, and K. Pervyshev, “ A complete pulic-key cryptosystem,” Groups Complex. Cryptol., 1, 1–12 (2009).Google Scholar
- 8.J. Håstad, Computational Limitations for Small Depth Circuits, MIT Press, Cambridge, Massachusetts (1987).Google Scholar
- 9.A. P. Hiltgen, “Constructions of feebly-one-way families of permutations,” in: Proceedings of AsiaCrypt’ 92 (1992), pp. 422–434.Google Scholar
- 10.A. P. Hiltgen, “Cryptographically relevant contributions to combinatorial complexity theory,” ETH-Zürich Dissertation, Hartung–Gorre Verlag, Konstanz (1994).Google Scholar
- 13.K. Iwama, O. Lachish, H. Morizumi, and R. Raz, “An explicit lower bound of 5n − o(n) for Boolean circuits,” in: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (2001), pp. 399–408.Google Scholar
- 14.E. A Lamagna and J. E. Savage, “On the logical complexity of symmetric switching functions in monotone and complete bases,” Technical Report, Brown University, Rhode Island (1973).Google Scholar
- 16.J. Massey, “The difficulty with difficulty,” a guide to the transparencies from the EUROCRYPT’96 IACR distinguished lecture (1996).Google Scholar
- 17.O. Melanich, “Nonlinear feebly secure cryptographic primitives,” PDMI Preprint 12/2009 (2009).Google Scholar
- 24.G. S. Vernam, “Cipher printing telegraph system for secret wire and radio telegraphic communications,” J. IEEE, 55, 109–115 (1926).Google Scholar