On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes

Extended abstract of cocoon'95
  • Kouichi Sakurai
Session 9A: Complexity Theory

DOI: 10.1007/BFb0030871

Part of the Lecture Notes in Computer Science book series (LNCS, volume 959)
Cite this paper as:
Sakurai K. (1995) On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes. In: Du DZ., Li M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg

Abstract

A four-move protocol for quadratic residuosity is proposed and the security is discussed. An application of the proposed protocol to a cryptographic identification scheme introduces a new notion of practical soundness. Our basic approach is to separate proofs of knowledge from proofs of membership of languages. Previous works deal with proofs of knowledge as an additional property of proofs of membership.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Kouichi Sakurai
    • 1
  1. 1.Dept. of Computer Science and Communication EngineeringKyushu UniversityJapan

Personalised recommendations