Security and Communication Networks · 2012 · 163 citations · 11 references
ComputingComputer ScienceCybersecurityComputer SecurityCryptographySecurity ArchitectureAuthenticated EncryptionHealth Data EncryptionSecure Data SharingFormal VerificationProvable SecurityPublic-key Encryption
ABSTRACT In this paper, we investigate a category of public key encryption schemes that supports plaintext equality test and user‐specified authorization. With this new primitive, two users, who possess their own public/private key pairs, can issue token(s) to a proxy to authorize it to perform plaintext equality test from their ciphertexts. We provide a formal formulation for this primitive and present a construction with provable security in our security model. To mitigate the risks against the semi‐trusted proxies, we enhance the proposed cryptosystem by integrating the concept of computational client puzzles. As a showcase, we construct a secure personal health record application on the basis of this primitive. Copyright © 2012 John Wiley & Sons, Ltd.
11
Fully homomorphic encryption using ideal lattices
Craig Gentry · 2009 · 6.6K citations
Mihir Bellare, Phillip Rogaway · 1993 · 4.7K citations · Full text
ON DATA BANKS AND PRIVACY HOMOMORPHISMS
Ronald L. Rivest, Michael L. Dertouzos · 1978 · 1.7K citations
Order preserving encryption for numeric data
Rakesh Agrawal, Jerry Kiernan, Ramakrishnan Srikant et al. · 2004 · 1.2K citations