Secure multiparty computations using the 15 puzzle

Authors:
Takaaki Mizuki;Yoshinori Kugimoto;Hideaki Sone
Affiliations:
Information Synergy Center, Tohoku University, Aoba-ku, Sendai, Japan;Sone Lab., Graduate School of Information Sciences, Tohoku University, Aoba-ku, Sendai, Japan;Information Synergy Center, Tohoku University, Aoba-ku, Sendai, Japan
Venue:
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Year:
2007

Citing 7
Cited 0

More efficient match-making and satisfiability: the five card trick

EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Discreet solitary games

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Comparing information without leaking it

Communications of the ACM
Private computation using a PEZ dispenser

Theoretical Computer Science
Dealing necessary and sufficient numbers of cards for sharing a one-bit secret key

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Basing cryptographic protocols on tamper-evident seals

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Polling with physical envelopes: a rigorous analysis of a human-centric protocol

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.