AIP conference proceedings

An implementation of three-pass protocol on a Paillier cryptosystem

Ragdah Ahmed Qasim, Hamza B. Habib, Rifaat Z. Khalaf

Published Jan 1, 2024• 0 citations

Abstract

This article proposes a new encryption algorithm based on two cryptographic techniques which are the three-pass protocol and the Paillier cryptosystem. Using the three-pass protocol makes it possible for one party to safely send a message to another party without exchanging or distributing encryption secrets. In each pass in the proposed algorithm, each party uses their private pair of prime numbers to calculate the modular number. That means they use their public and private keys to perform the encryption and decryption. Moreover, the encryption and the decryption on the sender side are performed by the Paillier cryptosystem which is based on the difficulty of finding the inverse modular of the public key. In the proposed algorithm, less information is shared between the two parties and that makes it more secure against attacks. The results show that the proposed algorithm needs less time to perform the encryption and decryption compared with the classic algorithm. Therefore, the proposed algorithm is more secure, fast and reliable for sending and receiving data compared with the classic algorithm.

DOI: 10.1063/5.0234214

Related papers

A Review on Cryptography Protocol for Securing Data

Robbi Rahim

Abstract Cryptography is one type of protection that is widely used to secure information, encryption and decryption and the use of keys is a common process used to secure information; and also the cryptographic processes have a classic problem that is the distribution of keys that are vulnerable to interception when the key is sent by the sender to the receiver, the cryptographic protocol (Authentication) could be used to minimize key distribution problem because there is no need for key exchanges. Shamir’s Three-Pass Protocol, Secret Splitting, Bit-Commitment Protocol and Blind Signature are few cryptographic protocols that can be used to help with key distribution issues, this article performs systematic approach to protocol cryptography for security level and the using other algorithms to combine with protocol.

Journal of Physics Conference SeriesNov 1, 20193 citations

No-Key Protocol for Deniable Encryption

Nam Hai Nguyen, Nikolay Andreevich Moldovyan, A.V. Shcherbacov +2 more

There is proposed a new method for deniable encryption based on commutative transformations. The method has been used to design the deniable encryption protocol resistant to the passive coercive attacks, which uses no pre-shared secret keys and no pre-exchanged public keys. The protocol begins with the stage at which the sender and receiver exchange their single-use public keys and compute the single-use shared secret key. Then, it is performed pseudo-probabilistic three-pass protocol with simultaneous commutative encryption of the fake and secret messages. Resistance of the proposed protocol to coercive attacks is provided by its computational indistinguishability from probabilistic no-key three-pass protocol used to send securely the fake message. To perform commutative encryption, it used exponentiation cipher. To provide security against active coercer, the protocol is to be complemented with procedure for authenticating the sent messages.

Advances in intelligent systems and computingJan 1, 20187 citations

An Efficient Key Distribution Protocol Based on BB84

Parag K. Lala

Private key cryptography suffers from a major weakness - it requires sharing of a secret key between two parties. An intruder can copy the secret key as it is being exchanged, thereby severely compromising the security of the system. Thus a private key cryptographic system depends entirely on secrecy of the key. Public key cryptography does not have a key distribution problem but its security relies on the fact that determining the factors of a number that is the product of two very large prime numbers is not computationally feasible. It has been shown that a quantum computer can solve the prime factors of very large numbers in polynomial time which would otherwise take millions of years. Public key cryptography will therefore become insecure if quantum computing becomes a reality. Quantum cryptography, originally presented in BB84 protocol, avoids all these issues by encrypting the shared key using a series of photons. In this paper a key distribution protocol based on the concepts of BB84 is proposed It provides an additional layer of security by sending the key data bits twice; during the second transmission the original key bits or their complements are randomly chosen for transmission. The sender informs the receiver about the orientation of the key bits during the second round of transmission only after the data has been sent out.

American Journal of Computing Research RepositoryJan 23, 20140 citations

Simulation of Securable Network Three-party Protocol Using Quantum Key Distribution in PHP

UNP. Gangadhar Raju

Encryption and decryption are the part of cryptography, which include both classical cryptography and quantum cryptography. In the existing study of third party protocol, for information transformation has very less security against attacks such as eavesdropping, man-in-the-middle and so on. In this paper, we proposed a new protocol with quantum key distribution(QKDP) which is one hundred present un-hackable and accurate. In this protocol it uses traditional QKDP to send and receive keys between parties, it uses our algorithm to get accurate results and two parties can share and use secret key for long-1term repeatedly.

International Journal for Research in Applied Science and Engineering TechnologyApr 30, 20180 citations

Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting.

Carmit Hazay, Gert Læssøe Mikkelsen, Tal Rabin +1 more

The problem of generating an RSA composite in a distributed manner without leaking its factorization is particularly challenging and useful in many cryptographic protocols. Our first contribution is the first non-generic fully simulatable protocol for distributively generating an RSA composite with security against malicious behavior. Our second contribution is complete Paillier [Pai99] threshold encryption scheme in the two-party setting with security against malicious behavior. Furthermore, we describe how to extend our protocols to the multiparty setting with dishonest majority. Our RSA key generation is comprised of the following: (i) a distributed protocol for generation of an RSA composite, and (ii) a biprimality test for verifying the validity of the generated composite. Our Paillier threshold encryption scheme uses the RSA composite as public key and is comprised of: (i) a distributed generation of the corresponding secret-key shares and, (ii) a distributed decryption protocol for decrypting according to Paillier.

Jan 1, 20110 citations

Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting

Carmit Hazay, Gert Læssøe Mikkelsen, Tal Rabin +2 more

The problem of generating an RSA composite in a distributed manner without leaking its factorization is particularly challenging and useful in many cryptographic protocols. Our first contribution is the first non-generic fully simulatable protocol for distributively generating an RSA composite with security against malicious behavior. Our second contribution is a complete Paillier (in: EUROCRYPT, pp 223–238, 1999 ) threshold encryption scheme in the two-party setting with security against malicious attacks. We further describe how to extend our protocols to the multiparty setting with dishonest majority. Our RSA key generation protocol is comprised of the following subprotocols: ( i ) a distributed protocol for generation of an RSA composite and ( ii ) a biprimality test for verifying the validity of the generated composite. Our Paillier threshold encryption scheme uses the RSA composite for the public key and is comprised of the following subprotocols: ( i ) a distributed generation of the corresponding secret key shares and ( ii ) a distributed decryption protocol for decrypting according to Paillier.

Journal of CryptologyFeb 5, 201876 citations