{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T09:37:03Z","timestamp":1773740223246,"version":"3.50.1"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2012,11,1]],"date-time":"2012-11-01T00:00:00Z","timestamp":1351728000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.1109\/tit.2012.2208581","type":"journal-article","created":{"date-parts":[[2012,7,13]],"date-time":"2012-07-13T22:08:31Z","timestamp":1342217311000},"page":"6726-6736","source":"Crossref","is-referenced-by-count":5,"title":["Learning Character Strings via Mastermind Queries, With a Case Study Involving mtDNA"],"prefix":"10.1109","volume":"58","author":[{"given":"Michael T.","family":"Goodrich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2009.4"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-540-24595-7_1","article-title":"Confluent drawings: Visualizing non-planar diagrams in a planar way","volume":"2912","author":"dickerson","year":"2003","journal-title":"Proc 11th Int Symp on Graph Drawing"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"1304","DOI":"10.1126\/science.1058040","article-title":"The sequence of the human genome","volume":"291","author":"venter","year":"2001","journal-title":"Science"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkl927"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gki079"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1021\/ci700200n"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.genom.6.080604.162249"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1002\/humu.20801"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pbio.0050254"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1038\/35057062","article-title":"Initial sequencing and analysis of the human genome","volume":"409","author":"consortium","year":"2001","journal-title":"Nature"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360861"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.01.009"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321922"},{"key":"ref13","first-page":"519","article-title":"Privacy preserving error resilient dna searching through oblivious automata","author":"troncoso-pastoriza","year":"2007","journal-title":"Proc 14th ACM Conf Comput Commun Security"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.34"},{"key":"ref15","article-title":"Toward a practical data privacy scheme for a distributed implementation of the Smith-Waterman genome sequence comparison algorithm","author":"szajda","year":"2006","journal-title":"Proc Symp Network and Distributed System Security"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"593","DOI":"10.3233\/JCS-2005-13401","article-title":"Secure set intersection cardinality with application to association rule mining","volume":"13","author":"vaidya","year":"2005","journal-title":"J Comput Security"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/PDCAT.2007.59"},{"key":"ref18","first-page":"47","article-title":"Privacy preserving set intersection based on bilinear groups","author":"sang","year":"2008","journal-title":"Proc Australas Comput Sci Conf"},{"key":"ref19","first-page":"209","article-title":"A new efficient privacy-preserving scalar product protocol","author":"amirbekyan","year":"2007","journal-title":"Proc 6th Australasian Conf Data Mining Analytics"},{"key":"ref28","article-title":"The genographic project public participation mitochondrial DNA database","volume":"3","author":"behar1","year":"2005","journal-title":"PLoS Genet"},{"key":"ref4","author":"stuckman","year":"2005","journal-title":"Mastermind is np-complete"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1080\/00107510500052444"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/3-540-61332-3_138","article-title":"Finding a hidden code by asking questions","volume":"1090","author":"chen","year":"1996","journal-title":"Proc 2nd Annu Int Conf Comput Combinat"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1005140.1005147"},{"key":"ref29","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2009.02.021"},{"key":"ref8","first-page":"1","article-title":"Efficient private matching and set intersection","author":"freedman","year":"2004","journal-title":"Proc Adv Cryptol"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/508171.508174"},{"key":"ref2","first-page":"1","article-title":"The computer as a master mind","volume":"9","author":"knuth","year":"1977","journal-title":"Mathematical Recreations"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579188"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-005-0070-3"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/11681878_15","volume":"3876","author":"damgrd","year":"2006","journal-title":"Theory of Cryptography"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497482"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455804"},{"key":"ref26","first-page":"75","author":"odlyzko","year":"1990","journal-title":"Cryptology and Computational Number Theory"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-1-4615-1467-1_6","volume":"2","author":"du","year":"2001","journal-title":"E-Commerce Security and Privacy Advances in Information Security"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6331669\/06239593.pdf?arnumber=6239593","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:51:00Z","timestamp":1633909860000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6239593\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11]]},"references-count":39,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2012.2208581","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11]]}}}