Proxy Re-encryption With Keyword Search: New Definitions and Algorithms With Proofs

The authors propose a new definition for searchable proxy Re-encryption scheme (Re-PEKS), define the first known searchable proxy Re-encryption scheme with a designated tester (RedPEKS), and then give concrete constructions of both Re-PEKS and Re-dPEKS schemes that are secure in the random oracle model, along with the proofs. Public key Encryption with Keyword Search (PEKS) schemes enable searching of keywords within encrypted messages. These schemes are desirable for mobile devices such as smartphones for selectively downloading encrypted messages from gateways, e.g., accessing to emails while on mobile internet.

Provided by: Loughborough University Topic: Mobility Date Added: Apr 2011 Format: PDF

Find By Topic