Efficient card-based protocols for generating a hidden random permutation without fixed points

Rie Ishikawa; Eikoh Chida; Takaaki Mizuki

doi:10.1007/978-3-319-21819-9_16

Efficient card-based protocols for generating a hidden random permutation without fixed points

Rie Ishikawa, Eikoh Chida, Takaaki Mizuki

Research and Development Divisions

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

29 Citations (Scopus)

Abstract

Consider the holiday season, where there are n players who would like to exchange gifts. That is, we would like to generate a random permutation having no fixed point. It is known that such a random permutation can be obtained in a hidden form by using a number of physical cards of four colors with identical backs, guaranteeing that it has no fixed point (without revealing the permutation itself). This paper deals with such a problem and improves the known result: whereas the known protocol needs O(n2) cards of four colors, our efficient protocol uses only O(n log n) cards of two colors.

Original language	English
Title of host publication	Unconventional Computation and Natural Computation - 14th International Conference, UCNC 2015, Proceedings
Editors	Cristian S. Calude, Michael J. Dinneen
Publisher	Springer Verlag
Pages	215-226
Number of pages	12
ISBN (Print)	9783319218182
DOIs	https://doi.org/10.1007/978-3-319-21819-9_16
Publication status	Published - 2015
Event	14th International Conference on Unconventional Computation and Natural Computation, UCNC 2015 - Auckland, New Zealand Duration: 2015 Aug 30 → 2015 Sep 3

Publication series

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

Other

Other	14th International Conference on Unconventional Computation and Natural Computation, UCNC 2015
Country	New Zealand
City	Auckland
Period	15/8/30 → 15/9/3

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-319-21819-9_16

Fingerprint Dive into the research topics of 'Efficient card-based protocols for generating a hidden random permutation without fixed points'. Together they form a unique fingerprint.

Cite this

Ishikawa, R., Chida, E., & Mizuki, T. (2015). Efficient card-based protocols for generating a hidden random permutation without fixed points. In C. S. Calude, & M. J. Dinneen (Eds.), Unconventional Computation and Natural Computation - 14th International Conference, UCNC 2015, Proceedings (pp. 215-226). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9252). Springer Verlag. https://doi.org/10.1007/978-3-319-21819-9_16

Efficient card-based protocols for generating a hidden random permutation without fixed points. / Ishikawa, Rie; Chida, Eikoh; Mizuki, Takaaki.

Unconventional Computation and Natural Computation - 14th International Conference, UCNC 2015, Proceedings. ed. / Cristian S. Calude; Michael J. Dinneen. Springer Verlag, 2015. p. 215-226 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9252).

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

Ishikawa, R, Chida, E & Mizuki, T 2015, Efficient card-based protocols for generating a hidden random permutation without fixed points. in CS Calude & MJ Dinneen (eds), Unconventional Computation and Natural Computation - 14th International Conference, UCNC 2015, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9252, Springer Verlag, pp. 215-226, 14th International Conference on Unconventional Computation and Natural Computation, UCNC 2015, Auckland, New Zealand, 15/8/30. https://doi.org/10.1007/978-3-319-21819-9_16

Ishikawa R, Chida E, Mizuki T. Efficient card-based protocols for generating a hidden random permutation without fixed points. In Calude CS, Dinneen MJ, editors, Unconventional Computation and Natural Computation - 14th International Conference, UCNC 2015, Proceedings. Springer Verlag. 2015. p. 215-226. (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-21819-9_16

Ishikawa, Rie ; Chida, Eikoh ; Mizuki, Takaaki. / Efficient card-based protocols for generating a hidden random permutation without fixed points. Unconventional Computation and Natural Computation - 14th International Conference, UCNC 2015, Proceedings. editor / Cristian S. Calude ; Michael J. Dinneen. Springer Verlag, 2015. pp. 215-226 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{36b2ceeccfa844028b3b7c0a9723209b,

title = "Efficient card-based protocols for generating a hidden random permutation without fixed points",

abstract = "Consider the holiday season, where there are n players who would like to exchange gifts. That is, we would like to generate a random permutation having no fixed point. It is known that such a random permutation can be obtained in a hidden form by using a number of physical cards of four colors with identical backs, guaranteeing that it has no fixed point (without revealing the permutation itself). This paper deals with such a problem and improves the known result: whereas the known protocol needs O(n2) cards of four colors, our efficient protocol uses only O(n log n) cards of two colors.",

author = "Rie Ishikawa and Eikoh Chida and Takaaki Mizuki",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015 Copyright: Copyright 2015 Elsevier B.V., All rights reserved.; 14th International Conference on Unconventional Computation and Natural Computation, UCNC 2015 ; Conference date: 30-08-2015 Through 03-09-2015",

year = "2015",

doi = "10.1007/978-3-319-21819-9_16",

language = "English",

isbn = "9783319218182",

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

publisher = "Springer Verlag",

pages = "215--226",

editor = "Calude, {Cristian S.} and Dinneen, {Michael J.}",

booktitle = "Unconventional Computation and Natural Computation - 14th International Conference, UCNC 2015, Proceedings",

}

TY - GEN

T1 - Efficient card-based protocols for generating a hidden random permutation without fixed points

AU - Ishikawa, Rie

AU - Chida, Eikoh

AU - Mizuki, Takaaki

PY - 2015

Y1 - 2015

N2 - Consider the holiday season, where there are n players who would like to exchange gifts. That is, we would like to generate a random permutation having no fixed point. It is known that such a random permutation can be obtained in a hidden form by using a number of physical cards of four colors with identical backs, guaranteeing that it has no fixed point (without revealing the permutation itself). This paper deals with such a problem and improves the known result: whereas the known protocol needs O(n2) cards of four colors, our efficient protocol uses only O(n log n) cards of two colors.

AB - Consider the holiday season, where there are n players who would like to exchange gifts. That is, we would like to generate a random permutation having no fixed point. It is known that such a random permutation can be obtained in a hidden form by using a number of physical cards of four colors with identical backs, guaranteeing that it has no fixed point (without revealing the permutation itself). This paper deals with such a problem and improves the known result: whereas the known protocol needs O(n2) cards of four colors, our efficient protocol uses only O(n log n) cards of two colors.

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

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

U2 - 10.1007/978-3-319-21819-9_16

DO - 10.1007/978-3-319-21819-9_16

M3 - Conference contribution

AN - SCOPUS:84943639442

SN - 9783319218182

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

SP - 215

EP - 226

BT - Unconventional Computation and Natural Computation - 14th International Conference, UCNC 2015, Proceedings

A2 - Calude, Cristian S.

A2 - Dinneen, Michael J.

PB - Springer Verlag

T2 - 14th International Conference on Unconventional Computation and Natural Computation, UCNC 2015

Y2 - 30 August 2015 through 3 September 2015

ER -