Secure Computation Protocols Using Polarizing Cards | Zendy

Kazumasa Shinagawa | Zendy; Takaaki Mizuki | Zendy; Jacob C. N. Schuldt | Zendy; Koji Nuida | Zendy; Naoki Kanayama | Zendy; Takashi Nishide | Zendy; Goichiro Hanaoka | Zendy; Eiji Okamoto | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Secure Computation Protocols Using Polarizing Cards

Author(s) -

Kazumasa Shinagawa,

Takaaki Mizuki,

Jacob C. N. Schuldt,

Koji Nuida,

Naoki Kanayama,

Takashi Nishide,

Goichiro Hanaoka,

Eiji Okamoto

Publication year - 2016

Publication title -

ieice transactions on fundamentals of electronics communications and computer sciences

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.188

H-Index - 52

eISSN - 1745-1337

pISSN - 0916-8508

DOI - 10.1587/transfun.e99.a.1122

Subject(s) - computer science , encoding (memory) , encode , construct (python library) , protocol (science) , bitwise operation , openpgp card , set (abstract data type) , arithmetic , bit array , smart card , theoretical computer science , computer hardware , smart card application protocol data unit , computer network , mathematics , artificial intelligence , programming language , medicine , ecology , biochemistry , chemistry , alternative medicine , pathology , type (biology) , biology , gene

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research