Secure multi-party computation using polarizing cards

Kazumasa Shinagawa; Takaaki Mizuki; Jacob Schuldt; Koji Nuida; Naoki Kanayama; Takashi Nishide; Goichiro Hanaoka; Eiji Okamoto

doi:10.1007/978-3-319-22425-1_17

Secure multi-party computation using polarizing cards

Kazumasa Shinagawa, Takaaki Mizuki, Jacob Schuldt, Koji Nuida, Naoki Kanayama, Takashi Nishide, Goichiro Hanaoka, Eiji Okamoto

Research and Development Divisions

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

9 Citations (Scopus)

Abstract

It is known that, using just a deck of cards, an arbitrary number of parties with private inputs can securely compute the output of any function of their inputs. In 2009, Mizuki and Sone constructed a six-card COPY protocol, a four-card XOR protocol, and a six-card AND protocol, based on a commonly used encoding scheme in which each input bit is encoded using two cards. However, up until now, it has remained an open problem to construct a set of COPY, XOR, and AND protocols based on a two-cards-per-bit encoding scheme, which all can be implemented using only four cards. In this paper, we show that it is possible to construct four-card COPY, XOR, and AND protocols using polarizing plates as cards and a corresponding two-cards-per-bit encoding scheme. Our protocols are optimal in the setting of two-cardsper- bit encoding schemes since four cards are always required to encode the inputs. As applications of our protocols, we show constructions of optimal input-preserving XOR and AND protocols, which we combine to obtain optimal half-adder, full-adder, voting protocols, and more.

Original language	English
Title of host publication	Advances in Information and Computer Security - 10th International Workshop on Security, IWSEC 2015, Proceedings
Editors	Keisuke Tanaka, Yuji Suga
Publisher	Springer-Verlag
Pages	281-297
Number of pages	17
ISBN (Print)	9783319224244
DOIs	https://doi.org/10.1007/978-3-319-22425-1_17
Publication status	Published - 2015 Jan 1
Event	10th International Workshop on Security, IWSEC 2015 - Nara, Japan Duration: 2015 Aug 26 → 2015 Aug 28

Publication series

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

Other

Other	10th International Workshop on Security, IWSEC 2015
Country	Japan
City	Nara
Period	15/8/26 → 15/8/28

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-319-22425-1_17

Fingerprint Dive into the research topics of 'Secure multi-party computation using polarizing cards'. Together they form a unique fingerprint.

Cite this

Shinagawa, K., Mizuki, T., Schuldt, J., Nuida, K., Kanayama, N., Nishide, T., Hanaoka, G., & Okamoto, E. (2015). Secure multi-party computation using polarizing cards. In K. Tanaka, & Y. Suga (Eds.), Advances in Information and Computer Security - 10th International Workshop on Security, IWSEC 2015, Proceedings (pp. 281-297). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9241). Springer-Verlag. https://doi.org/10.1007/978-3-319-22425-1_17

Secure multi-party computation using polarizing cards. / Shinagawa, Kazumasa; Mizuki, Takaaki; Schuldt, Jacob; Nuida, Koji; Kanayama, Naoki; Nishide, Takashi; Hanaoka, Goichiro; Okamoto, Eiji.

Advances in Information and Computer Security - 10th International Workshop on Security, IWSEC 2015, Proceedings. ed. / Keisuke Tanaka; Yuji Suga. Springer-Verlag, 2015. p. 281-297 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9241).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Shinagawa, K, Mizuki, T, Schuldt, J, Nuida, K, Kanayama, N, Nishide, T, Hanaoka, G & Okamoto, E 2015, Secure multi-party computation using polarizing cards. in K Tanaka & Y Suga (eds), Advances in Information and Computer Security - 10th International Workshop on Security, IWSEC 2015, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9241, Springer-Verlag, pp. 281-297, 10th International Workshop on Security, IWSEC 2015, Nara, Japan, 15/8/26. https://doi.org/10.1007/978-3-319-22425-1_17

Shinagawa K, Mizuki T, Schuldt J, Nuida K, Kanayama N, Nishide T et al. Secure multi-party computation using polarizing cards. In Tanaka K, Suga Y, editors, Advances in Information and Computer Security - 10th International Workshop on Security, IWSEC 2015, Proceedings. Springer-Verlag. 2015. p. 281-297. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-22425-1_17

Shinagawa, Kazumasa ; Mizuki, Takaaki ; Schuldt, Jacob ; Nuida, Koji ; Kanayama, Naoki ; Nishide, Takashi ; Hanaoka, Goichiro ; Okamoto, Eiji. / Secure multi-party computation using polarizing cards. Advances in Information and Computer Security - 10th International Workshop on Security, IWSEC 2015, Proceedings. editor / Keisuke Tanaka ; Yuji Suga. Springer-Verlag, 2015. pp. 281-297 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{009856b464404d1292ac085a129e715b,

title = "Secure multi-party computation using polarizing cards",

abstract = "It is known that, using just a deck of cards, an arbitrary number of parties with private inputs can securely compute the output of any function of their inputs. In 2009, Mizuki and Sone constructed a six-card COPY protocol, a four-card XOR protocol, and a six-card AND protocol, based on a commonly used encoding scheme in which each input bit is encoded using two cards. However, up until now, it has remained an open problem to construct a set of COPY, XOR, and AND protocols based on a two-cards-per-bit encoding scheme, which all can be implemented using only four cards. In this paper, we show that it is possible to construct four-card COPY, XOR, and AND protocols using polarizing plates as cards and a corresponding two-cards-per-bit encoding scheme. Our protocols are optimal in the setting of two-cardsper- bit encoding schemes since four cards are always required to encode the inputs. As applications of our protocols, we show constructions of optimal input-preserving XOR and AND protocols, which we combine to obtain optimal half-adder, full-adder, voting protocols, and more.",

author = "Kazumasa Shinagawa and Takaaki Mizuki and Jacob Schuldt and Koji Nuida and Naoki Kanayama and Takashi Nishide and Goichiro Hanaoka and Eiji Okamoto",

year = "2015",

month = jan,

day = "1",

doi = "10.1007/978-3-319-22425-1_17",

language = "English",

isbn = "9783319224244",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag",

pages = "281--297",

editor = "Keisuke Tanaka and Yuji Suga",

booktitle = "Advances in Information and Computer Security - 10th International Workshop on Security, IWSEC 2015, Proceedings",

note = "10th International Workshop on Security, IWSEC 2015 ; Conference date: 26-08-2015 Through 28-08-2015",

}

TY - GEN

T1 - Secure multi-party computation using polarizing cards

AU - Shinagawa, Kazumasa

AU - Mizuki, Takaaki

AU - Schuldt, Jacob

AU - Nuida, Koji

AU - Kanayama, Naoki

AU - Nishide, Takashi

AU - Hanaoka, Goichiro

AU - Okamoto, Eiji

PY - 2015/1/1

Y1 - 2015/1/1

N2 - It is known that, using just a deck of cards, an arbitrary number of parties with private inputs can securely compute the output of any function of their inputs. In 2009, Mizuki and Sone constructed a six-card COPY protocol, a four-card XOR protocol, and a six-card AND protocol, based on a commonly used encoding scheme in which each input bit is encoded using two cards. However, up until now, it has remained an open problem to construct a set of COPY, XOR, and AND protocols based on a two-cards-per-bit encoding scheme, which all can be implemented using only four cards. In this paper, we show that it is possible to construct four-card COPY, XOR, and AND protocols using polarizing plates as cards and a corresponding two-cards-per-bit encoding scheme. Our protocols are optimal in the setting of two-cardsper- bit encoding schemes since four cards are always required to encode the inputs. As applications of our protocols, we show constructions of optimal input-preserving XOR and AND protocols, which we combine to obtain optimal half-adder, full-adder, voting protocols, and more.

AB - It is known that, using just a deck of cards, an arbitrary number of parties with private inputs can securely compute the output of any function of their inputs. In 2009, Mizuki and Sone constructed a six-card COPY protocol, a four-card XOR protocol, and a six-card AND protocol, based on a commonly used encoding scheme in which each input bit is encoded using two cards. However, up until now, it has remained an open problem to construct a set of COPY, XOR, and AND protocols based on a two-cards-per-bit encoding scheme, which all can be implemented using only four cards. In this paper, we show that it is possible to construct four-card COPY, XOR, and AND protocols using polarizing plates as cards and a corresponding two-cards-per-bit encoding scheme. Our protocols are optimal in the setting of two-cardsper- bit encoding schemes since four cards are always required to encode the inputs. As applications of our protocols, we show constructions of optimal input-preserving XOR and AND protocols, which we combine to obtain optimal half-adder, full-adder, voting protocols, and more.

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

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

U2 - 10.1007/978-3-319-22425-1_17

DO - 10.1007/978-3-319-22425-1_17

M3 - Conference contribution

AN - SCOPUS:84944741495

SN - 9783319224244

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

SP - 281

EP - 297

BT - Advances in Information and Computer Security - 10th International Workshop on Security, IWSEC 2015, Proceedings

A2 - Tanaka, Keisuke

A2 - Suga, Yuji

PB - Springer-Verlag

T2 - 10th International Workshop on Security, IWSEC 2015

Y2 - 26 August 2015 through 28 August 2015

ER -