Secure multiparty computations using the 15 puzzle

Takaaki Mizuki, Yoshinori Kugimoto, Hideaki Sone

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)


This paper first considers the use of the "15 puzzle," which is one of the most famous sliding-block puzzles, to provide secure multiparty computations. That is, we design a class of 15-puzzle-based protocols for securely computing Boolean functions. Specifically, we show that any function of 4 variables (or less) and any symmetric function of 14 variables (or less) can be securely computed by a 15-puzzle-based protocol; furthermore, we present a 5-variable function and a 15-variable symmetric function, both of which cannot be securely computed by any protocol in the class.

Original languageEnglish
Title of host publicationCombinatorial Optimization and Applications - First International Conference, COCOA 2007, Proceedings
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783540735557
Publication statusPublished - 2007
Event1st International Conference on Combinatorial Optimization and Applications, COCOA 2007 - Xi'an, China
Duration: 2007 Aug 142007 Aug 16

Publication series

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


Other1st International Conference on Combinatorial Optimization and Applications, COCOA 2007

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Secure multiparty computations using the 15 puzzle'. Together they form a unique fingerprint.

Cite this