Six-card secure and AND four-card secure XOR

Takaaki Mizuki; Hideaki Sone

doi:10.1007/978-3-642-02270-8_36

Six-card secure and AND four-card secure XOR

Takaaki Mizuki, Hideaki Sone

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

98 Citations (Scopus)

Abstract

There have existed several "card-based protocols" for secure computations of a Boolean function such as AND and XOR. The best result currently known is that AND and XOR can be securely computed using 8 cards and 10 cards, respectively. In this paper, we improve the result: we design a 6-card AND protocol and a 4-card XOR protocol. Thus, this paper succeeds in reducing the number of required cards for secure computations.

Original language	English
Title of host publication	Frontiers in Algorithmics - Third International Workshop, FAW 2009, Proceedings
Pages	358-369
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-642-02270-8_36
Publication status	Published - 2009
Event	3rd International Frontiers of Algorithmics Workshop, FAW 2009 - Hefei, China Duration: 2009 Jun 20 → 2009 Jun 23

Publication series

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

Conference

Conference	3rd International Frontiers of Algorithmics Workshop, FAW 2009
Country/Territory	China
City	Hefei
Period	09/6/20 → 09/6/23

Access to Document

10.1007/978-3-642-02270-8_36

Cite this

Mizuki, T., & Sone, H. (2009). Six-card secure and AND four-card secure XOR. In Frontiers in Algorithmics - Third International Workshop, FAW 2009, Proceedings (pp. 358-369). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5598 LNCS). https://doi.org/10.1007/978-3-642-02270-8_36

@inproceedings{8879c2d8737943eaa6bbee38b13bd37b,

title = "Six-card secure and AND four-card secure XOR",

abstract = "There have existed several {"}card-based protocols{"} for secure computations of a Boolean function such as AND and XOR. The best result currently known is that AND and XOR can be securely computed using 8 cards and 10 cards, respectively. In this paper, we improve the result: we design a 6-card AND protocol and a 4-card XOR protocol. Thus, this paper succeeds in reducing the number of required cards for secure computations.",

author = "Takaaki Mizuki and Hideaki Sone",

year = "2009",

doi = "10.1007/978-3-642-02270-8_36",

language = "English",

isbn = "3642022693",

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

pages = "358--369",

booktitle = "Frontiers in Algorithmics - Third International Workshop, FAW 2009, Proceedings",

note = "3rd International Frontiers of Algorithmics Workshop, FAW 2009 ; Conference date: 20-06-2009 Through 23-06-2009",

}

Mizuki, T & Sone, H 2009, Six-card secure and AND four-card secure XOR. in Frontiers in Algorithmics - Third International Workshop, FAW 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5598 LNCS, pp. 358-369, 3rd International Frontiers of Algorithmics Workshop, FAW 2009, Hefei, China, 09/6/20. https://doi.org/10.1007/978-3-642-02270-8_36

Six-card secure and AND four-card secure XOR. / Mizuki, Takaaki ; Sone, Hideaki.
Frontiers in Algorithmics - Third International Workshop, FAW 2009, Proceedings. 2009. p. 358-369 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5598 LNCS).

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

TY - GEN

T1 - Six-card secure and AND four-card secure XOR

AU - Mizuki, Takaaki

AU - Sone, Hideaki

PY - 2009

Y1 - 2009

N2 - There have existed several "card-based protocols" for secure computations of a Boolean function such as AND and XOR. The best result currently known is that AND and XOR can be securely computed using 8 cards and 10 cards, respectively. In this paper, we improve the result: we design a 6-card AND protocol and a 4-card XOR protocol. Thus, this paper succeeds in reducing the number of required cards for secure computations.

AB - There have existed several "card-based protocols" for secure computations of a Boolean function such as AND and XOR. The best result currently known is that AND and XOR can be securely computed using 8 cards and 10 cards, respectively. In this paper, we improve the result: we design a 6-card AND protocol and a 4-card XOR protocol. Thus, this paper succeeds in reducing the number of required cards for secure computations.

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

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

U2 - 10.1007/978-3-642-02270-8_36

DO - 10.1007/978-3-642-02270-8_36

M3 - Conference contribution

AN - SCOPUS:70350666768

SN - 3642022693

SN - 9783642022692

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

SP - 358

EP - 369

BT - Frontiers in Algorithmics - Third International Workshop, FAW 2009, Proceedings

T2 - 3rd International Frontiers of Algorithmics Workshop, FAW 2009

Y2 - 20 June 2009 through 23 June 2009

ER -

Six-card secure and AND four-card secure XOR

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this