Improved searchable public key encryption with designated tester

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Improved searchable public key encryption with designated tester

Full text

Pdf (720 KB)

Source

ASIAN ACM Symposium on Information, Computer and Communications Security archive
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security table of contents

Sydney, Australia

SESSION: Short papers-I table of contents

Pages 376-379

Year of Publication: 2009

ISBN:978-1-60558-394-5

Authors

Hyun Sook Rhee	University of Wollongong
Jong Hwan Park	Korea University
Willy Susilo	University of Wollongong
Dong Hoon Lee	Korea University

Sponsor

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 29, Downloads (12 Months): 72, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1533057.1533108 What is a DOI?

ABSTRACT

Recently, Baek et al. proposed an efficient public key encryption scheme with keyword search based on the scheme of Boneh et al., However, the security model of Baek et al. seriously limits the ability of the adversary.

In this paper, we enhance the security model of the public key encryption with keyword search to properly incorporate the ability of an adversary. We also construct a public key encryption scheme with keyword search secure in the enhanced security model.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	M. Abdalla, M. Bellare, E. K. D. Catalano, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, and H. Shi. Searchable encryption revisited: Consistency properties, relation to anonymous ibe, and extensions. In Proc. of Crypto 2005, volume 3621 of LNCS, pages 205--222. Springer, 2005.
	2	Joonsang Baek , Reihaneh Safavi-Naini , Willy Susilo, Public Key Encryption with Keyword Search Revisited, Proceeding sof the international conference on Computational Science and Its Applications, Part I, June 30-July 03, 2008, Perugia, Italy [doi>10.1007/978-3-540-69839-5_96]
	3	D. Boneh and X. Boyen. Efficient selective-id secure identity based encryption without random oracle. In Proc. of Eurocrypt 2004, volume 3027 of LNCS.
	4	D. Boneh, G. D. Crescenzo, R. Ostrovsky, and G. Persiano. Public key encryption with keyword search. In Proc. of Eurocrypt 2004, volume 3027 of LNCS, pages 506--522. Springer, 2004.
	5	D. Boneh and B. Waters. Conjunctive, subset, and range queries on encrypted data. In Proc. of TCC 2007, volume 4392 of LNCS, pages 535--554. Springer, 2007.
	6	K. K. D. Park and P. Lee. Public key encryption with conjunctive field keyword search. In Proc. of 5th International Workshop WISA 2004, volume 3325 of LNCS, pages 73--86. Springer, 2004.
	7	P. Golle, J. Staddon, and B. Waters. Secure conjunctive keyword search over encrypted data. In Proc. of 2nd International Conference on ACNS: Applied Cryptography and Network Security, volume 3089 of LNCS, pages 31--45. Springer, 2004.
	8	Wakaha Ogata , Kaoru Kurosawa, Oblivious keyword search, Journal of Complexity, v.20 n.2-3, p.356-371, April/June 2004 [doi>10.1016/j.jco.2003.08.023]