Secure Computation Protocols Using Polarizing Cards

• SHINAGAWA Kazumasa

  University of Tsukuba National Institute of Advanced Industrial Science and Technology

• MIZUKI Takaaki

  Tohoku University

• SCHULDT Jacob C. N.

  National Institute of Advanced Industrial Science and Technology

• NUIDA Koji

  National Institute of Advanced Industrial Science and Technology

• KANAYAMA Naoki

  University of Tsukuba

• NISHIDE Takashi

  University of Tsukuba

• HANAOKA Goichiro

  National Institute of Advanced Industrial Science and Technology

• OKAMOTO Eiji

  University of Tsukuba

抄録

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, there are no known results to construct a set of COPY, XOR, and AND protocols based on a two-card-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-card-per-bit encoding scheme. Our protocols use a minimum number of cards in the setting of two-card-per-bit encoding schemes since four cards are always required to encode the inputs. Moreover, we show that it is possible to construct two-card COPY, two-card XOR, and three-card AND protocols based on a one-card-per-bit encoding scheme using a common reference polarizer which is a polarizing material accessible to all parties.

収録刊行物

• IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E99.A (6), 1122-1131, 2016

  一般社団法人 電子情報通信学会

キーワード

• card-based protocols
• polarizing cards
• secure computation
• boolean circuits
• recreational cryptography

詳細情報

• CRID: 1390001206309963008
• NII論文ID: 130005154234
• NII書誌ID: AA10826239
• DOI: 10.1587/transfun.e99.a.1122
• ISSN: 17451337
• ISSN: 09168508
• HANDLE: 2241/00144142
• Web Site: https://tsukuba.repo.nii.ac.jp/records/39473
• Web Site: https://www.jstage.jst.go.jp/article/transfun/E99.A/6/E99.A_1122/_pdf
• 本文言語コード: en
• データソース種別:
  • JaLC
  • IRDB
  • Crossref
  • CiNii Articles
  • KAKEN
• 抄録ライセンスフラグ: 使用不可