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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Mizuki, T., Kugimoto, Y., & Sone, H. (2007). Secure multiparty computations using the 15 puzzle. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4616 LNCS, pp. 255–266). Springer Verlag. https://doi.org/10.1007/978-3-540-73556-4_28
Mendeley helps you to discover research relevant for your work.