Benjamin Arazi
Benjamin Arazi has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Eric Christian Rouchka
Department of Biochemistry and Molecular Genetics, University of Louisville, Louisville, KY, USA
6 shared publications - Christy M. Bogard
Department of Computer Engineering and Computer Science, University of Louisville, Louisville, KY 40292, USA
3 shared publications H. Qi
2 shared publicationsI. Elhanany
2 shared publicationsO. Arazi
2 shared publicationsY. Dotan
2 shared publications
Latest Publications
- 1 August 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 248-251
DNA-based dynamic logic circuitry
DNA computing is an emerging field of research in which biochemistry and molecular biology elements are utilized to complete computational processes performed by traditional silicon-based technologies. This research focuses on further developing DNA-based methodologies to mimic digital data manipulation, demonstrating how information can be parsed through a circuit comprised of DNA-based dynamic logic gates. By dynamics we mean interactivity among the gates. A novel logic gate design based on chemical reactions is presented in which observance of double stranded sequences indicates a truth evaluation. An exemplifying application of our results, beside their fundamental significance, pertains to circuit security, providing for obfuscation and tamper-proofing. Furthermore, DNA-based dynamic logic gates enable ternary logic and the compression of circuitry.
- 1 August 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 248-251
DNA-based dynamic logic circuitry
DNA computing is an emerging field of research in which biochemistry and molecular biology elements are utilized to complete computational processes performed by traditional silicon-based technologies. This research focuses on further developing DNA-based methodologies to mimic digital data manipulation, demonstrating how information can be parsed through a circuit comprised of DNA-based dynamic logic gates. By dynamics we mean interactivity among the gates. A novel logic gate design based on chemical reactions is presented in which observance of double stranded sequences indicates a truth evaluation. An exemplifying application of our results, beside their fundamental significance, pertains to circuit security, providing for obfuscation and tamper-proofing. Furthermore, DNA-based dynamic logic gates enable ternary logic and the compression of circuitry.
- Open Access
- 23 July 2010
- Published by Springer Nature in BMC Bioinformatics
- Vol. 11 (S4) , P31
Design of a DNA-based shift register
- 23 July 2010
- Published by Springer Nature in BMC Bioinformatics
- Vol. 11 (S4) , P31
Open AccessDesign of a DNA-based shift register
- 1 June 2010
- Published by Elsevier in BioSystems
- Vol. 100 (3) , 208-214
DNA-based random number generation in security circuitry
- 1 June 2010
- Published by Elsevier in BioSystems
- Vol. 100 (3) , 208-214
DNA-based random number generation in security circuitry
- Open Access
- 21 April 2010
- Published by Association for Computing Machinery (ACM)
- p. 1-4
A data security protocol for the Trusted Truck® system
- 21 April 2010
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Open AccessA data security protocol for the Trusted Truck® system
- 20 February 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 8 (7) , 968-974
Message Authentication in Computationally Constrained Environments
RFID and wireless sensor networks exemplify computationally constrained environments, where the compact nature of the components cannot support complex computations or high communication overhead. On the other hand, such components should support security applications such as message integrity, authentication, and time stamping. The latter are efficiently implemented by hash message authentication codes (HMAC). As clearly stated in the literature, current approved implementations of HMAC require resources that cannot be supported in constrained components. An approach to implement a compact HMAC by the use of stream ciphering is presented in this paper.
- 20 February 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 8 (7) , 968-974
Message Authentication in Computationally Constrained Environments
RFID and wireless sensor networks exemplify computationally constrained environments, where the compact nature of the components cannot support complex computations or high communication overhead. On the other hand, such components should support security applications such as message integrity, authentication, and time stamping. The latter are efficiently implemented by hash message authentication codes (HMAC). As clearly stated in the literature, current approved implementations of HMAC require resources that cannot be supported in constrained components. An approach to implement a compact HMAC by the use of stream ciphering is presented in this paper.
- 1 January 2009
- Published by Walter de Gruyter GmbH in International Journal on Disability and Human Development
- Vol. 8 (3) , 199-206
Enhancing elderly utilization of social networks
- 1 January 2009
- Published by Walter de Gruyter GmbH in International Journal on Disability and Human Development
- Vol. 8 (3) , 199-206
Enhancing elderly utilization of social networks
- Open Access
- 1 August 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 51 (15483746) , 597-600
Toward DNA-based security circuitry: First step random number generation
DNA-based circuit design is an area of research in which traditional silicon-based technologies are replaced by naturally occurring phenomena taken from biochemistry and molecular biology. Our team investigates the implications of DNA-based circuit design in serving security applications. As an initial step, we develop a random number generation circuitry. A novel prototype schema employs solid-phase synthesis of oligonucleotides for random construction of DNA sequences. Temporary storage and retrieval is achieved through plasmid vectors.
- 1 August 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 51 (15483746) , 597-600
Open AccessToward DNA-based security circuitry: First step random number generation
DNA-based circuit design is an area of research in which traditional silicon-based technologies are replaced by naturally occurring phenomena taken from biochemistry and molecular biology. Our team investigates the implications of DNA-based circuit design in serving security applications. As an initial step, we develop a random number generation circuitry. A novel prototype schema employs solid-phase synthesis of oligonucleotides for random construction of DNA sequences. Temporary storage and retrieval is achieved through plasmid vectors.
- 1 August 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 310-313
Mapping multiplicity aspects of secure communications into efficient parallel processing
Certification in public key cryptographic applications concerns the involvement of a CA (certifying agent) in approving the validity of userspsila public keys. Distributed certification pertains to the case where several CAs are involved in issuing certificates. This also includes the case of multi-attribute certification, where different CAs approve different userpsilas attributes. In delegated certification, agents transfer certificate issuing authority in hierarchical chain. Efficient certificate verification is of a specific need in ad-hoc networks, as such a verification has to be performed each time new parties have to be engaged in secure communications. Distributed, multi-attribute and delegated certification techniques having a low computational complexity are presented in this paper. It is shown how multiplicity aspects of the various applications are mapped into a multiplied exponents mathematical operation of the form in given equation Pii=1 m Ai b imod p. Hardware implementation of this operation boils down to one exponentiator and a multiplexer, with execution time equivalent to one exponentiation.
- 1 August 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 310-313
Mapping multiplicity aspects of secure communications into efficient parallel processing
Certification in public key cryptographic applications concerns the involvement of a CA (certifying agent) in approving the validity of userspsila public keys. Distributed certification pertains to the case where several CAs are involved in issuing certificates. This also includes the case of multi-attribute certification, where different CAs approve different userpsilas attributes. In delegated certification, agents transfer certificate issuing authority in hierarchical chain. Efficient certificate verification is of a specific need in ad-hoc networks, as such a verification has to be performed each time new parties have to be engaged in secure communications. Distributed, multi-attribute and delegated certification techniques having a low computational complexity are presented in this paper. It is shown how multiplicity aspects of the various applications are mapped into a multiplied exponents mathematical operation of the form in given equation Pii=1 m Ai b imod p. Hardware implementation of this operation boils down to one exponentiator and a multiplexer, with execution time equivalent to one exponentiation.
- Open Access
- 8 July 2008
- Published by Springer Nature in BMC Bioinformatics
- Vol. 9 (S7) , P13-1
Random number generation for DNA-based security circuitry
- 8 July 2008
- Published by Springer Nature in BMC Bioinformatics
- Vol. 9 (S7) , P13-1
Open AccessRandom number generation for DNA-based security circuitry
- Open Access
- 12 May 2008
- Published by Association for Computing Machinery (ACM)
- p. 1-2
Mobile components security
Secure communications among mobile components, like wireless sensors and RFID tags, emerge as a fundamental branch of network security, needing message confidentiality, integrity and authentication. That is: protecting the content of transmitted information, assuring that it was not altered during transmission, and proving that it was sent by an approved identified source. Object integrity is another very relevant security application. Here, the purpose is to prove that an object, having storage and transmission facilities, is not cloned. We treat the hardware implementation of security measures in mobile components while considering two major issues: Resource constraints: Such components operate under highly constrained conditions, posing a demand for minimal logic hardware while providing for approved and recognized security level. Memory security: Wireless Sensors and RFID tags are deployed in hostile environments, enhancing a need for tamper-proof storage of their secret keys. The contribution of the paper is 3-fold: -- We present a novel approach to hardware minimization, serving message security while relying on approved security levels.- We show that memory security is not merely a physical problem, apparently independent of the served applications. This observation can be made general. -- Attention is devoted to recently announced logic gates fabrication techniques, and their relation to the devised approach, as well as their potential contribution to general security applications.
- 12 May 2008
- Published by Association for Computing Machinery (ACM)
- p. 1-2
Open AccessMobile components security
Secure communications among mobile components, like wireless sensors and RFID tags, emerge as a fundamental branch of network security, needing message confidentiality, integrity and authentication. That is: protecting the content of transmitted information, assuring that it was not altered during transmission, and proving that it was sent by an approved identified source. Object integrity is another very relevant security application. Here, the purpose is to prove that an object, having storage and transmission facilities, is not cloned. We treat the hardware implementation of security measures in mobile components while considering two major issues: Resource constraints: Such components operate under highly constrained conditions, posing a demand for minimal logic hardware while providing for approved and recognized security level. Memory security: Wireless Sensors and RFID tags are deployed in hostile environments, enhancing a need for tamper-proof storage of their secret keys. The contribution of the paper is 3-fold: -- We present a novel approach to hardware minimization, serving message security while relying on approved security levels.- We show that memory security is not merely a physical problem, apparently independent of the served applications. This observation can be made general. -- Attention is devoted to recently announced logic gates fabrication techniques, and their relation to the devised approach, as well as their potential contribution to general security applications.