Document Type
Conference Proceeding
Publication Date
2023
Abstract
There have been many advances in molecular computation that offer benefits such as targeted drug delivery, nanoscale mapping, and improved classification of nanoscale organisms. This power led to recent work exploring privacy in the computation, specifically, covert computation in self-assembling circuits. Here, we prove several important results related to the concept of a hidden computation in the most well-known model of self-assembly, the Abstract Tile-Assembly Model (aTAM). We show that in 2D, surprisingly, the model is capable of covert computation, but only with an exponentialsized assembly. We also show that the model is capable of covert computation with polynomial-sized assemblies with only one step in the third dimension (just-barely 3D). Finally, we investigate types of functions that can be covertly computed as members of P/Poly.
Recommended Citation
Alaniz, Robert M., David Caballero, Timothy Gomez, Elise Grizzell, Andrew Rodriguez, Robert Schweller, and Tim Wylie. "Covert Computation in the Abstract Tile-Assembly Model." In 2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.SAND.2023.12
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Publication Title
2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023)
DOI
https://doi.org/10.4230/LIPIcs.SAND.2023.12
Comments
© Robert M. Alaniz, David Caballero, Timothy Gomez, Elise Grizzell, Andrew Rodriguez, Robert Schweller, and Tim Wylie; licensed under Creative Commons License CC-BY 4.0