Skip to main content
SpringerLink
Log in

A study on improving bounds for batch verification of DNA synthesis using concurrent ZKP

  • Original Article
  • Published:
International Journal of Information Technology Aims and scope Submit manuscript

Abstract

We consider the problem of optimizing the steps involved in the synthesis of DNA strings on a large scale. DNA molecules are a well-known reliable source for storing a large volume of digital data; at the same time, it is very much restricted in real-time usage due to their high cost. A large cluster of DNA strings of a fixed length (random quaternary) has to be partitioned into different batches of finite length with respect to some reference strand such that the sum of the lengths of different reference strands corresponding to each batch of strings is minimum. In this work, the problem is analyzed using a zero-knowledge simulator that recursively executes the protocol and thus helps achieve improved bounds over the cost function for each batch \(B_i\). Also, the proposed proof system allows the input of DNA strings with constraint (homopolymers) and without constraint. The simulator proposed for a single batch and multiple batch optimizations is further analyzed in terms of efficiency and running time, thereby improving the bound (upper and lower bound) of the overall cost of each batch for a given DNA strand.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Meiser LC, Antkowiak PL, Koch J, Chen WD, Kohll AX, Stark WJ, Heckel R, Grass RN (2020) Reading and writing digital data in DNA. Nat Protoc 15(1):86–101

    Article  Google Scholar 

  2. Church GM, Gao Y, Kosuri S (2012) Next-generation digital information storage in DNA. Science 337(6102):1628–1628

    Article  Google Scholar 

  3. Singh SP, Naidu ME (2020) DNA GR coding for data security using DNA sequence. Int J Inf Technol 12(2):571–576

    Google Scholar 

  4. Nandy N, Banerjee D, Pradhan C (2021) Color image encryption using DNA based cryptography. Int J Inf Technol 13(2):533–540

    Google Scholar 

  5. Mbarndouka Taamté J, Signing F, Ruben V, Kountchou Noube M, Bertrand B et al (2022) An efficient environmental monitoring data encryption algorithm based on DNA coding and hyperchaotic system. Int J Inf Technol 14(3):1367–1380

    Google Scholar 

  6. Raja G, Reddy US (2022) Solve dna sequence assembly problem using hybrid crow search optimization and multi classification techniques. Int J Inf Technol:1–7

  7. Kosuri S, Church GM (2014) Large-scale de novo DNA synthesis: technologies and applications. Nat Methods 11(5):499–507

    Article  Google Scholar 

  8. Goldman N, Bertone P, Chen S, Dessimoz C, LeProust EM, Sipos B, Birney E (2013) Towards practical, high-capacity, low-maintenance information storage in synthesized DNA. Nature 494(7435):77–80

    Article  Google Scholar 

  9. Makarychev K, Rácz MZ, Rashtchian C, Yekhanin S (2021) Batch optimization for dna synthesis. In: 2021 IEEE International symposium on information theory (ISIT). IEEE, pp 1949–1954

  10. Hannenhalli S, Hubbell E, Lipshutz R, Pevzner PA (2002) Combinatorial algorithms for design of DNA arrays. Chip Technol:1–19

  11. Rahmann S (2003) The shortest common supersequence problem in a microarray production setting. Bioinformatics 19(suppl-2):156–161

    Article  Google Scholar 

  12. Kahng AB, Măndoiu II, Pevzner PA, Reda S, Zelikovsky AZ (2004) Scalable heuristics for design of DNA probe arrays. J Comput Biol 11(2–3):429–447

    Article  Google Scholar 

  13. Ning K, Leong HW (2006) The distribution and deposition algorithm for multiple oligo nucleotide arrays. Genome Inform 17(2):89–99

    Google Scholar 

  14. Rahmann S (2006) Subsequence combinatorics and applications to microarray production, DNA sequencing and chaining algorithms. In: Annual symposium on combinatorial pattern matching. Springer, pp 153–164

  15. Kumar A, Cho M, Pan DZ (2010) DNA microarray placement for improved performance and reliability. In: Proceedings of 2010 international symposium on VLSI design, automation and test. IEEE, pp 275–278

  16. Trinca D, Rajasekaran S (2010) Fast local-search-based parallel algorithms for DNA probe placement on small oligonucleotide arrays. Adv Model Optim 12(1):45–55

    MathSciNet  Google Scholar 

  17. Ning K, Leong HW (2011) The multiple sequence sets: problem and heuristic algorithms. J Combin Optim 22(4):778–796

    Article  MathSciNet  MATH  Google Scholar 

  18. Goldwasser S, Micali S, Rackoff C (1989) The knowledge complexity of interactive proof systems. SIAM J Comput 18(1):186–208

    Article  MathSciNet  MATH  Google Scholar 

  19. Feige U, Shamir A (1990) Witness indistinguishable and witness hiding protocols. In: Proceedings of the twenty-second annual ACM symposium on theory of computing, pp 416–426

  20. Blum M (1986) How to prove a theorem so no one else can claim it. In: Proceedings of the international congress of mathematicians, vol 1. Citeseer, p 2

  21. Cramer R, Damgård I, Schoenmakers B (1994) Proofs of partial knowledge and simplified design of witness hiding protocols. In: Annual international cryptology conference. Springer, pp 174–187

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, School of Advanced Sciences, Vellore Institute of Technology, Vellore, Tamil Nadu, 632014, India

    Rajrupa Singh & R. Selvakumar

Authors
  1. Rajrupa Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Selvakumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. Selvakumar.

Ethics declarations

Conflict of interest

The authors declare that they have no competing interests regarding the publication of this paper.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Singh, R., Selvakumar, R. A study on improving bounds for batch verification of DNA synthesis using concurrent ZKP. Int. j. inf. tecnol. 15, 1417–1425 (2023). https://doi.org/10.1007/s41870-023-01169-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s41870-023-01169-y

Keywords

Search

Navigation