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
EditorsKwangjo Kim, Tsutomu Matsumoto
PublisherSpringer Verlag
Pages159-172
Number of pages14
ISBN (Print)9783540618720
DOIs
Publication statusPublished - 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
Country/TerritoryKorea, Republic of
CityKyongju
Period11/3/9611/7/96

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this