Advertisement

A New Identification Scheme Based on the Perceptrons Problem

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 921)

Abstract

Identification is a useful cryptographic tool. Since zero-know- ledge theory appeared [3], several interactive identification schemes have been proposed (in particular Fiat-Shamir [2] and its variants [8, 5, 4], Schnorr [9]). These identifications are based on number theoretical prob- lems. More recently, new schemes appeared with the peculiarity that they are more efficient from the computational point of view and that their security is based on NP-complete problems: PKP (Permuted Ker- nels Problem) [10], SD (Syndrome Decoding) [12] and CLE (Constrained Linear Equations) [13].

We present a new NP-complete linear problem which comes from learn- ing machines: the Perceptrons Problem. We have some constraints, m vectors X i of {−1, +1}n, and we want to find a vector V of {−1, +1}n such that X i · V ≥ 0 for all i.

Next, we provide some zero-knowledge interactive identification protocols based on this problem, with an evaluation of their security. Eventually, those protocols are well suited for smart card applications.

References

  1. 1.
    Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In Proceedings of the 1st ACM Conference on Computer and Communications Security (1993) pp. 62–73.Google Scholar
  2. 2.
    Fiat, A., Shamir, A.: How to prove yourself: practical solutions of identification and signature problems. In Advances in Cryptology — Proceedings of CRYPTO’ 86 (1987) vol. Lecture Notes in Computer Science 263 Springer-Verlag pp. 186–194.Google Scholar
  3. 3.
    Goldwasser, S., Micali, S., Rackoff, C.: Knowledge complexity of interactive proof systems. In Proceedings of the 17th ACM Symposium on the Theory of Computing STOC (1985) pp. 291–304.Google Scholar
  4. 4.
    Ohta, K., Okamoto, T.: A modification of the fiat-shamir scheme. In Advances in Cryptology — Proceedings of CRYPTO’ 88 (1989) vol. Lecture Notes in Computer Science 403 Springer-Verlag pp. 232–243.Google Scholar
  5. 5.
    Ong, H., Schnorr, C.: Fast signature generation with a fiat shamir-like scheme. In Advances in Cryptology — Proceedings of EUROCRYPT’ 90 (1991) vol. Lecture Notes in Computer Science Springer-Verlag pp. 432–440.Google Scholar
  6. 6.
    Papadimitriou, C., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and Systems Sciences 43 (1991) pp. 425–440.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Pointcheval, D.: Les réseaux de neurones et leurs applications cryptographiques. Tech. rep. Laboratoire d’Informatique de l’École Normale Supérieure Février 1995. LIENS-95-2.Google Scholar
  8. 8.
    Quisquater, J., Guillou, L.: A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. In Advances in Cryptology — Proceedings of EUROCRYPT’ 88 (1989) vol. Lecture Notes in Computer Science 330 Springer-Verlag pp. 123–128.Google Scholar
  9. 9.
    Schnorr, C.: Efficient identification and signatures for smart cards. In Advances in Cryptology — Proceedings of CRYPTO’ 89 (1990) vol. Lecture Notes in Computer Science 435 Springer-Verlag pp. 235–251.CrossRefGoogle Scholar
  10. 10.
    Shamir, A.: An efficient identification scheme based on permuted kernels. In Advances in Cryptology — Proceedings of CRYPTO’ 89 (1990) vol. Lecture Notes in Computer Science 435 Springer-Verlag pp. 606–609.CrossRefGoogle Scholar
  11. 11.
    Skubiszewski, M.: Optimisation par recuit simulé: mise en œuvre matérielle de la machine de Boltzmann, application à l’étude des suites synchronisantes. PhD thesis Université d’Orsay juin 1993.Google Scholar
  12. 12.
    Stern, J.: A new identification scheme based on syndrome decoding. In Advances in Cryptology — proceedings of CRYPTO’ 93 (1994) vol. Lecture Notes in Computer Science 773 Springer-Verlag pp. 13–21.Google Scholar
  13. 13.
    Stern, J.: Designing identification schemes with keys of short size. In Advances in Cryptology — proceedings of CRYPTO’ 94 (1994) vol. Lecture Notes in Computer Science 839 Springer-Verlag pp. 164–173.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  1. 1.Laboratoire d’InformatiqueÉcole Normale SupérieureParis Cedex 05

Personalised recommendations