A new NP-complete problem and public-key identification

Designs, Codes, and Cryptography

Volumn 28, Issue 1, 2003, Pages 5-31

  Pointcheval, David ^a   Poupard, Guillaume ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b Direction Centrale de la Sécurité des Systèmes d'Information   (France)

Author keywords

(permuted) perceptrons problem; NP complete problem; simulated annealing; zero knowledge identification

Indexed keywords

EID: 84867955018     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021835718426     Document Type: Article

References (46)

1. T. Baritaud, M. Campana, P. Chauvaud and H. Gilbert, On the security of the permuted kernel identification scheme, In Crypto '92, LNCS, Vol. 740 Springer-Verlag, Berlin (1992) pp. 305-311.
2. E. B. Baum, D. Boneh and C. Garrett, On Genetic Algorithms, In Proc. of the 8th COLT, ACM Press, New York (1995) pp. 230-239.
3. M. Bellare and P. Rogaway, Random oracles are practical: a paradigm for designing efficient protocols, In Proc. of the 1st CCS, ACM Press, New York (1993) pp. 62-73.
4. E. F. Brickell and K. S. McCurley, An interactive identification scheme based on discrete logarithms and factoring, In Eurocrypt '90, LNCS, Vol. 473 Springer-Verlag, Berlin (1991) pp. 63-71.
5. E. F. Brickell K. S. McCurley 1992 An interactive identification scheme based on discrete logarithms and factoring Journal of Cryptology 5 29 39
6. F. Chabaud, On the security of some cryptosystems based on error-correcting codes, In Eurocrypt '94, LNCS, Vol. 950 Springer-Verlag, Berlin (1995) pp. 131-139.
7. I. B. Damgård, T. P. Pedersen and B. Pfitzmann, On the existence of statistically hiding bit-commitment schemes and fail-stop signatures, In Crypto '93, LNCS, Vol. 773 Springer-Verlag, Berlin (1994) pp. 250-267.
8. L. Davis (ed.), Genetics Algorithms and Simulated Annealing, Pitman, London (1987).
9. A. Fiat and A. Shamir, How to prove yourself: practical solutions of identification and signature problems, In Crypto '86, LNCS, Vol. 263 Springer-Verlag, Berlin (1987) pp. 186-194.
10. M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA (1979).
11. J. Georgiades 1992 Some remarks on the security of the identification scheme based on permuted kernels Journal of Cryptology 5 2 133 137
12. M. Girault, An identity-based identification scheme based on discrete logarithms modulo a composite number, In Eurocrypt '90, LNCS, Vol. 473 Springer-Verlag, Berlin (1991) pp. 481-486.
13. M. Girault, Self-certified public keys, In Eurocrypt '91, LNCS, Vol. 547 Springer-Verlag, Berlin (1992) pp. 490-497.
14. M. Girault and J.-C. Paillès, An identity-based identification scheme providing zero-knowledge authentication and authenticated key exchange, In ESORICS '90, LNCS, Springer-Verlag, Berlin (1990) pp. 173-184.
15. M. Girault and J. Stern, On the length of cryptographic hash-values used in identification schemes, In Crypto '94, LNCS, Vol. 839 Springer-Verlag, Berlin (1994) pp. 202-215.
16. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA (1989).
17. O. Goldreich, S. Micali and A. Wigderson, How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design, In Crypto '86, LNCS, Vol. 263 Springer-Verlag, Berlin (1987) pp. 171-185.
18. S. Goldwasser, S. Micali and C. Rackoff, The knowledge complexity of interactive proof systems, In Proc. of the 17th STOC, ACM Press, New York (1985) pp. 291-304.
19. L. C. Guillou and J.-J. Quisquater, A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory, In Eurocrypt '88, LNCS, Vol. 330 Springer-Verlag, Berlin (1988) pp. 123-128.
20. S. Halevi and S. Micali, Practical and provably-secure commitment schemes from collision-free hashing, In Crypto '96, LNCS, Vol. 1109, Springer-Verlag, Berlin (1996) pp. 201-215.
21. J. H. Holland, Adaptation in Natural and Artificial Systems, The University of Michigan Press (1975).
22. H. J. Knobloch, A smart card implementation of the fiat-shamir identification scheme, In Eurocrypt '88, LNCS, Vol. 330 Springer-Verlag, Berlin (1988) pp. 87-95.
23. L. Knudsen and W. Meier, Cryptanalysis of an identification scheme based on the permuted perceptron problem, In Eurocrypt '99, LNCS, Vol. 1592, Springer-Verlag, Berlin (1999) pp. 363-374.
24. D. E. Knuth, The Art of Computer Programming, Vol. 2 Addison-Wesley, London (1969).
25. M. Luby C. Rackoff 1988 How to construct pseudorandom permutations from pseudorandom functions SIAM Journal of Computing 17 2 373 386
26. NIST, Secure Hash Standard (SHS), Federal Information Processing Standards Publication (180-1), April (1995).
27. K. Ohta and T. Okamoto, A modification of the fiat-shamir scheme, In Crypto '88, LNCS, Vol. 403 Springer-Verlag, Berlin (1989) pp. 232-243.
28. H. Ong and C. P. Schnorr, Fast signature generation with a fiat-shamir-like scheme, In Eurocrypt '90, LNCS, Vol. 473 Springer-Verlag, Berlin (1991) pp. 432-440.
29. C. Papadimitriou and M. Yannakakis, Optimization, approximation and complexity classes, Journal of Computer and Systems Sciences, Vol. 43 (1991) pp. 425-440.
30. J. Patarin and P. Chauvaud, Improved agorithms for the permuted kernel problem, In Crypto '93, LNCS, Vol. 773 Springer-Verlag, Berlin (1994) pp. 391-402.
31. D. Pointcheval, Neural networks and their cryptographic applications, In Eurocode '94, INRIA (1994) pp. 183-193.
32. D. Pointcheval, A new identification scheme based on the perceptrons problem, In Eurocrypt '95, LNCS, Vol. 921 Springer-Verlag, Berlin (1995) pp. 319-328.
33. D. Pointcheval, The composite discrete logarithm and secure authentication, In PKC 2000, LNCS, Vol. 1151 Springer-Verlag, Berlin (2000) pp. 113-128.
34. G. Poupard 1997 A realistic security analysis of identification schemes based on combinatorial problems European Transactions on Telecommunications 8 5 471 480
35. G. Poupard and J. Stern, Security analysis of a practical "on the fly" authentication and signature generation, In Eurocrypt '98, LNCS, Vol. 1403, Springer-Verlag, Berlin (1998) pp. 422-436.
36. G. Poupard and J. Stern, On the fly signatures based on factoring, In Proceedings of 6th ACM-CCS, ACM press (1999) pp. 37-45.
37. G. Poupard J. Stern 2000 Short proofs of knowledge for factoring PKC 2000 1751 147 166
38. B. Preneel, Analysis and Design of Cryptographic Hash Functions, Ph.D. Thesis, Katholieke Universiteit Leuven, Departement Elektrotechniek, January (1993).
39. R. Rivest, The MD5 Message-Digest Algorithm, RFC 1321, The Internet Engineering Task Force, April (1992).
40. R. Rivest A. Shamir L. Adleman 1978 A method for obtaining digital signatures and public key cryptosystems Communications of the ACM 21 2 120 126
41. C. P. Schnorr, Efficient identification and signatures for smart cards, In Crypto '89, LNCS,Vol. 435 Springer-Verlag, Berlin (1990) pp. 235-251.
42. A. Shamir, An efficient identification scheme based on permuted kernels, In Crypto '89, LNCS, Vol. 435 Springer-Verlag, Berlin (1990) pp. 606-609.
43. V. Shoup, On the security of a practical identification scheme, In Eurocrypt '96, LNCS, Vol. 1070, Springer-Verlag, Berlin (1996) pp. 344-353.
44. J. Stern, A new identification scheme based on syndrome decoding, In Crypto '93, LNCS,Vol. 773 Springer-Verlag, Berlin (1994) pp. 13-21.
45. J. Stern, Designing identification schemes with keys of short size, In Crypto '94, LNCS, Vol. 839 Springer-Verlag, Berlin (1994) pp. 164-173.
46. J. Stern 1996 A new paradigm for public-key identification IEEE Transaction on Information Theory IT-42 1757 1768