High-speed 3D DNA-PAINT and unsupervised clustering for unlocking 3D DNA origami cryptography

Author:

Wisna G. Bimananda M.ORCID,Sukhareva Daria,Zhao Jonathan,Satyabola DeekshaORCID,Matthies MichaelORCID,Roy Subhajit,Šulc PetrORCID,Yan Hao,Hariadia Rizal F.ORCID

Abstract

AbstractDNA origami cryptography, which employs nanoscale steganography to conceal information within folded DNA origami nanostructures, shows promise as a secure molecular cryptography technique due to the large 700-bit key size generated through scaffold routing and sliding and the interlacing of staple strands.1However, achieving the promised security, high information density, fast pattern detection, and accurate information readout requires even more secure cryptography and fast readout. Here, we advance the DNA origami cryptography protocol by demonstrating its ability to encrypt specific information in both 2D and 3D DNA origami structures, thus increasing the number of possible scaffold routings and improving the encryption key size. To this end, we used all-DNA-based steganography, enabled by high-speed 2D and 3D DNA-PAINT super-resolution imaging, which does not require protein binding to reveal the pattern, allowing for higher information density. We combined 2D and 3D DNA-PAINT data with unsupervised clustering, achieving up to 89% accuracy and high ratios of correct-to-wrong readout despite significant flexibility in the 3D DNA origami structure shown by oxDNA simulation. Furthermore, we propose design criteria that ensure complete information retrieval for the DNA origami cryptography protocol. We anticipate that this technique will be highly secure and versatile, making it an ideal solution for secure data transmission and storage via DNA.

Publisher

Cold Spring Harbor Laboratory

Reference61 articles.

1. DNA origami cryptography for secure communication;Nature communications,2019

2. Riordan M , Hoddeson L. Crystal fire: The birth of the information age. WW Norton & Company; 1997.

3. Katz J , Lindell Y. Introduction to modern cryptography. CRC press; 2020.

4. Goldreich O. Modern cryptography, probabilistic proofs and pseudorandomness. vol. 17. Springer Science & Business Media; 1998.

5. National Institute of Standards and Technology. Advanced encryption standard (AES). Gaithersburg, MD; 2001.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3