Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 617 papers for “Probabilistic encryption”

Probabilistic encryption

Shafi Goldwasser, Silvio Micali · Journal of Computer and System Sciences · 1984

Cited by 2,536

Dense Probabilistic Encryption

Josh Benaloh Clarkson · 1994

This paper describes a method of dense probabilistic encryption. Previous probabilistic encryption methods require large numbers of random bits and produce large amounts of ciphertext for the encryption of each bit of plaintext. This paper develops a method of probabilistic encryption in which the ratio of ciphertext text size to plaintext size and the proportion of random bits to plaintext can both be made arbitrarily close to one. The methods described here have applications which are not in any apparent way possible with previous methods. These applications include simple and efficient protocols for noninteractive verifiable secret sharing and a method for conducting practical and verifiable secret-ballot elections. 1 Introduction In 1984, Goldwasser and Micali ([GoMi84]) introduced the notion of probabilistic encryption. A probabilistic encryption method allows one to encrypt a fixed value in many different ways. Thus, even when given the encryption of a value and detail...

Cited by 0

Probabilistic encryption key exchange

Thierry Moreau · Electronics Letters · 1995

A novel secret key exchange algorithm is proposed. It is based on the properties of the Blum Blum and Shum pseudo-random number generator (the ‘x2 mod N"’ generator), and on partial disclosure of the secret seed for this generator. The security and other features of the proposed cryptosystem are discussed.

Cited by 1

Probabilistic Encryption--A Practical Implementation

Orhio Mark Creado, Yiling Wang, Xianping Wu et al. · 2009

This paper aims to provide a practical implementation of a probabilistic cipher by extending on the algorithms by Fuchsbauer, Goldwasser and Micali. We provide details on designing and implementing the cipher and further support our understanding by providing a statistical analysis of our implementation for the key generation, encryption, and decryption times taken by the cipher for key sizes of 1024, 2048, and 4096 bits for varying message spaces of 750, 1500, 3000, and 5000 bits. The concept of 'inter-bit operating time' is introduced for the cipher which calculates time elapsed between two instances of an operation. We show the working of a probabilistic cipher purely from a practical standpoint to justify if its original algorithm is practically implementable.

Cited by 3

A Probabilistic Chaotic Image Encryption Scheme

Ali Kanso, M. Ghebleh, Mazen Bou Khuzam · Mathematics · 2022

This paper proposes a probabilistic image encryption scheme that improves on existing deterministic schemes by using a chaining mode of chaotic maps in a permutation-masking process. Despite its simplicity, the permutation phase destroys any correlation between adjacent pixel values in a meaningful image. The masking phase, however, modifies the pixel values of the image at hand using pseudorandom numbers with some other initiated random numbers so that any slight change in the plain image spreads throughout the corresponding cipher image. These random numbers ensure the generation of distinct cipher images for the same plain image encryption, even if it is encrypted multiple times with the same key, thereby adding some security features. Simulations show that the proposed scheme is robust to common statistical and security threats. Furthermore, the scheme is shown to be competitive with existing image encryption schemes.

Cited by 12Open access

Method for Pseudo-probabilistic Block Encryption

Moldovyan Nikolay Andreevich, Moldovyan Alexander Andreevich, Tam Nguyen Duc et al. · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · 2018

Cited by 1

EPOC: Efficient Probabilistic Public-Key Encryption

Tatsuaki Okamoto, Shigenori Uchiyama, Eiichiro Fujisaki · 1998

We describe a novel public-key cryptosystem, EPOC (Efficient Probabilistic Public-Key Encryption), which has two versions: EPOC-1 and EPOC-2. EPOC-1 is a public-key encryption system that uses a one-way trapdoor function and a random function (hash function). EPOC-2 is a public-key encryption system that uses a one-way trapdoor function, two random functions (hash functions) and a symmetric-key encryption (e.g., one-time padding and block-ciphers). EPOC has several outstanding properties as follows: 1. EPOC-1 is semantically secure or non-malleable against chosen ciphertext attacks (IND-CCA2 or NM-CCA2) in the random oracle model under the p-subgroup assumption, which is comparable to the quadratic residue and higher degree residue assumptions. 2. EPOC-2 with one-time padding is semantically secure or non-malleable against chosen ciphertext attacks (IND-CCA2 or NM-CCA2) in the random oracle model under the factoring assumption. 3. EPOC-2 with symmetric encryption is semantically secure...

Cited by 0

Stream deniable-encryption computationally indistinguishable from probabilistic ciphering

A. N. Berezin, A. A. Moldovyan, Nikolay A. Moldovyan · 2015

For the first time it is proposed a stream deniable-encryption algorithm. The algorithm generates cryptogram that is computationally indistinguishable from the cryptogram produced by some probabilistic encryption algorithm, called associated probabilistic algorithm, while ciphering a fake message with a fake key. When the sender and receiver of the message are coerced to open the encryption key, they open the fake key with which the cryptogram is transformed into the fake message. To recover the secret message from the cryptogram the receiver uses the secret key. The algorithm is constructed on the base of some secure hash function with which two key streams are generated. The key streams are mixed with secret data stream and with fake data stream so that cryptograms looks like the ciphertext produced by the probabilistic encryption of the fake message with the fake key.

Cited by 3

Improvement on a Knapsack-Based Probabilistic Encryption Scheme

Baocang Wang, Fagen Li, Yupu Hu · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2013

In this letter, we propose an improvement on a knapsack probabilistic encryption scheme [B. Wang, Q. Wu, Y. Hu, Information Sciences 177 (2007)], which was shown vulnerable to attacks due to Youssef [A.M. Youssef, Information Sciences 179 (2009)] and Lee [M.S. Lee, Information Sciences 222 (2013)], respectively. The modified encryption scheme is secure against Youssef's and Lee's attacks only at the costs of slightly compromising the efficiency of the original proposal.

Cited by 1

Quantum probabilistic encryption scheme based on conjugate coding

Li Yang, Chong Xiang, Bao Li · China Communications · 2013

We present a quantum probabilistic encryption algorithm for a private-key encryption scheme based on conjugate coding of the qubit string. A probabilistic encryption algorithm is generally adopted in public-key encryption protocols. Here we consider the way it increases the unicity distance of both classical and quantum private-key encryption schemes. The security of quantum probabilistic private-key encryption schemes against two kinds of attacks is analyzed. By using the no-signalling postulate, we show that the scheme can resist attack to the key. The scheme's security against plaintext attack is also investigated by considering the information-theoretic indistinguishability of the encryption scheme. Finally, we make a conjecture regarding Breidbart's attack.

Cited by 33

Self Evaluation of EPOC: Efficient Probabilistic Public-Key Encryption

Epoc · 2007

This document evaluates the security and performance of a public-key cryptosystem, EPOC (Efficient Probabilistic Public-Key Encryption), which has three versions: EPOC-1, EPOC-2 and EPOC-3. 1 Security 1.1 Summary 1. EPOC-1 is semantically secure or non-malleable against chosen ciphertext attacks (INDCCA2 or NM-CCA2) in the random oracle model under the p-subgroup assumption, which is comparable to the quadratic residue and higher degree residue assumptions. 2. EPOC-2 with one-time padding (EPOC-2-OTP) is semantically secure or non-malleable against chosen ciphertext attacks (IND-CCA2 or NM-CCA2) in the random oracle model under the factoring assumption (or one-way assumption of the OU encryption function). 3. EPOC-2 with symmetric encryption (EPOC-2-SymE) is semantically secure or non-malleable against chosen ciphertext attacks (IND-CCA2 or NM-CCA2) in the random oracle model under the factoring assumption (or one-way assumption of the OU encryption function), if the underlying symme...

Cited by 0