Skip to Main content Skip to Navigation
Conference papers

Plaintext-Checkable Encryption

Sébastien Canard 1 Georg Fuchsbauer 2 Aline Gouget 3 Fabien Laguillaumie 4, 5, *
* Corresponding author
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.
Document type :
Conference papers
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/hal-00768305
Contributor : Fabien Laguillaumie <>
Submitted on : Friday, December 21, 2012 - 11:07:14 AM
Last modification on : Saturday, September 11, 2021 - 3:17:47 AM
Long-term archiving on: : Friday, March 22, 2013 - 3:46:51 AM

File

PCE_RSA.pdf
Files produced by the author(s)

Identifiers

Citation

Sébastien Canard, Georg Fuchsbauer, Aline Gouget, Fabien Laguillaumie. Plaintext-Checkable Encryption. CT-RSA 2012, 2012, San Francisco, United States. pp.332-348, ⟨10.1007/978-3-642-27954-6_21⟩. ⟨hal-00768305⟩

Share

Metrics

Record views

694

Files downloads

614