Highly Emissive Zero-dimensional Antimony Halide for Anti-counterfeiting and Confidential Information Encryption-Decryption

2021 ◽  
pp. 134336
Author(s):  
Jian-Qiang Zhao ◽  
Hua-Sen Shi ◽  
Le-Ran Zeng ◽  
Hui Ge ◽  
Yu-Han Hou ◽  
...  
Keyword(s):  
Confidential Information ◽  
Encryption Decryption

scholarly journals METHOD OF ENCRYPTION/DECRYPTION OF DATA ON THE BASIS OF THE PIXEL ALPHABET OF MONOCHROME IMAGE

2021 ◽  
pp. 51-60
Author(s):  
O. V. Samchyshyn ◽  
I. V. Humeniuk ◽  
K. V. Smetanin ◽  
O. S. Bojchenko
Keyword(s):  
High Stability ◽  
Data Encryption ◽  
Confidential Information ◽  
Data Transformations ◽  
Unauthorized Access ◽  
Graphic Data ◽  
Combined Use ◽  
Monochrome Image ◽  
Text Information ◽  
Encryption Decryption

Improving the availability of information technology and increasing the volume of digital traffic leads to an important problem of data protection. A particularly pressing issue is the problem of transmitting confidential data through unsecured communication channels, such as the Internet. Recently, there has been a significant increase in the number of cyberattacks, including attempts to intercept and steal confidential information transmitted through global information networks. Information security in computer information and telecommunication systems is a priority. To date, one of the most reliable methods of protecting information is rightly considered to be encryption. Cryptographic data transformations are the most effective way for a system to maintain the confidentiality of information as it is entered, output, transmitted, processed, and stored, and to resist its destruction, theft, or distortion. But the most effective way to ensure the confidentiality of information is the combined use of steganographic and cryptographic means. In order to ensure high stability of encrypted information when transmitting it through the network of information and telecommunications systems and reduce the threat of unauthorized access to it or attack on the cipher, it is proposed to change the approach to solving the problem of data encryption. A method of encrypting / decrypting digital text information based on the pixel alphabet of a monochrome image, which is based on hiding or distorting graphic data, is proposed. This approach allows you to ensure high stability of encrypted information and significantly reduce the risk of unauthorized access to confidential information or attack on the cipher by encrypting each character with a dynamic random number from the range of values of the corresponding character and hiding the encrypted text in the position of graphic data. sender and recipient only.

A Review on Chaos-Based Image Encryption Using Fractal Function

2020 ◽  
pp. 23-37
Author(s):  
Anandkumar R. ◽  
Kalpana R.
Keyword(s):  
Image Encryption ◽  
Digital Image ◽  
Initial Conditions ◽  
Digital Data ◽  
Great Change ◽  
Fractal Function ◽  
Confidential Information ◽  
Encryption And Decryption ◽  
Chaotic Image Encryption ◽  
Encryption Decryption

The tremendous development in the field of telecommunication and computer technologies leads to the preference of transferring information as a digital data. In this transformation of information, cryptography helps in encrypting/decrypting digital data, so that intruders will not be able to sniff the highly confidential information. Most information is transferred as a digital image, where image encryption is done by scrambling the original pixels of the image, and hence, the correlation between the original pixel and scrambled pixel differs leading to confusion to unauthorized accesses. Chaotic image encryption is one of the recent technologies in cryptosystems, where a pseudorandom and irregular key is used for encryption/decryption, as the key suffers a great change if some initial conditions are altered, leading to highly secured transmission in the network. In this chapter, a detailed survey is conducted on chaotic image encryption using fractal function, in which fractal key is used for encryption and decryption of an image.

Negotiating Damages after One Step: Employment Team Move and Misuse of Confidential Information Cases

2020 ◽  
Vol 24 (3) ◽  
pp. 363-388
Author(s):  
Philippe Kuhn
Keyword(s):  
Fiduciary Duty ◽  
Confidential Information ◽  
Breach Of Contract ◽  
Injunctive Relief ◽  
One Step

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.

Efficient Steganography Algorithm Based On DCT And Entropy Thresholding Technique

2018 ◽  
Vol 8 (1) ◽  
pp. 45
Author(s):  
Satvir Singh
Keyword(s):  
Relative Entropy ◽  
Experimental Work ◽  
Random Function ◽  
Signal To Noise Ratio ◽  
Binary Sequence ◽  
Threshold Value ◽  
Absolute Difference ◽  
Secret Message ◽  
Signal To Noise ◽  
Confidential Information

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. 

MAJOR PROBLEMS OF CONFIDENTIAL INFORMATION PROTECTION AND THE WAYS OF THEIR SOLUTION

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

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.

The Market Value and Reputational Effects from Lost Confidential Information

2015 ◽  
Vol 5 (4) ◽  
Author(s):  
Joseph K. Tanimura ◽  
Eric W. Wehrly
Keyword(s):  
Information Security ◽  
Market Value ◽  
Direct Costs ◽  
Publicly Traded ◽  
Confidential Information ◽  
Publicly Traded Companies ◽  
Security Breaches ◽  
Customer Information ◽  
Employee Information

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.

scholarly journals An encryption–decryption framework to validating single-particle imaging

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Zhou Shen ◽  
Colin Zhi Wei Teo ◽  
Kartik Ayyer ◽  
N. Duane Loh
Keyword(s):  
Conceptual Framework ◽  
Single Particle ◽  
Latent Variables ◽  
Ground Truth ◽  
Resolving Power ◽  
Validation Measure ◽  
Encryption Decryption ◽  
Diffraction Patterns ◽  
Particle Imaging ◽  
Single Particle Imaging

AbstractWe propose an encryption–decryption framework for validating diffraction intensity volumes reconstructed using single-particle imaging (SPI) with X-ray free-electron lasers (XFELs) when the ground truth volume is absent. This conceptual framework exploits each reconstructed volumes’ ability to decipher latent variables (e.g. orientations) of unseen sentinel diffraction patterns. Using this framework, we quantify novel measures of orientation disconcurrence, inconsistency, and disagreement between the decryptions by two independently reconstructed volumes. We also study how these measures can be used to define data sufficiency and its relation to spatial resolution, and the practical consequences of focusing XFEL pulses to smaller foci. This conceptual framework overcomes critical ambiguities in using Fourier Shell Correlation (FSC) as a validation measure for SPI. Finally, we show how this encryption-decryption framework naturally leads to an information-theoretic reformulation of the resolving power of XFEL-SPI, which we hope will lead to principled frameworks for experiment and instrument design.

scholarly journals BESTIE: Broadcast Encryption Scheme for Tiny IoT Equipment

Electronics ◽  
2020 ◽  
Vol 9 (9) ◽  
pp. 1389
Author(s):  
Jiwon Lee ◽  
Jihye Kim ◽  
Hyunok Oh
Keyword(s):  
The Other ◽  
Public Key ◽  
Broadcast Encryption ◽  
Encryption Scheme ◽  
The Public ◽  
Private Key ◽  
Diffie Hellman ◽  
The Standard Model ◽  
Encryption Decryption ◽  
Subset Difference

In public key broadcast encryption, anyone can securely transmit a message to a group of receivers such that privileged users can decrypt it. The three important parameters of the broadcast encryption scheme are the length of the ciphertext, the size of private/public key, and the performance of encryption/decryption. It is suggested to decrease them as much as possible; however, it turns out that decreasing one increases the other in most schemes. This paper proposes a new broadcast encryption scheme for tiny Internet of Things (IoT) equipment (BESTIE), minimizing the private key size in each user. In the proposed scheme, the private key size is O(logn), the public key size is O(logn), the encryption time per subset is O(logn), the decryption time is O(logn), and the ciphertext text size is O(r), where n denotes the maximum number of users, and r indicates the number of revoked users. The proposed scheme is the first subset difference-based broadcast encryption scheme to reduce the private key size O(logn) without sacrificing the other parameters. We prove that our proposed scheme is secure under q-Simplified Multi-Exponent Bilinear Diffie-Hellman (q-SMEBDH) in the standard model.

Sign in / Sign up

Export Citation Format

Share Document