參考文獻 |
[1] 趨勢科技Trendmicro.(2015) 從五個資料外洩案例,認識事件發生原因、外洩資料類型與資料流向. Retrieved from https://blog.trendmicro.com.tw/?p=15415 (Accessed:20-Jun-2017)
[2] 維基百科. Bloom Filter Retrieved from https://en.wikipedia.org/wiki/Bloom_filter (Accessed:20-Jun-2017)
[3] Bloom Filters the math Retrieved from http://pages.cs.wisc.edu/~cao/papers/summary-cache/node8.html (Accessed:20-Jun-2017)
[4] Gartner.(2010)From Strategies for Securing Public and Private Cloud Computing(Accessed:20-Jun-2017)From http://www.gartner.com/it/content/1419000/1419019/september_30_strategies_for_securing_cloud_jpescatore.pdf
[5] IDC.(2009)From Silicon to Cloud:Building up to Cloud Computing(Accessed:20-Jun-2017 )From https://www.slideshare.net/jamesprice3/idc-tech-spotlight-from-silicon-to-cloud
[6] 張盛傑.(2005). An Enhanced Bloom Filter Algorithm and It’s Performance Analysis 國立臺灣海洋大學電機工程所碩士論文.
[7] 陳昶憲(2012). A Design of Data Privacy Protection Mechanism for Cloud Computing 長庚大學資訊管理所碩士論文.
[8] Azar, Y. , Vocking, B. (2003). How asymmetry helps load balancing. Journal of the ACM (JACM), 50(4), 568-589.
[9] Bloom, B. H. (1970). Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7), 422-426.
[10] Bonomi, F., Mitzenmacher, M., Panigrahy, R., Singh, S., & Varghese, G. (2006). An improved construction for counting bloom filters. In Annual European Symposium (Vol. 6, pp. 684-695).
[11] Broder, A., & Mitzenmacher, M. (2004). Network applications of bloom filters: A survey. Internet mathematics, 1(4), 485-509.
[12] Charu, A., & Philip, S. Y. (2008). Privacy-preserving data mining. In ACM Sigmod Record (Vol. 29, No. 2, pp. 439-450).
[13] Damopoulos, D., et al. (2014). ”The best of both worlds: a framework for the synergistic operation of host and cloud anomaly-based IDS for smartphones.” EuroSec ′14 Proceedings of the Seventh European Workshop on System Security.
[14] Domingo-Ferrer, J., & Torra, V. (2005). Ordinal, continuous and heterogeneous k-anonymity through microaggregation. Data Mining and Knowledge Discovery, 11(2), 195-212.
[15] Fan, B., Andersen, D. G., Kaminsky, M., & Mitzenmacher, M. D. (2014). Cuckoo filter: Practically better than bloom. In Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies (pp. 75-88).
[16] Fan, L., Cao, P., Almeida, J., & Broder, A. Z. (2000). Summary cache: a scalable wide-area web cache sharing protocol. IEEE/ACM Transactions on Networking (TON), 8(3), 281-293.
[17] Graham, S. W. (1996). Bh sequences. In Analytic number theory (pp. 431-449). Birkhäuser Boston.
[18] Huang, R., Gui, X., Yu, S., & Zhuang, W. (2011). Research on privacy-preserving cloud storage framework supporting ciphertext retrieval. In Network Computing and Information Security (NCIS), 2011 International Conference on(Vol. 1, pp. 93-97). IEEE.
ISBN 9780470344736.
[19] Konheim, Alan (2010). ”HASHING FOR STORAGE: DATA MANAGEMENT”. Hashing in Computer Science: Fifty Years of Slicing and Dicing.
ISBN-13: 978-0470344736
[20] Machanavajjhala, A., Gehrke, J., Kifer, D., & Venkitasubramaniam, M. (2006). l-diversity: Privacy beyond k-anonymity. In Data Engineering, 2006. ICDE′06. Proceedings of the 22nd International Conference on (pp. 24-24). IEEE.
[21] McCallister, E., Grance, T., & Scarfone, K. A. (2010). Guide to protecting the confidentiality of personally identifiable information (PII). Special Publication (NIST SP)-800-122.
[22] Mivule, K. (2013). Utilizing noise addition for data privacy, an overview. The International Conference on Information and Knowledge Engineering, At Las Vegas, USA, Volume: In the Proceedings, Pages 65-71
[23] Overlier, L., & Syverson, P. (2006). Locating hidden servers. In Security and Privacy, 2006 IEEE Symposium on (pp. 15-pp).
[24] Pagh, R., & Rodler, F. F. (2001). Cuckoo hashing. In European Symposium on Algorithms (pp. 121-133). Springer, Berlin, Heidelberg.
[25] Pan, Y., Zhu, X. L., & Chen, T. G. (2012). Research on Privacy Preserving on K-anonymity on US Journal of Software, Vol. 7(7), July 2012.
[26] Pontarelli, S., Reviriego, P., & Maestro, J. A. (2016). Improving counting Bloom filter performance with fingerprints. Information Processing Letters, 116(4), 304-309.
[27] Rashidi, B., et al. (2014). ”RecDroid: A Resource Access Permission Control Portal and Recommendation Service for Smartphone Users.” SPME ′14 Proceedings of the ACM MobiCom workshop on Security and privacy in mobile environments: 13-18.
[28] Sweeney, L. (2002). k-anonymity: A model for protecting privacy. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 10(05), 557-570.
[29] Truong, H. T. T., et al. (2014). ”The Company You Keep: Mobile Malware Infection Rates and Inexpensive Risk Indicators.” WWW ′14 Proceedings of the 23rd international conference on World wide web
[30] Wang, and J. Lan, (2010)“A variable length counting Bloom filter,” in Proc. 2nd Int. Conf. Comput. Eng.Technol., 2010, pp. 504–508.
[31] Wang, C. Y., Yang, W. P., Tseng, J. C., & Hsu, M. (1990). Random filter and its analysis. International journal of computer mathematics, 33(3-4), 181-194. |