scholarly journals Methods and Algorithms for Pseudo-probabilistic Encryption with Shared Key

2018 ◽  
Vol 6 (61) ◽  
pp. 119-146
Author(s):  
Alexandr Moldovyan ◽  
Nikolay Moldovyan
Keyword(s):  
Block Ciphers ◽  
Public Key ◽  
Information Protection ◽  
Secret Key ◽  
Bijective Mapping ◽  
Construction Scheme ◽  
Symmetric Ciphers ◽  
Encryption Algorithms ◽  
Probabilistic Encryption ◽  
Shared Key

As a method for providing security of the messages sent via a public channel in the case of potential coercive attacks there had been proposed algorithms and protocols of deniable encryption. The lasts are divided on the following types: 1) schemes with public key, 2) schemes with shares secret key, and 3) no-key schemes. There are introduced pseudo-probabilistic symmetric ciphers that represent a particular variant of implementing deniable encryption algorithms. It is discussed application of the pseudo-probabilistic encryption for constructing special mechanisms of the information protection including steganographic channels hidden in ciphertexts. There are considered methods for designing stream and block pseudo-probabilistic encryption algorithms that implement simultaneous ciphering fake and secret messages so that the generated ciphertext is computationally indistinguishable from the ciphertext obtained as output of the probabilistic encryption of the fake message. The requirement of the ciphertext indistinguishability from the probabilistic encryption has been used as one of the design criteria. To implement this criterion in the construction scheme of the pseudo-probabilistic ciphers it is included step of bijective mapping pairs of intermediate ciphertext blocks of the fake and secret messages into a single expanded block of the output ciphertext. Implementations of the pseudo-probabilistic block ciphers in which algorithms for recovering the fake and secret messages coincide completely are also considered. There are proposed general approaches to constructing no-key encryption protocols and randomized pseudo-probabilistic block ciphers. Concrete implementations of the cryptoschemes of such types are presented.

scholarly journals Enhanced encryption technique for secure iot data transmission

2019 ◽  
Vol 9 (5) ◽  
pp. 3732
Author(s):  
Rupesh Bhandari ◽  
Kirubanand V B
Keyword(s):  
Data Transmission ◽  
Security And Privacy ◽  
Public Key ◽  
Secret Key ◽  
Protection Mechanism ◽  
Current Period ◽  
Public Keys ◽  
Encryption Algorithms ◽  
Asymmetric Encryption ◽  
Multi Phase

<div class="page" title="Page 1"><div class="section"><div class="layoutArea"><div class="column"><p><span>Internet of things is the latest booming innovation in the current period, which lets the physical entity to process and intervene with the virtual entities. As all the entities are connected with each other, it generates load of data, which lacks proper security and privacy standards. Cryptography is one of the domains of Network Security, which is one such mechanism that helps the data transmission process to be secure enough over the wireless or wired channel and along with that, it provides authenticity, confidentiality, integrity of data and prevents repudiation. In this paper, we have proposed an alternate enhanced cryptographic solution combing the characteristic of symmetric, asymmetric encryption algorithms and Public Key Server. Here, the key pairs of end points (User’s Device and IoT device) are generated using Elliptic Curve Cryptography and the respective public keys are registered in Public Key Server along with their unique MAC address. Thereafter, both the ends will agree on one common private secret key, which will be the base for further cryptographic process using AES algorithm. This model can be called as multi-phase protection mechanism. It will make the process of data transmission secure enough that no intermediate can tamper the data.</span></p></div></div></div></div>

A CUBIC EL-GAMAL ENCRYPTION SCHEME BASED ON LUCAS SEQUENCE AND ELLIPTIC CURVE

2021 ◽  
Vol 10 (11) ◽  
pp. 3439-3447
Author(s):  
T. J. Wong ◽  
L. F. Koo ◽  
F. H. Naning ◽  
A. F. N. Rasedee ◽  
M. M. Magiman ◽  
...  
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Mathematical Problem ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Encryption Scheme ◽  
Secret Key ◽  
Chosen Plaintext Attack ◽  
The Public ◽  
Lucas Sequence

The public key cryptosystem is fundamental in safeguard communication in cyberspace. This paper described a new cryptosystem analogous to El-Gamal encryption scheme, which utilizing the Lucas sequence and Elliptic Curve. Similar to Elliptic Curve Cryptography (ECC) and Rivest-Shamir-Adleman (RSA), the proposed cryptosystem requires a precise hard mathematical problem as the essential part of security strength. The chosen plaintext attack (CPA) was employed to investigate the security of this cryptosystem. The result shows that the system is vulnerable against the CPA when the sender decrypts a plaintext with modified public key, where the cryptanalyst able to break the security of the proposed cryptosystem by recovering the plaintext even without knowing the secret key from either the sender or receiver.

scholarly journals Design and development of a secure certificateless proxy signature based (SE-CLPS) encryption scheme for cloud storage

2021 ◽  
Vol 10 (1) ◽  
pp. 57
Author(s):  
Ms. K. Sudharani ◽  
Dr. N. K. Sakthivel
Keyword(s):  
Computational Cost ◽  
Public Key Cryptography ◽  
True Positive Rate ◽  
Proxy Signature ◽  
Attack Detection ◽  
Third Party ◽  
Public Key ◽  
Secret Key ◽  
True Negative ◽  
The Public

Certificateless Public Key Cryptography (CL-PKC) scheme is a new standard that combines Identity (ID)-based cryptography and tradi- tional PKC. It yields better security than the ID-based cryptography scheme without requiring digital certificates. In the CL-PKC scheme, as the Key Generation Center (KGC) generates a public key using a partial secret key, the need for authenticating the public key by a trusted third party is avoided. Due to the lack of authentication, the public key associated with the private key of a user may be replaced by anyone. Therefore, the ciphertext cannot be decrypted accurately. To mitigate this issue, an Enhanced Certificateless Proxy Signature (E-CLPS) is proposed to offer high security guarantee and requires minimum computational cost. In this work, the Hackman tool is used for detecting the dictionary attacks in the cloud. From the experimental analysis, it is observed that the proposed E-CLPS scheme yields better Attack Detection Rate, True Positive Rate, True Negative Rate and Minimum False Positives and False Negatives than the existing schemes.   

scholarly journals MATHEMATICAL METHODS IN CYBER SECURITY: FRACTALS AND THEIR APPLICATIONS IN INFORMATION AND CYBER SECURITY

2019 ◽  
pp. 31-39
Author(s):  
Svitlana Shevchenko ◽  
Yulia Zhdanovа ◽  
Svitlana Spasiteleva ◽  
Olena Negodenko ◽  
Nataliia Mazur ◽  
...  
Keyword(s):  
Fractal Analysis ◽  
Cyber Security ◽  
Fractal Theory ◽  
Research Work ◽  
Digital Processing ◽  
Information Protection ◽  
Mathematical Apparatus ◽  
Mathematical Methods ◽  
Fractal Modeling ◽  
Encryption Algorithms

The article deals with the application of modern mathematical apparatus in information and cyber security namely fractal analysis. The choice of fractal modeling for the protection of information in the process of its digital processing is grounded. Based on scientific sources, the basic definitions of the research are analyzed: fractal, its dimension and basic properties used in the process of information protection. The basic types of fractals (geometric, algebraic, statistical) are presented and the most famous of them are described. The historical perspective of the development of fractal theory is conducted. Different approaches to the application of fractal theory in information and cyber security have been reviewed. Among them are: the use of fractal analysis in encryption algorithms; development of a method of protecting documents with latent elements based on fractals; modeling the security system of each automated workplace network using a set of properties that can be represented as fractals. The considered approaches to the application of fractal analysis in information and cyber security can be used in the preparation of specialists in the process of research work or diploma work.

Design Of Hybrid Cryptography With Vigenere Cipher And RSA Algorithm On IOT Data Security

2020 ◽  
Vol 8 (4) ◽  
pp. 475
Author(s):  
Maria Okta Safira ◽  
I Komang Ari Mogi
Keyword(s):  
System Architecture ◽  
Data Security ◽  
Data Encryption ◽  
Public Key ◽  
Secret Message ◽  
Secret Key ◽  
Rsa Algorithm ◽  
Tcp Protocol ◽  
Public Keys ◽  
Encryption And Decryption

In this paper two methods are used, namely the vigenere cipher method and the RSA method. The vigenere cipher method is an example of a symmetric algorithm, while RSA is an example of an asymmetric algorithm. The combination of these two methods is called hybrid cryptography which has the advantage in terms of speed during the encryption process. Each process, which is encryption and decryption, is carried out twice, so that security can be ensured. In the process of forming the key used the RSA method. In the encryption process using public keys that have been generated before when the key is formed. This public key is used in sending data to the recipient of a secret message where this key is used for the data encryption process. The Secret key is kept and will be used during the decryption process. There is a system architecture that describes how clients and servers communicate with each other over the internet using the TCP protocol where the client here is an IoT device and the server is a server. 

New Developments in Quasigroup-Based Cryptography

2014 ◽  
pp. 286-317 ◽  
Author(s):  
Aleksandra Mileva
Keyword(s):  
Building Blocks ◽  
Block Ciphers ◽  
Public Key ◽  
Message Authentication ◽  
Authentication Codes ◽  
New Developments ◽  
Identification Schemes ◽  
Public Key Cryptosystems ◽  
Research Activities ◽  
The Given

This chapter offers an overview of new developments in quasigroup-based cryptography, especially of new defined quasigroup-based block ciphers and stream ciphers, hash functions and message authentication codes, PRNGs, public key cryptosystems, etc. Special attention is given to Multivariate Quadratic Quasigroups (MQQs) and MQQ public key schemes, because of their potential to become one of the most efficient pubic key algorithms today. There are also directions of using MQQs for building Zero knowledge ID-based identification schemes. Recent research activities show that some existing non-quasigroup block ciphers or their building blocks can be represented by quasigroup string transformations. There is a method for generating optimal 4x4 S-boxes by quasigroups of order 4, by which a more optimized hardware implementation of the given S-box can be obtained. Even some block ciphers' modes of operations can be represented by quasigroup string transformations, which leads to finding weaknesses in the interchanged use of these modes.

On Securing Cloud Storage Using a Homomorphic Framework

2018 ◽  
pp. 99-114
Author(s):  
Daya Sagar Gupta ◽  
G. P. Biswas
Keyword(s):  
Elliptic Curve ◽  
Cloud Storage ◽  
Homomorphic Encryption ◽  
Cloud Security ◽  
Public Key ◽  
Cloud System ◽  
Secret Message ◽  
Security Mechanism ◽  
Secret Key ◽  
Hard Problems

In this chapter, a cloud security mechanism is described in which the computation (addition) of messages securely stored on the cloud is possible. Any user encrypts the secret message using the receiver's public key and stores it. Later on, whenever the stored message is required by an authentic user, he retrieves the encrypted message and decrypts it by using his secret key. However, he can also request the cloud for an addition of encrypted messages. The cloud system only computes the requested addition and sends it to the authentic user; it cannot decrypt the stored encrypted messages on its own. This addition of encrypted messages should be the same as the encryption of the addition of original messages. In this chapter, the authors propose a homomorphic encryption technique in which the above-discussed scenario is possible. The cloud securely computes the addition of the encrypted messages which is ultimately the encryption of the addition of the original messages. The security of the proposed encryption technique depends on the hardness of elliptic curve hard problems.

scholarly journals An Algorithm of Image Encryption Using Logistic and Two-Dimensional Chaotic Economic Maps

Entropy ◽  
2019 ◽  
Vol 21 (1) ◽  
pp. 44 ◽  
Author(s):  
Sameh Askar ◽  
Abdel Karawia ◽  
Abdulrahman Al-Khedhairi ◽  
Fatemah Al-Ammar
Keyword(s):  
Image Encryption ◽  
Security Level ◽  
Two Dimensional ◽  
Secret Key ◽  
Large Space ◽  
Cryptographic Algorithm ◽  
Key Space ◽  
Contrast Analysis ◽  
Encryption Algorithms ◽  
Made In

In the literature, there are many image encryption algorithms that have been constructed based on different chaotic maps. However, those algorithms do well in the cryptographic process, but still, some developments need to be made in order to enhance the security level supported by them. This paper introduces a new cryptographic algorithm that depends on a logistic and two-dimensional chaotic economic map. The robustness of the introduced algorithm is shown by implementing it on several types of images. The implementation of the algorithm and its security are partially analyzed using some statistical analyses such as sensitivity to the key space, pixels correlation, the entropy process, and contrast analysis. The results given in this paper and the comparisons performed have led us to decide that the introduced algorithm is characterized by a large space of key security, sensitivity to the secret key, few coefficients of correlation, a high contrast, and accepted information of entropy. In addition, the results obtained in experiments show that our proposed algorithm resists statistical, differential, brute-force, and noise attacks.

scholarly journals LWR-Based Fully Homomorphic Encryption, Revisited

2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Fucai Luo ◽  
Fuqun Wang ◽  
Kunpeng Wang ◽  
Jie Li ◽  
Kefei Chen
Keyword(s):  
Tensor Product ◽  
Gaussian Noise ◽  
Homomorphic Encryption ◽  
Matrix Multiplication ◽  
Public Key ◽  
Multiparty Computation ◽  
Secret Key ◽  
Fully Homomorphic Encryption ◽  
Private Key ◽  
Modulus Problem

Very recently, Costache and Smart proposed a fully homomorphic encryption (FHE) scheme based on the Learning with Rounding (LWR) problem, which removes the noise (typically, Gaussian noise) sampling needed in the previous lattices-based FHEs. But their scheme did not work, since the noise of homomorphic multiplication is complicated and large, which leads to failure of decryption. More specifically, they chose LWR instances as a public key and the private key therein as a secret key and then used the tensor product to implement homomorphic multiplication, which resulted in a tangly modulus problem. Recall that there are two moduli in the LWR instances, and then the moduli will tangle together due to the tensor product. Inspired by their work, we built the first workable LWR-based FHE scheme eliminating the tangly modulus problem by cleverly adopting the celebrated approximate eigenvector method proposed by Gentry et al. at Crypto 2013. Roughly speaking, we use a specific matrix multiplication to perform the homomorphic multiplication, hence no tangly modulus problem. Furthermore, we also extend the LWR-based FHE scheme to the multikey setting using the tricks used to construct LWE-based multikey FHE by Mukherjee and Wichs at Eurocrypt 2016. Our LWR-based multikey FHE construction provides an alternative to the existing multikey FHEs and can also be applied to multiparty computation with higher efficiency.

Sign in / Sign up

Export Citation Format

Share Document