Plaintext-Checkable Encryption

Sébastien Canard 1 Georg Fuchsbauer 2 Aline Gouget 3 Fabien Laguillaumie 4, 5, *
* Auteur correspondant
4 ARIC - Arithmetic and Computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
5 Equipe AMACC - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen
Abstract : We study the problem of searching on encrypted data, where the search is performed using a plaintext message or a keyword, rather than a message-specific trapdoor as done by state-of-the-art schemes. The use cases include delegation of key-word search e.g. to a cloud data storage provider or to an email server, using a plaintext message. We define a new cryptographic primitive called plaintext-checkable encryption (PCE), which extends public-key encryption by the following functionality: given a plaintext, a ciphertext and a public key, it is universally possible to check whether the ciphertext encrypts the plaintext under the key. We provide efficient generic random-oracle constructions for PCE based on any probabilistic or deterministic encryption scheme; we also give a practical construction in the standard model. As another application we show how PCE can be used to improve the efficiency in group signatures with verifier-local revocation (VLR) and backward unlinkability. These group signatures provide efficient revocation of group members, which is a key issue in practical applications.
Type de document :
Communication dans un congrès
Orr Dunkelman. CT-RSA 2012, 2012, San Francisco, United States. 7178, pp.332-348, 2012, Topics in Cryptology - CT-RSA 2012 - The Cryptographers' Track at the RSA Conference 2012, San Francisco, CA, USA, February 27 - March 2, 2012. Proceedings. 〈10.1007/978-3-642-27954-6_21〉
Liste complète des métadonnées

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

https://hal.inria.fr/hal-00768305
Contributeur : Fabien Laguillaumie <>
Soumis le : vendredi 21 décembre 2012 - 11:07:14
Dernière modification le : mardi 5 juin 2018 - 10:14:41
Document(s) archivé(s) le : vendredi 22 mars 2013 - 03:46:51

Fichier

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

Identifiants

Citation

Sébastien Canard, Georg Fuchsbauer, Aline Gouget, Fabien Laguillaumie. Plaintext-Checkable Encryption. Orr Dunkelman. CT-RSA 2012, 2012, San Francisco, United States. 7178, pp.332-348, 2012, Topics in Cryptology - CT-RSA 2012 - The Cryptographers' Track at the RSA Conference 2012, San Francisco, CA, USA, February 27 - March 2, 2012. Proceedings. 〈10.1007/978-3-642-27954-6_21〉. 〈hal-00768305〉

Partager

Métriques

Consultations de la notice

355

Téléchargements de fichiers

233