How to make RSA and some other encryptions probabilistic

TL;DR

This paper introduces a probabilistic encryption scheme related to RSA and other algorithms, discussing its security assumptions, advantages, and potential semantic security under certain cryptographic conditions.

Contribution

It presents a novel probabilistic subgroup-related encryption scheme applicable to RSA, Diffie-Hellman, and ElGamal, with security analysis and potential semantic security.

Findings

Scheme is potentially semantically secure under reasonable assumptions

Applicable to RSA, Diffie-Hellman, and ElGamal encryption

Discusses security assumptions and main advantages

Abstract

A new scheme of probabilistic subgroup-related encryption is introduced. Some applications of this scheme based on the RSA, Diffie-Hellman and ElGamal encryption algorithms are described. Security assumptions and main advantages of this scheme are discussed. We outline that this scheme is potentially semantically secure under reasonable cryptographic assumptions.