Abstract
The aim of the present article is to show how computational complexity can interfere with statistical inference in such a way that pieces of information that are completely equivalent from the point of view of information theory become very different computationally. In order to clarify this paradox, we will first describe concepts and techniques that have appeared these last years: asymptotic evaluation of computation time, probabilistic algorithms, one-way functions, zero knowledge proofs etc. Doing so, we will understand how these concepts allow creation and protection of secrecy by tools which are derived from precise mathematical problems that are publicly discussed. This is precisely the viewpoint of modern cryptography.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blum, L., Blum, M. and Shub, M.: 1983, ‘A simple secure pseudo-random generator’, in Advances in Cryptology, Crypto 82 (Chaum, D., Rivest, R.L. and Sherman, A.T. eds), Plenum Press: New-York, 61–78
Fiat, A. and Shamir, A.: 1986, ‘How to prove yourself: practical solutions to identification and signature problems’, in Advances in Cryptology, Crypto 86, Lect. Notes in Comp. Sci. 263, Springer Berlag: Berlin, 186–94
Goldwasser, S., Micali, S. and Rackoff, C: 1985, ‘The knowledge complexity of interactive proof systems’, in Proc. 17th ACM Symp. Theory of Computing, 291–304
Hastad, J., Impagliazzo, R., Levin, L. and Luby, M.: 1989, ‘Pseudo-random number generation from one-way functions’, in Proc. 21st ACM Symp. Theory of Computing, 12–24
Lenstra, A.K. and Manasse, M.: 1989, ‘Factoring by electronic mail’, in Advances in cryptology, Eurocrypt 89, Lect. Notes in Comp. Sci., 355–371
Rabin, M.O.: 1980, ‘Probabilistic algorithms for testing primality’, J. Numb. Theory 12, 128–138
Rivest, R., Shamir, A. and Adleman, L.: 1978, ‘A method for obtaining digital signatures and publc key cryptosystems’, Comm. ACM 21, 120–126
Shamir, A.: 1990, ‘IP = PSPACE’, in Proc. of the 31st IEEE Symp. on Foundations of Comp. Sci., 11–15
Solovay, R. and Strassen, V.: 1977, ‘A fast Monte-Carlo test for primality’, SIAM J. Comput. 6, 84–85
Stern, J.: 1987, ‘Secret linear congruential generators are not cryptographically secure’, in Proc. of the 28th IEEE Symp. on Foundations of Comp. Sci., 421–26
Stern, J.: 1990, Fondements Mathématiques de l’Informatique, Mac Graw Hill: Paris
Turing, A.M.: 1936, ‘On computable numbers, with an application to the Entscheidungsproblem’, Proc. London Math. Soc 2–42, 230–265 (Correction, ibid 2–43, 544–546)
Yao, A.C.: 1982, ‘Theory and applications of trapdoor functions’, in Proc. of the 23rd IEEE Symp. on Foundations of Comp. Sci., 80–91
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Stern, J. (1994). Statistical Inference, Zero Knowledge and Proofs of Identity. In: Grassberger, P., Nadal, JP. (eds) From Statistical Physics to Statistical Inference and Back. NATO ASI Series, vol 428. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-1068-6_10
Download citation
DOI: https://doi.org/10.1007/978-94-011-1068-6_10
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-4465-3
Online ISBN: 978-94-011-1068-6
eBook Packages: Springer Book Archive