This paper proposes DNA-PKC, an asymmetric encryption and signature cryptosystem by combining the technologies of genetic engineering and cryptology. It is an exploratory research of biological cryptology. Similar to conventional public-key cryptology, DNA-PKC uses two pairs of keys for encryption and signature, respectively. Using the public encryption key, everyone can send encrypted message to a specified user, only the owner of the private decryption key can decrypt the ciphertext and recover the message; in the signature scheme, the owner of the private signing key can generate a signature that can be verified by other users with the public verification key, but no else can forge the signature. DNA-PKC differs from the conventional cryptology in that the keys and the ciphertexts are all biological molecules. The security of DNA-PKC relies on difficult biological problems instead of computational problems; thus DNA-PKC is immune from known attacks, especially the quantum computing based attacks.Keywords cryptology, asymmetric encryption, digital signature, biological cryptology, DNA CitationLai X J, Lu M X, Qin L, et al. Asymmetric encryption and signature method with DNA technology.
In this paper we present DNA-DBE, a DNA-chip-based dynamic broadcast encryption scheme. In our scheme, new users can join dynamically without modification of other users' decryption keys. Either the ciphertext or the decryption key is of constant-size. Backward secrecy is achieved in DNA-DBE: if new users join the system dynamically, they will not be able to retrieve past data. The security of our scheme relies on hard biological problems, which are immune to attacks of new computing technologies in the future. There exists a special feature in DNA-based cryptosystems, i.e. the set of encryption keys and the set of decryption keys have a many-to-many relationship. The implementation of more complicated DNA cryptosystems taking advantage of this special feature has been previously left as an open problem. Our DNA-DBE system is a solution to this open problem, which is also the first exploration of DNA based group-oriented encryption system.
Detecting bacterial cells with high specificity in deep tissues is challenging. Optical probes provide specificity, but are limited by the scattering and absorption of light in biological tissues. Conversely, magnetic...
This paper presents a DNA algorithm based on linear self-assembly which gives the result of the modular subtraction operation of two nonnegative integers. For two n-bit nonnegative integers A and B, the algorithm gives the result of A-B mod 2 n . An extended borrow tag which indicates the relation of the minuend and the subtrahend is included in the resulting strand so that the pre-classification based on A>B or B>A is not required before the experiment. From the resulting strand, we can draw the information of operation result, operands, borrow, and the tag of the relation between the minuend and the subtrahend. The algorithm takes advantage of the parallelism characteristic of DNA computing: while given two sets of operands (one the minuend set and the other subtrahend set), the modular subtraction operation of these two sets can be achieved by a parallel processing procedure. The feasibility of the algorithm is based on a known experiment. The algorithm is of spontaneous characteristic which prevents the scale of the experimental procedures from growing with the length of the operands. As for the length of the operands n, there are O(n) kinds of strands required in the experiment, and the biochemical experimental procedures can be accomplished in constant number of steps. DNA computing, DNA subtraction, modular, self-assembly Citation:Fang X W, Lai X J. DNA modular subtraction algorithm based on linear self-assembly.
Previously a DNA-chip-based asymmetric encryption and signature system DNA-PKC was proposed. In this paper we prove that DNA-PKC enjoys a special feature: for two distinct messages which are of identical length, the corresponding ciphertexts can be identical. Taking advantage of this feature, we present DNA-IH, which is the first DNA-chip-based information hiding scheme. In our scheme, given an ordinary message M o , a secret message M s is incorporated into the microarray C which represents the signature of M o . Only the intended recipient can retrieve the secret message M s , while other members can only read the ordinary message M o without knowing whether there exists any other secret message. Conventional information hiding process changes the statistical properties of the original data. The existence of secret messages embedded can be detected using statistical steganalysis schemes. In DNA-IH, for secret message and ordinary message, the corresponding DNA microarrays can be identical, statistical steganalysis is no longer able to detect whether or not a given DNA chip contains a secret message, i.e., in the aspect of preventing the adversary from distinguishing between the ordinary message microarray and the secret message microarray, information-theoretic security is achieved in DNA-IH.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.