Application of DNA Cryptography in Securing Confidential Information

2021 ◽  
Vol 15 (2) ◽  
2020 ◽  
Vol 24 (3) ◽  
pp. 363-388
Author(s):  
Philippe Kuhn

This article addresses monetary remedies in employment team move and misuse of confidential information cases. It argues that, after the Supreme Court's decision in One Step (Support) Ltd v Morris-Garner, negotiating (previously Wrotham Park) damages offer a useful additional compensatory tool in misuse of confidential information cases. They can help overcome some of the difficulties with ordinary contractual damages, equitable remedies for breach of fiduciary duty and confidence and limitations in injunctive relief. While One Step is restrictive overall, there is a real role for negotiating damages in employment cases where misuse of confidential information is the sole or predominant breach of contract. The well-established Faccenda approach is suggested for identifying the requisite confidential information.


Author(s):  
Satvir Singh

Steganography is the special art of hidding important and confidential information in appropriate multimedia carrier. It also restrict the detection of  hidden messages. In this paper we proposes steganographic method based on dct and entropy thresholding technique. The steganographic algorithm uses random function in order to select block of the image where the elements of the binary sequence of a secret message will be inserted. Insertion takes place at the lower frequency  AC coefficients of the  block. Before we insert the secret  message. Image under goes dc transformations after insertion of the secret message we apply inverse dc transformations. Secret message will only be inserted into a particular block if  entropy value of that particular block is greater then threshold value of the entropy and if block is selected by the random function. In  Experimental work we calculated the peak signal to noise ratio(PSNR), Absolute difference , Relative entropy. Proposed algorithm give high value of PSNR  and low value of Absolute difference which clearly indicate level of distortion in image due to insertion of secret message is reduced. Also value of  relative entropy is close to zero which clearly indicate proposed algorithm is sufficiently secure. 


Author(s):  
Вера Шумилина ◽  
Vera Shumilina ◽  
Юлия Коптева ◽  
Yulia Kopteva ◽  
Сатине Тевосян ◽  
...  

The authors disclose the basic concepts of this topic, prove the relevance, consider the types of threats to confidential information and methods of protection, both legal and organizational, presented an algorithm for creating a system for protecting confidential information.


Author(s):  
Joseph K. Tanimura ◽  
Eric W. Wehrly

According to many business publications, firms that experience information security breaches suffer substantial reputational penalties. This paper examines incidents in which confidential information, for a firms customers or employees, is stolen from or lost by publicly traded companies. Firms that experience such breaches suffer statistically significant losses in the market value of their equity. On the whole, the data indicate that these losses are of similar magnitudes to the direct costs. Thus, direct costs, and not reputational penalties, are the primary deterrents to information security breaches. Contrary to many published assertions, on average, firms that lose customer information do not suffer reputational penalties. However, when firms lose employee information, we find significant reputational penalties.


1987 ◽  
Vol 14 (2) ◽  
pp. 161-172
Author(s):  
Gary S. Marx ◽  
Jonathan D. Strum

2013 ◽  
Vol 443 ◽  
pp. 425-429
Author(s):  
Jing Shuang Lu ◽  
Chun Mei Du ◽  
Xin Guo ◽  
Lei Zhang

This essay describes a new radio encryption technique among communication equipments, that is embed confidential information in normal carrier by using digital watermarking to achieve the purpose of protecting confidential information and confusing illegal interceptors. Meanwhile it also gives embed watermarking based on integration and Detection Algorithm.


2014 ◽  
Vol 6 (5) ◽  
pp. 215-222 ◽  
Author(s):  
Tausif Anwar ◽  
Sanchita Paul ◽  
Shailendra Kumar Singh

Sign in / Sign up

Export Citation Format

Share Document