Securely Computing Three-Input Functions with Eight Cards
Summary :
Assume that Alice, Bob, and Carol, each of whom privately holds a one-bit input, want to learn the output of some Boolean function, say the majority function, of their inputs without revealing more of their own secret inputs than necessary. In this paper, we show that such a secure three-input function evaluation can be performed with a deck of real cards; specifically, the three players can learn only the output of the function using eight physical cards — four black and four red cards — with identical backs.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E98-A No.6 pp.1145-1152
- Publication Date
- 2015/06/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E98.A.1145
- Type of Manuscript
- Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
- Category
Authors
Takuya NISHIDA
Tohoku University
Yu-ichi HAYASHI
Tohoku University
Takaaki MIZUKI
Tohoku University
Hideaki SONE
Tohoku University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Takuya NISHIDA, Yu-ichi HAYASHI, Takaaki MIZUKI, Hideaki SONE, "Securely Computing Three-Input Functions with Eight Cards" in IEICE TRANSACTIONS on Fundamentals,
vol. E98-A, no. 6, pp. 1145-1152, June 2015, doi: 10.1587/transfun.E98.A.1145.
Abstract: Assume that Alice, Bob, and Carol, each of whom privately holds a one-bit input, want to learn the output of some Boolean function, say the majority function, of their inputs without revealing more of their own secret inputs than necessary. In this paper, we show that such a secure three-input function evaluation can be performed with a deck of real cards; specifically, the three players can learn only the output of the function using eight physical cards — four black and four red cards — with identical backs.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E98.A.1145/_p
Copy
@ARTICLE{e98-a_6_1145,
author={Takuya NISHIDA, Yu-ichi HAYASHI, Takaaki MIZUKI, Hideaki SONE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Securely Computing Three-Input Functions with Eight Cards},
year={2015},
volume={E98-A},
number={6},
pages={1145-1152},
abstract={Assume that Alice, Bob, and Carol, each of whom privately holds a one-bit input, want to learn the output of some Boolean function, say the majority function, of their inputs without revealing more of their own secret inputs than necessary. In this paper, we show that such a secure three-input function evaluation can be performed with a deck of real cards; specifically, the three players can learn only the output of the function using eight physical cards — four black and four red cards — with identical backs.},
keywords={},
doi={10.1587/transfun.E98.A.1145},
ISSN={1745-1337},
month={June},}
Copy
TY - JOUR
TI - Securely Computing Three-Input Functions with Eight Cards
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1145
EP - 1152
AU - Takuya NISHIDA
AU - Yu-ichi HAYASHI
AU - Takaaki MIZUKI
AU - Hideaki SONE
PY - 2015
DO - 10.1587/transfun.E98.A.1145
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E98-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2015
AB - Assume that Alice, Bob, and Carol, each of whom privately holds a one-bit input, want to learn the output of some Boolean function, say the majority function, of their inputs without revealing more of their own secret inputs than necessary. In this paper, we show that such a secure three-input function evaluation can be performed with a deck of real cards; specifically, the three players can learn only the output of the function using eight physical cards — four black and four red cards — with identical backs.
ER -
English
