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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationComputing and Combinatorics - 1st Annual International Conference, COCOON 1995, Proceedings
EditorsDing-Zhu Du, Ming Li, Ding-Zhu Du
PublisherSpringer Verlag
Pages496-509
Number of pages14
ISBN (Print)354060216X, 9783540602163
DOIs
Publication statusPublished - Jan 1 1995
Event1st Annual International Computing and Combinatorics Conference, COCOON 1995 - Xi’an, China
Duration: Aug 24 1995Aug 26 1995

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume959
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st Annual International Computing and Combinatorics Conference, COCOON 1995
CountryChina
CityXi’an
Period8/24/958/26/95

Fingerprint

Identification Scheme
Soundness
Knowledge
Language

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Sakurai, K. (1995). On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes. In D-Z. Du, M. Li, & D-Z. Du (Eds.), Computing and Combinatorics - 1st Annual International Conference, COCOON 1995, Proceedings (pp. 496-509). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 959). Springer Verlag. https://doi.org/10.1007/BFb0030871

On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes. / Sakurai, Kouichi.

Computing and Combinatorics - 1st Annual International Conference, COCOON 1995, Proceedings. ed. / Ding-Zhu Du; Ming Li; Ding-Zhu Du. Springer Verlag, 1995. p. 496-509 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 959).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sakurai, K 1995, On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes. in D-Z Du, M Li & D-Z Du (eds), Computing and Combinatorics - 1st Annual International Conference, COCOON 1995, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 959, Springer Verlag, pp. 496-509, 1st Annual International Computing and Combinatorics Conference, COCOON 1995, Xi’an, China, 8/24/95. https://doi.org/10.1007/BFb0030871
Sakurai K. On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes. In Du D-Z, Li M, Du D-Z, editors, Computing and Combinatorics - 1st Annual International Conference, COCOON 1995, Proceedings. Springer Verlag. 1995. p. 496-509. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/BFb0030871
Sakurai, Kouichi. / On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes. Computing and Combinatorics - 1st Annual International Conference, COCOON 1995, Proceedings. editor / Ding-Zhu Du ; Ming Li ; Ding-Zhu Du. Springer Verlag, 1995. pp. 496-509 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{2ba767784f514cfa9290284c8c8a7681,
title = "On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes",
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.",
author = "Kouichi Sakurai",
year = "1995",
month = "1",
day = "1",
doi = "10.1007/BFb0030871",
language = "English",
isbn = "354060216X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "496--509",
editor = "Ding-Zhu Du and Ming Li and Ding-Zhu Du",
booktitle = "Computing and Combinatorics - 1st Annual International Conference, COCOON 1995, Proceedings",
address = "Germany",

}

TY - GEN

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

AU - Sakurai, Kouichi

PY - 1995/1/1

Y1 - 1995/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84957580158&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84957580158&partnerID=8YFLogxK

U2 - 10.1007/BFb0030871

DO - 10.1007/BFb0030871

M3 - Conference contribution

AN - SCOPUS:84957580158

SN - 354060216X

SN - 9783540602163

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 496

EP - 509

BT - Computing and Combinatorics - 1st Annual International Conference, COCOON 1995, Proceedings

A2 - Du, Ding-Zhu

A2 - Li, Ming

A2 - Du, Ding-Zhu

PB - Springer Verlag

ER -