Private Key
Recently Published Documents


TOTAL DOCUMENTS

661
(FIVE YEARS 388)

H-INDEX

20
(FIVE YEARS 8)

2022 ◽  
Vol 12 (2) ◽  
pp. 734
Author(s):  
Jaehyoung Park ◽  
Hyuk Lim

Federated learning (FL) is a machine learning technique that enables distributed devices to train a learning model collaboratively without sharing their local data. FL-based systems can achieve much stronger privacy preservation since the distributed devices deliver only local model parameters trained with local data to a centralized server. However, there exists a possibility that a centralized server or attackers infer/extract sensitive private information using the structure and parameters of local learning models. We propose employing homomorphic encryption (HE) scheme that can directly perform arithmetic operations on ciphertexts without decryption to protect the model parameters. Using the HE scheme, the proposed privacy-preserving federated learning (PPFL) algorithm enables the centralized server to aggregate encrypted local model parameters without decryption. Furthermore, the proposed algorithm allows each node to use a different HE private key in the same FL-based system using a distributed cryptosystem. The performance analysis and evaluation of the proposed PPFL algorithm are conducted in various cloud computing-based FL service scenarios.


Author(s):  
Ramireddy Navatejareddy ◽  
Muthukuru Jayabhaskar ◽  
Bachala Sathyanarayana

<p>Image <span>encryption enables users to safely transmit digital photographs via a wireless medium while maintaining enhanced anonymity and validity. Numerous studies are being conducted to strengthen picture encryption systems. Elliptical curve cryptography (ECC) is an effective tool for safely transferring images and recovering them at the receiver end in asymmetric cryptosystems. This method's key generation generates a public and private key pair that is used to encrypt and decrypt a picture. They use a public key to encrypt the picture before sending it to the intended user. When the receiver receives the image, they use their private key to decrypt it. This paper proposes an ECC-dependent image encryption scheme utilizing an enhancement strategy based on the gravitational search algorithm (GSA) algorithm. The private key generation step of the ECC system uses a GSA-based optimization process to boost the efficiency of picture encryption. The image's output is used as a health attribute in the optimization phase, such as the peak signal to noise ratio (PSNR) value, which demonstrates the efficacy of the proposed approach. As comparison to the ECC method, it has been discovered that the suggested encryption scheme offers better optimal PSNR </span>values.</p>


2022 ◽  
Vol 2161 (1) ◽  
pp. 012014
Author(s):  
Chiradeep Gupta ◽  
N V Subba Reddy

Abstract Cryptography is related and referred to as the secured transmission of messages amongst the sender and the intended receiver by ensuring confidentiality, integrity, and authentication. Diffie – Hellman (DH) key exchange protocol is a well-known algorithm that would generate a shared secret key among the sender and the intended receiver, and the basis of cryptosystems for using public and private key for encryption and decryption process. But it is severely affected by the Man in the Middle (MITM) attack that would intercept and manipulate thus eavesdropping the shared secret key. This paper proposes a model of integrating the public-key RSA cryptography system with the DH key exchange to prevent the MITM attack. The performance of the proposed work has been compared to the DH Key Exchange algorithm as well as RSA Cryptosystem to conclude for effectiveness of the proposed model.


Cryptography ◽  
2021 ◽  
Vol 6 (1) ◽  
pp. 1
Author(s):  
Jongkil Kim ◽  
Yang-Wai Chow ◽  
Willy Susilo ◽  
Joonsang Baek ◽  
Intae Kim

We propose a new functional encryption for pattern matching scheme with a hidden string. In functional encryption for pattern matching (FEPM), access to a message is controlled by its description and a private key that is used to evaluate the description for decryption. In particular, the description with which the ciphertext is associated is an arbitrary string w and the ciphertext can only be decrypted if its description matches the predicate of a private key which is also a string. Therefore, it provides fine-grained access control through pattern matching alone. Unlike related schemes in the literature, our scheme hides the description that the ciphertext is associated with. In many practical scenarios, the description of the ciphertext cannot be public information as an attacker may abuse the message description to identify the data owner or classify the target ciphertext before decrypting it. Moreover, some data owners may not agree to reveal any ciphertext information since it simply gives greater advantage to the adversary. In this paper, we introduce the first FEPM scheme with a hidden string, such that the adversary cannot get any information about the ciphertext from its description. The security of our scheme is formally analyzed. The proposed scheme provides both confidentiality and anonymity while maintaining its expressiveness. We prove these security properties under the interactive general Diffie–Hellman assumption (i-GDH) and a static assumption introduced in this paper.


2021 ◽  
pp. 494-505
Author(s):  
Alexandr A. Kuznetsov ◽  
Yurii Gorbenko ◽  
Anastasiia Kiian Anastasiia Kiian ◽  
Yuliia V. Ulianovska ◽  
Tetiana Kuznetsova

Pseudo-random number generator is an important mechanism for cryptographic information protection. It can be used independently to generate special data or as the most important element of security of other mechanisms for cryptographic information protection. The application of transformations in a group of points of elliptic and hypereliptic curves is an important direction for the designing of cryptographically stable pseudo-random sequences generators. This approach allows us to build  the resistant cryptographic algorithms in which the problem of finding a private key is associated with solving the discrete logarithm problem. This paper proposes a method for generating pseudo-random sequences of the maximum period using transformations on the elliptic curves. The maximum sequence period is provided by the use of recurrent transformations with the sequential formation of the elements of the point group of the elliptic curve. In this case, the problem of finding a private key is reduced to solving a theoretically complex discrete logarithm problem. The article also describes the block diagram of the device for generating pseudo-random sequences and the scheme for generating internal states of the generator.


Author(s):  
Mohamad Tariq Barakat ◽  
Rushdi Abu Zneit ◽  
Ziad A. Alqadi

Multiple methods are used to hide secret messages in digital color images, and the most important and most common is the least significant bit (LSB) method. The LSB method is a known and exposed method, and anyone with programming experience can retrieve the secret message embedded in the digital image. In this paper research we will add some enhancements to improve the security level of LSB method to protect the embedded secret message from being hacked. A simple method of secret message cryptography will be used to encrypt the secret message before bedding it using LSB method. The method will be based on using color image as an image_key; this image_key will be resized to generate the needed secret private key used to encrypt-decrypt secret message. The length and the contents of the generated private key will dynamically change depending on the message length and the selected image_key. The selected image_key will be kept in secret without transmission and will be known only by the sender and receiver and it can be changed any time when needed. The proposed crypto_steganographic method will be implemented to show how it will increase the level o secret message protection.


2021 ◽  
Author(s):  
Xiangyu Chang ◽  
Wei Li ◽  
Aimin Yan ◽  
Peter Wai Ming Tsang ◽  
Ting-Chung Poon

Abstract We propose an asymmetric cryptosystem based on optical scanning cryptography (OSC) and elliptic curve cryptography (ECC) algorithm. In the encryption stage of OSC, an object is encrypted to cosine and sine holograms by two pupil functions calculated via ECC algorithm from sender’s biometric image, which is sender’s private key. With the ECC algorithm, these holograms are encrypted to ciphertext, which is sent to the receiver. In the stage of decryption, the ciphered holograms can be decrypted by receiver’s biometric private key which is different from the sender’s private key. The approach is an asymmetric cryptosystem which solves the problem of the management and dispatch of keys in OSC and has more security strength than it. The feasibility of the proposed method has been convincingly verified by numerical and experiment results.


Webology ◽  
2021 ◽  
Vol 18 (2) ◽  
pp. 88-104
Author(s):  
M. Raja ◽  
Dr.S. Dhanasekaran ◽  
Dr.V. Vasudevan

Many medical companies use cloud technology to collect, distribute and transmit medical records. Given the need for medical information, confidentiality is a key issue. In this study, we propose an encrypted scheme based on encrypted data for an electronic healthcare environment. We use hybrid Attribute based encryption and Triple DES encryption technique (ABETDES) scheme, including identity-based cryptography (IBC), to ensure data privacy through communication channels և to improve the reliability of cloud computing. There are also limited indicators of light processing and storage resources. This solves a serious maintenance problem and ensures that a private key is created where it is not blind. The introduction of a security option, a comprehensive security analysis to protect ciphertext, shows that our program is effective against many known attacks and compared to existing methods.


2021 ◽  
Vol 183 (41) ◽  
pp. 1-8
Author(s):  
Ziad Alqadi ◽  
Yousif Eltous ◽  
Amjad Al Hindi
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document