Computational Model of Card-Based Cryptographic Protocols and Its Applications

Takaaki MIZUKI; Hiroki SHIZUYA

doi:10.1587/transfun.E100.A.3

Computational Model of Card-Based Cryptographic Protocols and Its Applications

Takaaki MIZUKI, Hiroki SHIZUYA

Full Text Views

0

Share
Cite this

Summary :

Card-based protocols enable us to easily perform cryptographic tasks such as secure multiparty computation using a deck of physical cards. Since the first card-based protocol appeared in 1989, many protocols have been designed. A protocol is usually described with a series of somewhat intuitive and verbal descriptions, such as “turn over this card,” “shuffle these two cards,” “apply a random cut to these five cards,” and so on. On the other hand, a formal computational model of card-based protocols via abstract machine was constructed in 2014. By virtue of the formalization, card-based protocols can be treated more rigorously; for example, it enables one to discuss the lower bounds on the number of cards required for secure computations. In this paper, an overview of the computational model with its applications to designing protocols and a survey of the recent progress in card-based protocols are presented.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E100-A No.1 pp.3-11

Publication Date: 2017/01/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E100.A.3

Type of Manuscript: Special Section INVITED PAPER (Special Section on Cryptography and Information Security)

Category

Authors

Takaaki MIZUKI
Tohoku University
Hiroki SHIZUYA
Tohoku University

Keyword

card-based protocols, card games, cryptography without computers, real-life hands-on cryptography, secure multiparty computations

Cite this

Copy

Takaaki MIZUKI, Hiroki SHIZUYA, "Computational Model of Card-Based Cryptographic Protocols and Its Applications" in IEICE TRANSACTIONS on Fundamentals, vol. E100-A, no. 1, pp. 3-11, January 2017, doi: 10.1587/transfun.E100.A.3.
Abstract: Card-based protocols enable us to easily perform cryptographic tasks such as secure multiparty computation using a deck of physical cards. Since the first card-based protocol appeared in 1989, many protocols have been designed. A protocol is usually described with a series of somewhat intuitive and verbal descriptions, such as “turn over this card,” “shuffle these two cards,” “apply a random cut to these five cards,” and so on. On the other hand, a formal computational model of card-based protocols via abstract machine was constructed in 2014. By virtue of the formalization, card-based protocols can be treated more rigorously; for example, it enables one to discuss the lower bounds on the number of cards required for secure computations. In this paper, an overview of the computational model with its applications to designing protocols and a survey of the recent progress in card-based protocols are presented.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.3/_p

Copy

@ARTICLE{e100-a_1_3,
author={Takaaki MIZUKI, Hiroki SHIZUYA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Computational Model of Card-Based Cryptographic Protocols and Its Applications},
year={2017},
volume={E100-A},
number={1},
pages={3-11},
abstract={Card-based protocols enable us to easily perform cryptographic tasks such as secure multiparty computation using a deck of physical cards. Since the first card-based protocol appeared in 1989, many protocols have been designed. A protocol is usually described with a series of somewhat intuitive and verbal descriptions, such as “turn over this card,” “shuffle these two cards,” “apply a random cut to these five cards,” and so on. On the other hand, a formal computational model of card-based protocols via abstract machine was constructed in 2014. By virtue of the formalization, card-based protocols can be treated more rigorously; for example, it enables one to discuss the lower bounds on the number of cards required for secure computations. In this paper, an overview of the computational model with its applications to designing protocols and a survey of the recent progress in card-based protocols are presented.},
keywords={},
doi={10.1587/transfun.E100.A.3},
ISSN={1745-1337},
month={January},}

Copy

TY - JOUR
TI - Computational Model of Card-Based Cryptographic Protocols and Its Applications
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 3
EP - 11
AU - Takaaki MIZUKI
AU - Hiroki SHIZUYA
PY - 2017
DO - 10.1587/transfun.E100.A.3
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2017
AB - Card-based protocols enable us to easily perform cryptographic tasks such as secure multiparty computation using a deck of physical cards. Since the first card-based protocol appeared in 1989, many protocols have been designed. A protocol is usually described with a series of somewhat intuitive and verbal descriptions, such as “turn over this card,” “shuffle these two cards,” “apply a random cut to these five cards,” and so on. On the other hand, a formal computational model of card-based protocols via abstract machine was constructed in 2014. By virtue of the formalization, card-based protocols can be treated more rigorously; for example, it enables one to discuss the lower bounds on the number of cards required for secure computations. In this paper, an overview of the computational model with its applications to designing protocols and a survey of the recent progress in card-based protocols are presented.
ER -