Public key encryption schemes supporting equality test with authorisation of different granularity

International Journal of Applied Cryptography

Volumn 2, Issue 4, 2012, Pages 304-321

  Tang, Qiang ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Authorisation granularity; Equality test; Public key encryption

Indexed keywords

EID: 84864207661     PISSN: 17530563     EISSN: 17530571     Source Type: Journal    
DOI: 10.1504/IJACT.2012.048079     Document Type: Article

References (22)

1. Ballard, L., Green, M., de Medeiros, B. and Monrose, F. (2005) 'Correlation-resistant storage via keyword-searchable encryption', Tech. Rep. Report 2005/417, IACR, available at http://eprint.iacr.org/2005/417.
2. Bellare, M. and Rogaway, P. (1993) 'Random oracles are practical: a paradigm for designing efficient protocols', in Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62-73, ACM Press.
3. Bellare, M., Desai, A., Pointcheval, D. and Rogaway, P. (1998) 'Relations among notions of security for public-key encryption schemes', in Krawczyk, H. (Ed.): Advances in Cryptology - CRYPTO 1998, LNCS, Vol. 1462, pp. 26-45, Springer. (Pubitemid 128118995)
4. Blum, M. (1983) 'Coin flipping by telephone a protocol for solving impossible problems', SIGACT News, Vol. 15, No. 1, pp. 23-27.
5. Boneh, D. and Franklin, M.K. (1997) 'Efficient generation of shared RSA keys (extended abstract)', in Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology, pp. 425-439. (Pubitemid 127112570)
6. Boneh, D., Boyen, X. and Shacham, H. (2004a) 'Short group signatures', in Franklin, M.K. (Ed.): Advances in Cryptology - CRYPTO 2004, LNCS, Vol. 3152, pp. 41-55, Springer.
7. Boneh, D., Crescenzo, G.D., Ostrovsky, R. and Persiano, G. (2004b) 'Public key encryption with keyword search', in Cachin, C. and Camenisch, J. (Eds.): Advances in Cryptology - EUROCRYPT 2004, LNCS, Vol. 3027, pp. 506-522, Springer.
8. Boyen, X. (2008) 'The uber-assumption family', in Galbraith, S.D. and Paterson, K.G. (Eds.): Pairing-Based Cryptography - Pairing 2008, LNCS, Vol. 5209, pp. 39-56, Springer.
9. Byun, J.W., Rhee, H.S., Park, H. and Lee, D.H. (2006) 'Off-line keyword guessing attacks on recent keyword search schemes over encrypted data', in Jonker, W. and Petkovic, M. (Eds.): Secure Data Management, Third VLDB Workshop, SDM 2006, LNCS, Vol. 4165, pp. 75-83, Springer. (Pubitemid 44699624)
10. ElGamal, T. (1984) 'A public key cryptosystem and a signature scheme based on discrete logarithms', in Blakley, G.R. and Chaum, D. (Eds.): Advances in Cryptology - CRYPTO 1984, LNCS, Vol. 196, pp. 10-18.
11. Freedman, M.J., Nissim, K. and Pinkas, B. (2004) 'Efficient private matching and set intersection', in Advances in Cryptology - EUROCRYPT 2004, LNCS, Vol. 3027, pp. 1-19, Springer.
12. Hwang, Y.H. and Lee, P.J. (2007) 'Public key encryption with conjunctive keyword search and its extension to a multi-user system', in Takagi, T., Okamoto, T., Okamoto, E. and Okamoto, T. (Eds.): Pairing-Based Cryptography - Pairing 2007, LNCS, Vol. 4575, pp. 2-22, Springer.
13. Paillier, P. (1999) 'Public-key cryptosystems based on composite degree residuosity classes', in Stern, J. (Ed.): Advances in Cryptology -EUROCRYPT 1999, LNCS, Vol. 1592, pp. 223-238.
14. Rivest, R.L., Shamir, A. and Wagner, D.A. (1996) 'Time-lock puzzles and timed-release crypto', Tech. Rep. MIT/LCS/TR-684, Massachusetts Institute of Technology.
15. Sahai, A. and Waters, B. (2005) 'Fuzzy identity-based encryption', in Advances in Cryptology - EUROCRYPT 2005, LNCS, Vol. 3494, pp. 457-473, Springer. (Pubitemid 41313969)
16. Shoup, V. (2006) 'Sequences of games: a tool for taming complexity in security proofs', available at http://shoup.net/papers/ (accessed on 10 November 2011).
17. Sittig, D.F. (2002) 'Personal health records on the internet: a snapshot of the pioneers at the end of the 20th century', I.J. Medical Informatics, Vol. 65, No. 1, pp. 1-6. (Pubitemid 34213787)
18. Tang, Q. (2011a) 'Public key encryption supporting plaintext equality test and user-specified authorization', Tech. Rep. TR-CTIT-11-20, CTIT, University of Twente, available at http://eprints.eemcs.utwente.nl/20529/.
19. Tang, Q. (2011b) Towards public key encryption scheme supporting equality test with fine-grained authorization', in Proceedings of the 16th Australasian Conference on Information Security and Privacy, LNCS, Vol. 6812, pp. 389-406, Springer.
20. Tang, Q. and Chen, L. (2009) 'Public-key encryption with registered keyword search', in Proceeding of Public Key Infrastructure, 5th European PKI Workshop: Theory and Practice (EuroPKI 2009), LNCS, Vol. 6391, pp. 163-178, Springer.
21. Tang, Q. and Jeckmans, A. (2010) 'On non-parallelizable deterministic client puzzle scheme with batch verification modes', Tech. Rep. TR-CTIT-10-02, CTIT, University of Twente, available at http://eprints.eemcs.utwente.nl/17107/.
22. Yang, G., Tan, C., Huang, Q. and Wong, D.S. (2010) 'Probabilistic public key encryption with equality test', in Pieprzyk, J. (Ed.): Topics in Cryptology - CT-RSA 2010, LNCS, Vol. 5985, pp. 119-131, Springer.