A hidden cryptographic assumption in no-transferable indentification schemes

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

Abstract

A 4-move perfect zero-knowledge argument for quadratic residuosity is discussed and the identification scheme based on this protocol is shown to be no-transferable. Note that the soundness of all known previous no-transferable protocols require no computational assumption, while our proposed protocol assumes a restriction of the power of cheating provers. Furthermore, a new notion of practical soundness is introduced and the relationship between practical soundness and no-transferable is investigated. An important consequence is that perfect zero-knowledge arguments does not always satisfy no-transferable nor practical soundness.

Original languageEnglish
Title of host publicationAdvances in Cryptology ─ ASIACRYPT 1996 - International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings
PublisherSpringer Verlag
Pages159-172
Number of pages14
ISBN (Print)9783540618720
Publication statusPublished - Jan 1 1996
EventInternational Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 1996 - Kyongju, Korea, Republic of
Duration: Nov 3 1996Nov 7 1996

Publication series

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

Other

OtherInternational Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 1996
CountryKorea, Republic of
CityKyongju
Period11/3/9611/7/96

Fingerprint

Soundness
Zero-knowledge
Identification Scheme
Restriction

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Sakurai, K. (1996). A hidden cryptographic assumption in no-transferable indentification schemes. In Advances in Cryptology ─ ASIACRYPT 1996 - International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings (pp. 159-172). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1163). Springer Verlag.

A hidden cryptographic assumption in no-transferable indentification schemes. / Sakurai, Kouichi.

Advances in Cryptology ─ ASIACRYPT 1996 - International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings. Springer Verlag, 1996. p. 159-172 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1163).

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

Sakurai, K 1996, A hidden cryptographic assumption in no-transferable indentification schemes. in Advances in Cryptology ─ ASIACRYPT 1996 - International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1163, Springer Verlag, pp. 159-172, International Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 1996, Kyongju, Korea, Republic of, 11/3/96.
Sakurai K. A hidden cryptographic assumption in no-transferable indentification schemes. In Advances in Cryptology ─ ASIACRYPT 1996 - International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings. Springer Verlag. 1996. p. 159-172. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Sakurai, Kouichi. / A hidden cryptographic assumption in no-transferable indentification schemes. Advances in Cryptology ─ ASIACRYPT 1996 - International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings. Springer Verlag, 1996. pp. 159-172 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{dbd37b861a23483c9ed67669ddfd91b6,
title = "A hidden cryptographic assumption in no-transferable indentification schemes",
abstract = "A 4-move perfect zero-knowledge argument for quadratic residuosity is discussed and the identification scheme based on this protocol is shown to be no-transferable. Note that the soundness of all known previous no-transferable protocols require no computational assumption, while our proposed protocol assumes a restriction of the power of cheating provers. Furthermore, a new notion of practical soundness is introduced and the relationship between practical soundness and no-transferable is investigated. An important consequence is that perfect zero-knowledge arguments does not always satisfy no-transferable nor practical soundness.",
author = "Kouichi Sakurai",
year = "1996",
month = "1",
day = "1",
language = "English",
isbn = "9783540618720",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "159--172",
booktitle = "Advances in Cryptology ─ ASIACRYPT 1996 - International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings",
address = "Germany",

}

TY - GEN

T1 - A hidden cryptographic assumption in no-transferable indentification schemes

AU - Sakurai, Kouichi

PY - 1996/1/1

Y1 - 1996/1/1

N2 - A 4-move perfect zero-knowledge argument for quadratic residuosity is discussed and the identification scheme based on this protocol is shown to be no-transferable. Note that the soundness of all known previous no-transferable protocols require no computational assumption, while our proposed protocol assumes a restriction of the power of cheating provers. Furthermore, a new notion of practical soundness is introduced and the relationship between practical soundness and no-transferable is investigated. An important consequence is that perfect zero-knowledge arguments does not always satisfy no-transferable nor practical soundness.

AB - A 4-move perfect zero-knowledge argument for quadratic residuosity is discussed and the identification scheme based on this protocol is shown to be no-transferable. Note that the soundness of all known previous no-transferable protocols require no computational assumption, while our proposed protocol assumes a restriction of the power of cheating provers. Furthermore, a new notion of practical soundness is introduced and the relationship between practical soundness and no-transferable is investigated. An important consequence is that perfect zero-knowledge arguments does not always satisfy no-transferable nor practical soundness.

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

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

M3 - Conference contribution

SN - 9783540618720

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

SP - 159

EP - 172

BT - Advances in Cryptology ─ ASIACRYPT 1996 - International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings

PB - Springer Verlag

ER -