Secure and Space Efficient Accounts Storage System Using Three-Dimensional Bloom Filter

Muhammad Arzaki, Raissa Henardianti Hanifa, Farah Afianti

Abstract


This paper investigates the application of a three dimensional Bloom Filter (3DBF) to accomplish a secure and efficient accounts storage system by exploiting hashes of usernames and their corresponding passwords. We conducted numerical experiments and mathematical analysis to study the efficiency level of several 3DBF schemes. Our experimental results and analysis show that the level of occupancy for 3DBF is positively correlated to the value of its false positive rate, viz., if the occupancy level increases then so does the value of the false positive rate. Moreover, we also derive a formula for determining the minimum number of bits for storing some data in a 3DBF scheme given the value of its acceptable false positive rate and its occupancy level. We infer that the product of the dimensional parameter of a 3DBF scheme is inversely proportional to the false positive rate and occupancy level used in the scheme.

Keywords


Accounts storage system; Three-dimensional Bloom Filter; False positive rate

Full Text:

PDF

References


S. Long, “A Comparative Analysis of the Application of Hashing Encryption Algorithms for MD5, SHA-1, and SHA-512,” Journal of Physics: Conference Series, vol. 1314, no. 1, 2019.

W. K. Pertiwi, “Anggota Forum Hacker Klaim Punya Data 13 Juta Akun Bukalapak (In Bahasa Indonesia),” 2020. [Online]. Available: https://tekno.kompas.com/read/2020/05/06/09390047/anggota-forum-hacker-klaim-punya-data-13-juta-akun-bukalapak?page=all

R. Dwinanda, “Tokopedia Laporkan Kasus Kebocoran Data Pengguna (In Bahasa Indonesia),” 2020. [Online]. Available: https://www.republika.co.id/berita/qd18a0414/tokopedia-laporkan-kasus-kebocoran-data-pengguna

R. Patgiri, S. Nayak, and S. K. Borgohain, “Role of Bloom Filter in Big Data research: A survey,” International Journal of Advanced Computer Science and Applications, vol. 9, no. 11, pp. 655–661, 2018.

A. Singh, S. Garg, S. Batra, N. Kumar, and J. J. P. C. Rodrigues, “Bloom filter based optimization scheme for massive data handling in IoT environment,” Future Generation Computer Systems, vol. 82, pp. 440–449, 2018. [Online]. Available: https://doi.org/10.1016/j.future.2017.12.016

W. Liu, Z. Xu, J. Tian, and Y. Zhang, “Towards In-Network Compact Representation: Mergeable Counting Bloom Filter Vis Cuckoo Scheduling,” IEEE Access, vol. 9, pp. 55 329–55 339, 2021.

R. Patgiri, S. Nayak, and S. K. Borgohain, “rDBF: A r-Dimensional Bloom Filter for massive scale membership query,” Journal of Network and Computer Applications, vol. 136, no. March, pp. 100–113, 2019. [Online]. Available: https://doi.org/10.1016/j.jnca.2019.03.004

F. Afianti, C. Asrini, and D. R. Wijaya, “Scalable Two-Dimensional Bloom Filter Membership Scheme on Massive Scale Wireless Sensor Networks,” International Journal of Intelligent Engineering and Systems, vol. 14, no. 1, pp. 474–481, 2021.

B. H. Bloom, “Space/time trade-offs in hash coding with allowable errors,” Communications of the ACM, vol. 13, no. 7, pp. 422–426, 1970.

R. Patgiri, “HFil: A high accuracy bloom filter,” Proceedings - 21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on Data Science and Systems, HPCC/SmartCity/DSS 2019, pp. 2169–2174, 2019.

R. Patgiri, S. Nayak, and S. K. Borgohain, “PassDB : A password database with strict privacy protocol using 3D Bloom filter,” Information Sciences, vol. 539, pp. 157–176, 2020. [Online]. Available: https://doi.org/10.1016/j.ins.2020.05.135

D. Berardi, F. Callegati, A. Melis, and M. Prandini, “Password Similarity Using Probabilistic Data Structures,” Journal of Cybersecurity and Privacy, vol. 1, no. 1, pp. 78–92, 2020.

X. Zhong and Y. Liang, “Scalable downward routing for wireless sensor networks actuation,” IEEE Sensors Journal, vol. 19, no. 20, pp. 9552–9560, 2019.

Z. An, Q. Lin, L. Yang, W. Lou, and L. Xie, “Acquiring Bloom Filters across commercial RFIDs in physical layer,” IEEE/ACM Transactions on Networking, vol. 28, no. 4, pp. 1804–1817, 2020.

G. Ramu, “A secure cloud framework to share EHRs using modified CP-ABE and the attribute Bloom Filter,” Education and Information Technologies, vol. 23, no. 5, pp. 2213–2233, 2018.

C. Xu, N. Wang, L. Zhu, K. Sharif, and C. Zhang, “Achieving searchable and privacy-preserving data sharing for cloud-assisted E-healthcare system,” IEEE Internet of Things Journal, vol. 6, no. 5, pp. 8345–8356, 2019.

AEPD and EDPS, Introduction to the Hash Function as a Personal Data, 2019, no. October.

S. H. Lee and K. W. Shin, “An efficient implementation of SHA processor including three hash algorithms (SHA-512, SHA-512/224, SHA-512/256),” International Conference on Electronics, Information and Communication, ICEIC 2018, vol. 2018-January, pp. 1–4, 2018.




DOI: http://dx.doi.org/10.12962/j24775401.v9i1.12978

Refbacks

  • There are currently no refbacks.



View My Stats


Creative Commons License
International Journal of Computing Science and Applied Mathematics by Pusat Publikasi Ilmiah LPPM, Institut Teknologi Sepuluh Nopember is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Based on a work at https://iptek.its.ac.id/index.php/ijcsam.