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

Rie Ishikawa, Eikoh Chida, Takaaki Mizuki

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationUnconventional Computation and Natural Computation - 14th International Conference, UCNC 2015, Proceedings
EditorsCristian S. Calude, Michael J. Dinneen
PublisherSpringer Verlag
Pages215-226
Number of pages12
ISBN (Print)9783319218182
DOIs
Publication statusPublished - 2015
Event14th International Conference on Unconventional Computation and Natural Computation, UCNC 2015 - Auckland, New Zealand
Duration: 2015 Aug 302015 Sep 3

Publication series

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

Other

Other14th International Conference on Unconventional Computation and Natural Computation, UCNC 2015
CountryNew Zealand
CityAuckland
Period15/8/3015/9/3

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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