1 |
B.H. Bloom, "Space/Time Trade-Offs in Hash Coding with Allowable Errors," Communication of the ACM, vol.13, no.7, pp.422-426, July. 1970.
DOI
|
2 |
KOMORAN v 1.0, [Online]. Available, http://shineware.tistory.com/m/post/view/id/37
|
3 |
A. Broder and M. Mitzenmacher, "Network Applications of Bloom Filters: A Survey," Internet Mathematics, vol.1, no.4, pp.485-509, 2004.
DOI
|
4 |
Yan Qiao, Tao Li and Shigang Chen, "Fast Bloom Filters and Their Generalization," IEEE Transactions on Parallel and Distributed System, vol.25, no.1, pp.93-102, January. 2014.
DOI
|
5 |
Android Open Source Project, [Online]. Available, http://source.and roid.com/source/index.html
|
6 |
Sun-Young Kim, Jae-Woo Seo and Pil-Joong Lee, "The Study on Trends of Searchable Encryption," Journal of The Korea Institute of Information Security & Cryptology(JKIISC), 19(2), pp.73-90, April. 2010.
|
7 |
D. Song, D. Wagner, and A. Perrig, "Practical techniques for searching on encrypted data," IEEE Symposium on Security and Privacy, pp.44-55, May. 2000.
|
8 |
Eu-Jin Goh, "Secure Indexes," IACR ePrint 2003-216, May. 2004.
|
9 |
C. Bosch, R. Brinkman, P. Hartel, and W. Jonker, "Conjunctive wildcard search over encrypted data," the 8th VLDB Workshop on Secure Data Management, pp.114-127, February. 2011.
|
10 |
R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu, "Order preserving encryption for numeric data," the 2004 ACM SIGMOD international conference on Management of data, pp.563-574, June. 2004.
|
11 |
D. Boneh, G. di Crescenzo, R. Ostrovsky, and G. Persiano, "Public key encryption with keyword search," EUROCRYPT 04, LNCS 3027, pp. 506-522, May.2004.
|
12 |
S. Bellovin and W. Cheswick, "Privacyenhanced searches using encrypted Bloom filters," IACR ePrint 2004-022, September. 2004.
|