Public key encryption supporting plaintext equality test and user-specified authorization

Security and Communication Networks

Volumn 5, Issue 12, 2012, Pages 1351-1362

  Tang, Qiang ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Authorization; Equality test; Public key encryption

Indexed keywords

COMPUTER NETWORKS; INFORMATION SYSTEMS;

AUTHORIZATION; CLIENT PUZZLES; EQUALITY TESTS; PERSONAL HEALTH RECORD; PROVABLE SECURITY; PUBLIC-KEY ENCRYPTION; PUBLIC-KEY ENCRYPTION SCHEME; SECURITY MODEL;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84870234538     PISSN: 19390114     EISSN: 19390122     Source Type: Journal    
DOI: 10.1002/sec.418     Document Type: Article

References (25)

1. Sittig DF. Personal health records on the Internet: a snapshot of the pioneers at the end of the 20th century. International Journal of Medical Informatics 2002; 65(1): 1-6.
2. Google Inc. Google Health. http://www.google.com/intl/nl/health/about/. Mountain View, USA.
3. Microsoft Corporation. Microsoft HealthVault. http://www.healthvault.com/personal/index.aspx
4. Cloud Security Alliance. Top threat to cloud computing V1.0. http://www.cloudsecurityalliance.org/topthreats.html. Seattle, USA.
5. Yang G, Tan C, Huang Q, Wong DS. Probabilistic public key encryption with equality test. In Topics in Cryptology-CT-RSA 2010, Vol. 5985 of LNCS, Pieprzyk J (ed). Springer: Berlin, 2010; 119-131.
6. Tang Q. Towards public key encryption scheme supporting equality test with fine-grained authorization. In Proceedings of the 16th Australasian Conference on Information Security and Privacy, Vol. 6812 of LNCS. Springer: Berlin, 2011; 389-406.
7. Rivest RL, Shamir A, Wagner DA. Time-lock puzzles and timed-release crypto. Technical Report MIT/LCS/TR-684, Massachusetts Institute of Technology, Cambridge, USA, 1996.
8. Bellare M, Desai A, Pointcheval D, Rogaway P. Relations among notions of security for public-key encryption schemes. In Advances in Cryptology-CRYPTO 1998, Vol. 1462 of LNCS, Krawczyk H (ed). Springer: Berlin, 1998; 26-45.
9. Byun JW, Rhee HS, Park H, Lee DH. Off-line keyword guessing attacks on recent keyword search schemes over encrypted data. In Secure Data Management, Third VLDB Workshop, SDM 2006, Vol. 4165 of LNCS, Jonker W, Petkovic M (eds). Springer: Berlin, 2006; 75-83.
10. Tang Q, Chen L. Public-key encryption with registered keyword search. In Proceeding of Public Key Infrastructure, 5th European PKI Workshop: Theory and Practice (EuroPKI 2009), Vol. 6391 of LNCS. Springer, 2009; 163-178.
11. Bellare M, Rogaway P. Random oracles are practical: a paradigm for designing efficient protocols. In Proceedings of the 1st ACM conference on Computer and communications security. ACM Press: New York, USA, 1993; 62-73.
12. Shoup V. Sequences of games: a tool for taming complexity in security proofs. http://shoup.net/papers/, New York, USA, 2006.
13. Juels A, Brainard JG. Client puzzles: a cryptographic countermeasure against connection depletion attacks. In Proceedings of the Network and Distributed System Security Symposium, NDSS 1999, 1999; 151-165.
14. Tang Q, Jeckmans A. On non-parallelizable deterministic client puzzle scheme with batch verification modes. Technical Report TR-CTIT-10-02, CTIT, University of Twente, 2010. http://eprints.eemcs.utwente.nl/17107/
15. Boneh D, Franklin MK. Efficient generation of shared rsa keys (extended abstract). In Advances in Cryptology-CRYPTO 1997. Springer, 1997; 425-439.
16. Boneh D, Di Crescenzo G, Ostrovsky R, Persiano G. Public key encryption with keyword search. In Advances in Cryptology-EUROCRYPT 2004, Vol. 3027 of LNCS, Cachin C, Camenisch J (eds). Springer: Berlin, 2004; 506-522.
17. Agrawal R, Kiernan J, Srikant R, Xu Y. Order preserving encryption for numeric data. In SIGMOD'04: Proceedings of the 2004 ACM SIGMOD international conference on Management of data. ACM Press: New York, USA, 2004; 563-574.
18. Boldyreva A, Chenette N, Lee Y, O'Neill A. Order-preserving symmetric encryption. In Advances in Cryptology-EUROCRYPT 2009, Vol. 5479 of LNCS, Joux A (ed). Springer: Berlin, 2009; 224-241.
19. Blaze M, Bleumer G, Strauss M. Divertible protocols and atomic proxy cryptography. In Advances in Cryptology-EUROCRYPT 1998, Vol. 1403 of LNCS, Nyberg K (ed). Springer: Berlin, 1998; 127-144.
20. Mambo M, Okamoto E. Proxy cryptosystems: delegation of the power to decrypt ciphertexts. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 1997; E80-A(1): 54-63.
21. Rivest RL, Adleman LM, Dertouzos ML. On data banks and privacy homomorphisms. In Foundations of Secure Computation. Academic Press: New York, USA, 1978; 169-180.
22. ElGamal T. A public key cryptosystem and a signature scheme based on discrete logarithms. In Advances in Cryptology-CRYPTO 1984, Vol. 196 of LNCS, Blakley GR, Chaum D (eds). Springer, 1985; 10-18.
23. Paillier P. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology-EUROCRYPT 1999, Vol. 1592 of LNCS, Stern J (ed). Springer, 1999; 223-238.
24. Gentry C. Fully homomorphic encryption using ideal lattices. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing, Mitzenmacher M (ed). ACM Press: New York, USA, 2009; 169-178.
25. Zhang R, Imai H. Generic combination of public key encryption with keyword search and public key encryption. In Cryptology and Network Security, 6th International Conference, CANS 2007, Vol. 4856 of LNCS, Bao F, Ling S, Okamoto T, Wang H, Xing C (eds). Springer: Berlin, 2007; 159-174.