Affordable Access

Access to the full text

A formalization of card-based cryptographic protocols via abstract machine

Authors
  • Mizuki, Takaaki1
  • Shizuya, Hiroki2
  • 1 Tohoku University, Cyberscience Center, 6-3 Aramaki-Aza-Aoba, Aoba-ku, Sendai, 980-8578, Japan , Sendai (Japan)
  • 2 Tohoku University, Center for Information Technology in Education, 41 Kawauchi, Aoba-ku, Sendai, 980-8576, Japan , Sendai (Japan)
Type
Published Article
Journal
International Journal of Information Security
Publisher
Springer Berlin Heidelberg
Publication Date
Nov 22, 2013
Volume
13
Issue
1
Pages
15–23
Identifiers
DOI: 10.1007/s10207-013-0219-4
Source
Springer Nature
Keywords
License
Yellow

Abstract

Consider a face-down card lying on the table such that we do not know whether its suit color is black or red. Then, how do we make identical copies of the card while keeping its color secret? A partial solution has been devised: using a number of additional black and red cards, Niemi and Renvall proposed an excellent protocol which can copy a face-down card while allowing only a small probability of revealing its color. In contrast, this paper shows the nonexistence of a perfect solution, namely, the impossibility of copying a face-down card with perfect secrecy. To prove such an impossibility result, we construct a rigorous mathematical model of card-based cryptographic protocols; giving this general computational model is the main result of this paper.

Report this publication

Statistics

Seen <100 times