A molecular cryptography model based on structures of DNA self-assembly

Yang, Jing; Ma, Jingjing; Shi, Lei; Zhang, Cheng

doi:10.1007/s11434-014-0170-4

Cited by 30 publications

(19 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are 1.6×10 8 real DNA sequences found on the online database (NCBI database), that is, N 1 = 1.6×10 8 . In order to facilitate the probability comparison, we set the length of the reference strand in this paper is 1000 bp , the length of the primer is 5 bp , the number of circular DNA in the reference [ 13 ] is 1000, the length of the key strand in the reference [ 16 ] is 10 bp , namely n = n 3 = 1000, n 2 = 5, n 4 = 10. Therefore, the length of plaintext binary is the only unified variable.…”

Section: Discussion and Analysismentioning

confidence: 99%

“…All of the proposed one-time-pad DNA cryptosystems can be divided into two types: one is only make DNA database as a codebook to build a one-time-pad DNA cryptosystem and the other is to construct a brand new DNA cryptosystem based on some biological difficult problems [ 11 ]. The logical operations of one-time-pad DNA cryptosystems include substitution method [ 12 ] and XOR operation method [ 12 , 13 ]. The one-time-pad cryptosystem based on the substitution method uses the DNA database as a codebook to construct a mapping table which possesses a unique characteristic of the inverse mapping.…”

Section: Introductionmentioning

confidence: 99%

“…There DNA sequences are composed of a number of evenly distributed random bit sequence. The XOR logic operation is constructed by using the biological properties of DNA base and strand displacement techniques (using the principle ideas of central dogma of molecular biology [ 9 ] and theoretical [ 9 , 12 ] or biological experiments [ 13 ]). For example, the cryptography method [ 9 ] did not use real DNA computing but just used the principle of central dogma of molecular biology.…”

Section: Introductionmentioning

confidence: 99%

“…Gehani [ 12 ] designed two types of one-time-pad DNA encryption technologies by using mapping substitution and Exclusive-OR method respectively. Jing Yang et al [ 13 ] designed an XOR logical gate based on a DNA self-assembly structure by using DNA strand displacement and then proposed a one-time-pad scheme. In addition to designing a secure and efficient mapping and XOR operation scheme, the two methods mentioned above need to construct a large amount of one-time-pad codebook with strong randomness.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

One-time-pad cryptography scheme based on a three-dimensional DNA self-assembly pyramid structure

2018

View full text Add to dashboard Cite

The security strength of the traditional one-time-pad encryption system depends on the randomness of the secret key. However, It can hardly to generatea truerandom key by using the existing technologies and methods, and it is also difficult to issue and store the random keywhich is at least as long as the plaintext. Therefore, we pay more attention to the logical operation used in the encryption and decryption but not to how to generate the random key. The calculator, a three-dimensional DNA self-assembly pyramid structure, is designed to construct four common logical operations (AND, OR, NOT, XOR) by programming DNA interactions. And two novel one-time-pad cryptography schemes, a single-bit one-time-pad algorithm and improved double-bit one-time-pad algorithm, are proposed based on the calculator. The security fragments, used to construct the three-dimensional DNA self-assembly pyramid structure, are intercepted from a reference chain which is selected from the DNA database. All of the interception parameters are transmitted to recipient by hiding in DNA sequences. Only the authorized user can get all secret parameters to reconstruct the structure. The secret random key sequences for the two one-time-pad cryptography algorithms are generated by using logistic map. It only needs to share two parameters and thresholding function in sender and recipient without code books. The simulation results and security analysis show that the encryption algorithms are effective and can provide higher computational complexity as well as a reduced cracking probability except for the difficult of biological experiments.

show abstract

Section: Discussion and Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

One-time-pad cryptography scheme based on a three-dimensional DNA self-assembly pyramid structure

2018

View full text Add to dashboard Cite

show abstract

“…There are databases of anonymous DNA sequences, which can sometimes be deanonymized with only small amounts of information such as a surname [13], or by reconstructing physical features from the DNA [6]. In order to address these issues, there has been work on cryptographic schemes aimed at obscuring results related to DNA or the input/output [7,11,14,26].…”

Section: :2mentioning

confidence: 99%

Covert Computation in Self-Assembled Circuits

et al. 2020

View full text Add to dashboard Cite

Traditionally, computation within self-assembly models is hard to conceal because the self-assembly process generates a crystalline assembly whose computational history is inherently part of the structure itself. With no way to remove information from the computation, this computational model offers a unique problem: how can computational input and computation be hidden while still computing and reporting the final output? Designing such systems is inherently motivated by privacy concerns in biomedical computing and applications in cryptography. In this paper we propose the problem of performing "covert computation" within tile self-assembly that seeks to design self-assembly systems that "conceal" both the input and computational history of performed computations. We achieve these results within the growth-only restricted abstract tile assembly model (aTAM) with positive and negative interactions. We show that general-case covert computation is possible by implementing a set of basic covert logic gates capable of simulating any circuit (functionally complete). To further motivate the study of covert computation, we apply our new framework to resolve an outstanding complexity question; we use our covert circuitry to show that the unique assembly verification problem within the growth-only aTAM with negative interactions is coNP-complete.

show abstract

Dendritic Quaternary‐Encoded Oligourethanes for Data Encryption

Shi

Zhou

et al. 2022

Angewandte Chemie

View full text Add to dashboard Cite

The use of sequence-defined digital polymers for data storage and encryption has received increasing attention due to their precision structures similar to natural biomacromolecules (e.g., DNA) but increased stability. However, the rapid development of sequencing techniques raises the concern of information leakage.Herein, dendritic quaternary-encoded oligourethanes bearing a photoresponsive trigger, self-immolative backbones, and a mass spectrometry tag of PEG dendron have been developed for data encryption. Although the sequence information in linear analogs can be readily deciphered by mass spectrometry, sequencing of dendritic oligourethanes cannot be achieved by either primary MS or tandem MS/MS owing to the unique spatial conformation. Intriguingly, the fragmentation pathways of a quaternary dendrimer under MS/MS conditions can be converted to 2772-bit 2D matrices with � 1.98 × 10 87 permutations, serving as high-strength encryption keys for highly reliable data encryption.

show abstract

A molecular cryptography model based on structures of DNA self-assembly

Cited by 30 publications

References 21 publications

One-time-pad cryptography scheme based on a three-dimensional DNA self-assembly pyramid structure

One-time-pad cryptography scheme based on a three-dimensional DNA self-assembly pyramid structure

Covert Computation in Self-Assembled Circuits

Dendritic Quaternary‐Encoded Oligourethanes for Data Encryption

Contact Info

Product

Resources

About