1,246 research outputs found
Mastermind is NP-Complete
In this paper we show that the Mastermind Satisfiability Problem (MSP) is
NP-complete. The Mastermind is a popular game which can be turned into a
logical puzzle called Mastermind Satisfiability Problem in a similar spirit to
the Minesweeper puzzle. By proving that MSP is NP-complete, we reveal its
intrinsic computational property that makes it challenging and interesting.
This serves as an addition to our knowledge about a host of other puzzles, such
as Minesweeper, Mah-Jongg, and the 15-puzzle
Learning Character Strings via Mastermind Queries, with a Case Study Involving mtDNA
We study the degree to which a character string, , leaks details about
itself any time it engages in comparison protocols with a strings provided by a
querier, Bob, even if those protocols are cryptographically guaranteed to
produce no additional information other than the scores that assess the degree
to which matches strings offered by Bob. We show that such scenarios allow
Bob to play variants of the game of Mastermind with so as to learn the
complete identity of . We show that there are a number of efficient
implementations for Bob to employ in these Mastermind attacks, depending on
knowledge he has about the structure of , which show how quickly he can
determine . Indeed, we show that Bob can discover using a number of
rounds of test comparisons that is much smaller than the length of , under
reasonable assumptions regarding the types of scores that are returned by the
cryptographic protocols and whether he can use knowledge about the distribution
that comes from. We also provide the results of a case study we performed
on a database of mitochondrial DNA, showing the vulnerability of existing
real-world DNA data to the Mastermind attack.Comment: Full version of related paper appearing in IEEE Symposium on Security
and Privacy 2009, "The Mastermind Attack on Genomic Data." This version
corrects the proofs of what are now Theorems 2 and 4
- …