{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T01:53:28Z","timestamp":1776822808947,"version":"3.51.2"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T00:00:00Z","timestamp":1599004800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T00:00:00Z","timestamp":1599004800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["1817602"],"award-info":[{"award-number":["1817602"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s00453-020-00764-w","type":"journal-article","created":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T12:02:39Z","timestamp":1599048159000},"page":"531-552","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Covert Computation in Self-Assembled Circuits"],"prefix":"10.1007","volume":"83","author":[{"given":"Angel A.","family":"Cantu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Austin","family":"Luchsinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Schweller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Wylie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"764_CR1","doi-asserted-by":"crossref","unstructured":"Adleman, L.M., Cheng, Q., Goel, A., Huang, M.D.A., Kempe, D., de\u00a0Espan\u00e9s, P.M., Rothemund, P.W.K.: Combinatorial optimization problems in self-assembly. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 23\u201332 (2002)","DOI":"10.1145\/509907.509913"},{"key":"764_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.tcs.2006.10.025","volume":"378","author":"Y Brun","year":"2007","unstructured":"Brun, Y.: Arithmetic computation in the tile assembly model: addition and multiplication. Theor. Comput. Sci. 378, 17\u201331 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"764_CR3","doi-asserted-by":"publisher","unstructured":"Cantu, A.A., Luchsinger, A., Schweller, R., Wylie, T.: Covert computation in self-assembled circuits. In: Baier, C., Chatzigiannakis, I., Flocchini, P., Leonardi, S. (eds.) 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), Leibniz International Proceedings in Informatics (LIPIcs), vol. 132, pp. 31:1\u201331:14. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.31. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2019\/10607","DOI":"10.4230\/LIPIcs.ICALP.2019.31"},{"key":"764_CR4","doi-asserted-by":"crossref","unstructured":"Chalk, C., Demiane, E.D., Demaine, M.L., Martinez, E., Schweller, R., Vega, L., Wylie, T.: Universal shape replicators via self-assembly with attractive and repulsive forces. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201917) (2017)","DOI":"10.1137\/1.9781611974782.15"},{"key":"764_CR5","unstructured":"Chalk, C., Luchsinger, A., Schweller, R., Wylie, T.: Self-assembly of any shape with constant tile types using high temperature. In: Proceedings of the 26th Annual European Symposium on Algorithms, ESA\u201918 (2018)"},{"key":"764_CR6","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.B.: Multiparty unconditionally secure protocols (abstract). In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC\u201988), pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"764_CR7","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1137\/S0097539704446037","volume":"34","author":"Q Cheng","year":"2005","unstructured":"Cheng, Q., Aggarwal, G., Goldwasser, M.H., Kao, M.Y., Schweller, R.T., de Espan\u00e9s, P.M.: Complexities for generalized models of self-assembly. SIAM J. Comput. 34, 1493\u20131515 (2005)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"764_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pgen.1004224","volume":"10","author":"P Claes","year":"2014","unstructured":"Claes, P., Liberton, D.K., Daniels, K.E.A.: Modeling 3d facial shape from dna. PLOS Genet. 10(3), 1\u201314 (2014). https:\/\/doi.org\/10.1371\/journal.pgen.1004224","journal-title":"PLOS Genet."},{"key":"764_CR9","doi-asserted-by":"crossref","unstructured":"De\u00a0Cristofaro, E., Faber, S., Tsudik, G.: Secure genomic testing with size- and position-hiding private substring matching. In: Proceedings of the 12th ACM Workshop on Privacy in the Electronic Society, WPES\u201913, pp. 107\u2013118. ACM (2013)","DOI":"10.1145\/2517840.2517849"},{"issue":"12","key":"764_CR10","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2380656.2380675","volume":"55","author":"D Doty","year":"2012","unstructured":"Doty, D.: Theory of algorithmic self-assembly. Commun. ACM 55(12), 78\u201388 (2012)","journal-title":"Commun. ACM"},{"issue":"1","key":"764_CR11","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00453-012-9631-9","volume":"66","author":"D Doty","year":"2013","unstructured":"Doty, D., Kari, L., Masson, B.: Negative interactions in irreversible self-assembly. Algorithmica 66(1), 153\u2013172 (2013)","journal-title":"Algorithmica"},{"key":"764_CR12","doi-asserted-by":"crossref","unstructured":"Doty, D., Lutz, J.H., Patitz, M.J., Schweller, R., Summers, S.M., Woods, D.: The tile assembly model is intrinsically universal. In: Proceedings of the 53rd IEEE Conference on Foundations of Computer Science, FOCS \u201912 (2012)","DOI":"10.1109\/FOCS.2012.76"},{"issue":"3","key":"764_CR13","first-page":"552","volume":"105","author":"N Dowlin","year":"2017","unstructured":"Dowlin, N., Gilad-Bachrach, R., Laine, K., Lauter, K., Naehrig, M., Wernsing, J.: Manual for using homomorphic encryption for bioinformatics. Proc. IEEE 105(3), 552\u2013567 (2017)","journal-title":"Proc. IEEE"},{"key":"764_CR14","unstructured":"Evans, C.: Crystals that count! physical principles and experimental investigations of DNA tile self-assembly. Ph.D. thesis, California Inst. of Tech. (2014)"},{"key":"764_CR15","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences, 1st edn. W. H. Freeman, New York (1979)","edition":"1"},{"issue":"6117","key":"764_CR16","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1126\/science.1229566","volume":"339","author":"M Gymrek","year":"2013","unstructured":"Gymrek, M., McGuire, A.L., Golan, D., Halperin, E., Erlich, Y.: Identifying personal genomes by surname inference. Science 339(6117), 321\u2013324 (2013)","journal-title":"Science"},{"key":"764_CR17","doi-asserted-by":"publisher","unstructured":"Huang, Z., Ayday, E., Fellay, J., Hubaux, J., Juels, A.: Genoguard: Protecting genomic data against brute-force attacks. In: 2015 IEEE Symposium on Security and Privacy, pp. 447\u2013462 (2015). https:\/\/doi.org\/10.1109\/SP.2015.34","DOI":"10.1109\/SP.2015.34"},{"issue":"1","key":"764_CR18","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s11047-015-9512-7","volume":"15","author":"A Keenan","year":"2016","unstructured":"Keenan, A., Schweller, R., Sherman, M., Zhong, X.: Fast arithmetic in algorithmic self-assembly. Nat. Comput. 15(1), 115\u2013128 (2016)","journal-title":"Nat. Comput."},{"issue":"6822","key":"764_CR19","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1038\/35057062","volume":"409","author":"E Lander","year":"2001","unstructured":"Lander, E., Linton, L., et al.: Initial sequencing and analysis of the human genome. Nature 409(6822), 860\u2013921 (2001)","journal-title":"Nature"},{"key":"764_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-018-9707-9","author":"A Luchsinger","year":"2018","unstructured":"Luchsinger, A., Schweller, R., Wylie, T.: Self-assembly of shapes at constant scale using repulsive forces. Nat. Comput. (2018). https:\/\/doi.org\/10.1007\/s11047-018-9707-9","journal-title":"Nat. Comput."},{"issue":"2","key":"764_CR21","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s11047-013-9379-4","volume":"13","author":"MJ Patitz","year":"2014","unstructured":"Patitz, M.J.: An introduction to tile-based self-assembly and a survey of recent results. Nat. Comput. 13(2), 195\u2013224 (2014)","journal-title":"Nat. Comput."},{"key":"764_CR22","doi-asserted-by":"crossref","unstructured":"Patitz, M.J., Rogers, T.A., Schweller, R., Summers, S.M., Winslow, A.: Resiliency to multiple nucleation in temperature-1 self-assembly. In: Proceedings of DNA Computing and Molecular Programming, DNA\u201916, pp. 98\u2013113 (2016)","DOI":"10.1007\/978-3-319-43994-5_7"},{"key":"764_CR23","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-642-23638-9_15","volume":"6937","author":"MJ Patitz","year":"2011","unstructured":"Patitz, M.J., Schweller, R.T., Summers, S.M.: Exact shapes and turing universality at temperature 1 with a single negative glue. DNA Comp. Mol. Prog. LNCS 6937, 175\u2013189 (2011)","journal-title":"DNA Comp. Mol. Prog. LNCS"},{"issue":"17","key":"764_CR24","doi-asserted-by":"publisher","first-page":"1592","DOI":"10.1016\/j.tcs.2010.10.034","volume":"412","author":"JH Reif","year":"2011","unstructured":"Reif, J.H., Sahu, S., Yin, P.: Complexity of graph self-assembly in accretive systems and self-destructible systems. Theor. Comput. Sci. 412(17), 1592\u20131605 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"764_CR25","doi-asserted-by":"crossref","unstructured":"Schweller, R., Sherman, M.: Fuel efficient computation in passive self-assembly. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u201913, pp. 1513\u20131525. SIAM (2013)","DOI":"10.1137\/1.9781611973105.109"},{"issue":"4","key":"764_CR26","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00283-011-9256-x","volume":"33","author":"A Scott","year":"2011","unstructured":"Scott, A., Stege, U., van Rooij, I.: Minesweeper may not be np-complete but is hard nonetheless. Math. Intell. 33(4), 5\u201317 (2011)","journal-title":"Math. Intell."},{"issue":"4","key":"764_CR27","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1090\/S0002-9947-1913-1500960-1","volume":"14","author":"HM Sheffer","year":"1913","unstructured":"Sheffer, H.M.: A set of five independent postulates for Boolean algebras, with application to logical constants. Trans. Am. Math. Soc. 14(4), 481\u2013488 (1913)","journal-title":"Trans. Am. Math. Soc."},{"key":"764_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03927-4","volume-title":"Introduction to Circuit Complexity: A Uniform Approach","author":"H Vollmer","year":"1999","unstructured":"Vollmer, H.: Introduction to Circuit Complexity: A Uniform Approach. Springer, Berlin (1999)"},{"key":"764_CR29","unstructured":"Winfree, E.: Algorithmic Self-assembly of DNA. Ph.D. thesis, California Institute of Technology (1998)"},{"issue":"11","key":"764_CR30","doi-asserted-by":"publisher","first-page":"1192","DOI":"10.1007\/s11434-014-0170-4","volume":"59","author":"J Yang","year":"2014","unstructured":"Yang, J., Ma, J., Liu, S., Zhang, C.: A molecular cryptography model based on structures of DNA self-assembly. Chin. Sci. Bull. 59(11), 1192\u20131198 (2014). https:\/\/doi.org\/10.1007\/s11434-014-0170-4","journal-title":"Chin. Sci. Bull."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00764-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-020-00764-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00764-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,2]],"date-time":"2021-09-02T00:14:59Z","timestamp":1630541699000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-020-00764-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,2]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["764"],"URL":"https:\/\/doi.org\/10.1007\/s00453-020-00764-w","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,2]]},"assertion":[{"value":"27 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 September 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}