STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Relations Among Notions of Security for Public-Key Encryption Schemes
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Cryptoanalysis in Prime Order Subgroups of Z*n
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
How to Enhance the Security of Public-Key Encryption at Minimum Cost
PKC '99 Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography
Chosen-Ciphertext Security for Any One-Way Cryptosystem
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
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 public key cryptosystems with a double decryption mechanism
Information Processing Letters
Additively homomorphic encryption with a double decryption mechanism, revisited
ISC'12 Proceedings of the 15th international conference on Information Security
Hi-index | 0.00 |
A clue of double decryption mechanism was introduced at Eurocrypt '02 by Cramer and Shoup, and it was revisited at Asiacrypt '03 by Bresson, Catalano and Pointcheval. Previous double decryption schemes are designed based on $\mathbb{Z}_{n^{2}}$ where n = pq for two primes, p and q. Note that, they use the Paillier's scheme as a primitive scheme to design a double decryption mechanism. In this paper, we propose an efficient public key scheme with double decryption mechanism based on $\mathbb{Z}_{p^{2}q}$. Our scheme is more efficient than the previous schemes. Moreover, we review the previous schemes in a privacy point of view and propose a privacy enhanced double decryption scheme.