A hidden cryptographic assumption in no-transferable indentification schemes
- Cite this paper as:
- Sakurai K. (1996) A hidden cryptographic assumption in no-transferable indentification schemes. In: Kim K., Matsumoto T. (eds) Advances in Cryptology — ASIACRYPT '96. ASIACRYPT 1996. Lecture Notes in Computer Science, vol 1163. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.