Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks

Abstract : Semantic security against chosen-ciphertext attacks (IND-CCA) is widely believed as the correct security level for public-key encryption scheme. On the other hand, it is often dangerous to give to only one people the power of decryption. Therefore, threshold cryptosystems aimed at distributing the decryption ability. However, only two efficient such schemes have been proposed so far for achieving IND-CCA. Both are El Gamal-like schemes and thus are based on the same intractability assumption, namely the Decisional Diffie-Hellman problem. In this article we rehabilitate the twin-encryption paradigm proposed by Naor and Yung to present generic conversions from a large family of (threshold) IND-CPA scheme into a (threshold) IND-CCA one in the random oracle model. An efficient instantiation is also proposed, which is based on the Paillier cryptosystem. This new construction provides the first example of threshold cryptosystem secure against chosen-ciphertext attacks based on the factorization problem. Moreover, this construction provides a scheme where the ?homomorphic properties? of the original scheme still hold. This is rather cumbersome because homomorphic cryptosystems are known to be malleable and therefore not to be CCA secure. However, we do not build a ?homomorphic cryptosystem?, but just keep the homomorphic properties.
Type de document :
Communication dans un congrès
Colin Boyd. Advances in Cryptology - ASIACRYPT 2001, 7th International Conference on the Theory and Application of Cryptology and Information Security, 2001, Gold Coast, Australia. Springer, 2248, pp.351-368, 2001, Lecture Notes in Computer Science. 〈10.1007/3-540-45682-1_21〉
Liste complète des métadonnées

Littérature citée [47 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00565272
Contributeur : Pierre-Alain Fouque <>
Soumis le : vendredi 11 février 2011 - 15:13:34
Dernière modification le : jeudi 11 janvier 2018 - 06:19:17
Document(s) archivé(s) le : jeudi 12 mai 2011 - 02:46:15

Fichier

asia01b.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

PSL

Citation

Pierre-Alain Fouque, David Pointcheval. Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks. Colin Boyd. Advances in Cryptology - ASIACRYPT 2001, 7th International Conference on the Theory and Application of Cryptology and Information Security, 2001, Gold Coast, Australia. Springer, 2248, pp.351-368, 2001, Lecture Notes in Computer Science. 〈10.1007/3-540-45682-1_21〉. 〈inria-00565272〉

Partager

Métriques

Consultations de la notice

127

Téléchargements de fichiers

274