Improvement of Probabilistic Public Key Cryptosystems Using Discrete Logarithm

Authors:
Dug-Hwan Choi;Seungbok Choi;Dongho Won
Affiliations:
-;-;-
Venue:
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
Year:
2001

Citing 4
Cited 1

Non-malleable cryptography

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries

ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION

DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques

On the Security of a Modified Paillier Public-Key Primitive

ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy

Quantified Score

Hi-index	0.01

Visualization

Abstract

We investigate two different probabilistic public key cryptosystems, one proposed by Okamoto and Uchiyama and the other by Paillier. Both of them are based on the discrete logarithmic function and the messages are calculated from the modular product of two those functions, one of which has a fixed value depending on a given public key. The improvements are achieved by a good choice for the public key so that it is possible to get efficient algorithms.