A framework of secure delivery service of targeted coupons with encrypted search is proposed to solve privacy issues of users and vendors in delivery service of mobile targeted coupons. The proposed framework adopts a newly developed cryptographic primitive
called multi-key searchable encryption
which ensures that a user only needs to submit a single encrypted request to the coupon site so as to conduct secure and effective search over encrypted coupons from different vendors. Meanwhile
the framework ensures that eligible users can obtain targeted coupons without leaking their behavioral data while non-eligible users learn nothing beyond their non-eligibility status by combining locality-sensitive hashing with password authenticated key exchange. Theoretical analysis proves the security of the proposed framework. Extensive experiments show that when a mobile user obtains coupons from 10 different vendors
the computation cost of the proposed framework is 57.8 ms
bandwidth cost 2.9 KiB
and energy cost 8.7 J. The proposed framework provides a well-balanced tradeoff between security and efficiency
and has certain theoretical and practical significance for the design of secure and practical targeted delivery systems.
LIU Xin, XU Qiuliang. Practical multi-coupon schemes with strong unsplittability [J]. Journal of Computer Research and Development, 2012, 49(12): 2575-2590.
ALISON G. Millennials use coupons more than their parents [EB/OL].(2014-03-07)[2016-08-05]. http: ∥www.businessinsider.com/millennials-use-coupons-more-than-parents-2014-3.
ZHOU Aoying, ZHOU Minqi, GONG Xueqing. Computational advertising: a data-centric comprehensive web application [J]. Chinese Journal of Computers, 2011, 34(10): 1805-1819.
ZHANG Xuejun, GUI Xiaolin, FENG Zhichao, et al. A quantifying framework of query privacy in location-based service [J]. Journal of Xi'an Jiaotong University, 2014, 48(2): 8-13.
GUHA S, CHENG B, FRANCIS P. Privad: practical privacy in online advertising [C]∥Proceedings of the 8th USENIX Conference on Networked Systems Design and Implementation. Berkeley, CA, USA: USENIX Association, 2011: 169-182.
BACKES M, KATE A, MAFFEI M, et al. Obliviad: provably secure and practical online behavioral advertising [C]∥Proceedings of the 33rd IEEE Symposium on Security and Privacy. Piscataway, NJ, USA: IEEE, 2012: 257-271.
PARTRIDGE K, PATHAK M A, UZUN E, et al. Picoda: privacy-preserving smart coupon delivery architecture [C]∥Proceedings of the 5th Workshop on Hot Topics in Privacy Enhancing Technologies. Berlin, Germany: Springer-Verlag, 2012: 94-108.
RANE S, UZUN E. A fuzzy commitment approach to privacy preserving behavioral targeting [C]∥Proceedings of the ACM MobiCom Workshop on Security and Privacy in Mobile Environments. New York, USA: ACM, 2014: 31-35.
CURTMOLA R, GARAY J, KAMARA S, et al. Searchable symmetric encryption: improved definitions and efficient constructions [C]∥Proceedings of the 13th ACM Conference on Computer and Communications Security. New York, USA: ACM, 2006: 79-88.
POPA R A, ZELDOVICH N. Multi-key searchable encryption [EB/OL].(2013-08-17)[2016-09-05]. http:∥eprint. iacr.org/2013/508.pdf.
LIU J, ASOKAN N, PINKAS B. Secure deduplication of encrypted data without additional independent servers [C]∥Proceedings of the 22nd ACM Conference on Computer and Communications Security. New York, USA: ACM, 2015: 874-885.
ABDALLA M, POINTCHEVAL D. Simple password-based encrypted key exchange protocols [C]∥Proceedings of the the Cryptographers' Track at the RSA Conference. Berlin, Germany: Springer-Verlag, 2005: 191-208.