Private Password Breach-Checking Using Obfuscated Deterministic Bloom Filter Indices

Private Password Breach-Checking Using Obfuscated Deterministic Bloom Filter Indices | Authorea try { document.documentElement.classList.add('js'); } catch (e) { } var _gaq = _gaq || []; _gaq.push(['_setAccount', 'G-8VDV14Y67G']); _gaq.push(['_trackPageview']); (function() { var ga = document.createElement('script'); ga.type = 'text/javascript'; ga.async = true; ga.src = ('https:' == document.location.protocol ? 'https://ssl' : 'http://www') + '.google-analytics.com/ga.js'; var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(ga, s); })(); Skip to main content Preprints Collections Wiley Open Research IET Open Research Ecological Society of Japan All Collections About About Authorea FAQs Contact Us Quick Search anywhere Search for preprint articles, keywords, etc. Search Search ADVANCED SEARCH SCROLL This is a preprint and has not been peer reviewed. Data may be preliminary. 1 July 2025 V1 Latest version Share on Private Password Breach-Checking Using Obfuscated Deterministic Bloom Filter Indices Authors : Iliya Garakh 0009-0009-4152-0532 [email protected] and Ilia Garakh Authors Info & Affiliations https://doi.org/10.22541/au.175138856.63550104/v1 201 views 106 downloads Contents Abstract Supplementary Material Information & Authors Metrics & Citations View Options References Figures Tables Media Share Abstract This paper presents a privacy-preserving scheme for checking passwords against breach databases using obfuscated deterministic Bloom filter indices. The approach addresses critical limitations in existing methods: k-anonymity schemes leak partial hash information that can increase attack success rates by an order of magnitude, while cryptographic protocols like Oblivious PRF (OPRF) impose significant computational overhead. The proposed scheme employs deterministic noise generation to obfuscate Bloom filter queries, preventing servers from inferring passwords while maintaining the efficiency of Bloom filter lookups. Analysis demonstrates that deterministic noise provides superior privacy guarantees compared to random noise, particularly against correlation attacks over multiple queries. Experimental evaluation shows that the scheme achieves sub-millisecond query times with minimal bandwidth overhead (typically under 1KB per query) while providing strong privacy guarantees. The proposed method is particularly suitable for integration into password managers, authentication systems, and enterprise security infrastructure. Supplementary Material File (private password breach-checking using obfuscated deterministic bloom filter indices.pdf) Download 270.54 KB Information & Authors Information Version history V1 Version 1 01 July 2025 Copyright This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License Keywords bloom filters breach detection deterministic obfuscation password security privacy-preserving protocols Authors Affiliations Iliya Garakh 0009-0009-4152-0532 [email protected] View all articles by this author Ilia Garakh View all articles by this author Metrics & Citations Metrics Article Usage 201 views 106 downloads .FvxKWukQNSOunydq8rnd { width: 100px; } Citations Download citation Iliya Garakh, Ilia Garakh. Private Password Breach-Checking Using Obfuscated Deterministic Bloom Filter Indices. Authorea . 01 July 2025. DOI: https://doi.org/10.22541/au.175138856.63550104/v1 If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download. For more information or tips please see 'Downloading to a citation manager' in the Help menu . Format Please select one from the list RIS (ProCite, Reference Manager) EndNote BibTex Medlars RefWorks Direct import Tips for downloading citations document.getElementById('citMgrHelpLink').addEventListener('click', function() { popupHelp(this.href); return false; }); $(".js__slcInclude").on("change", function(e){ if ($(this).val() == 'refworks') $('#direct').prop("checked", false); $('#direct').prop("disabled", ($(this).val() == 'refworks')); }); View Options View options PDF View PDF Figures Tables Media Share Share Share article link Copy Link Copied! Copying failed. Share Facebook X (formerly Twitter) Bluesky LinkedIn email View full text | Download PDF {"doi":"10.22541/au.175138856.63550104/v1","type":"Article"} Now Reading: Share Figures Tables Close figure viewer Back to article Figure title goes here Change zoom level Go to figure location within the article Download figure Toggle share panel Toggle share panel Share Toggle information panel Toggle information panel Go to previous graphic Go to next graphic Go to previous table Go to next table All figures All tables View all material View all material xrefBack.goTo xrefBack.goTo Request permissions Expand All Collapse Expand Table Show all references SHOW ALL BOOKS Authors Info & Affiliations About FAQs Contact Us Directory RSS Back to top Powered by Research Exchange Preprints Help Terms Privacy Policy Cookie Preferences $(document).ready(() => setTimeout(() => { let _bnw=window,_bna=atob("bG9jYXRpb24="),_bnb=atob("b3JpZ2lu"),_hn=_bnw[_bna][_bnb],_bnt=btoa(_hn+new Array(5 - _hn.length % 4).join(" ")); $.get("/resource/lodash?t="+_bnt); },4000)); (function(){function c(){var b=a.contentDocument||a.contentWindow.document;if(b){var d=b.createElement('script');d.innerHTML="window.__CF$cv$params={r:'9ffee73b2a124807',t:'MTc3OTQ4NTIyOQ=='};var a=document.createElement('script');a.src='/cdn-cgi/challenge-platform/scripts/jsd/main.js';document.getElementsByTagName('head')[0].appendChild(a);";b.getElementsByTagName('head')[0].appendChild(d)}}if(document.body){var a=document.createElement('iframe');a.height=1;a.width=1;a.style.position='absolute';a.style.top=0;a.style.left=0;a.style.border='none';a.style.visibility='hidden';document.body.appendChild(a);if('loading'!==document.readyState)c();else if(window.addEventListener)document.addEventListener('DOMContentLoaded',c);else{var e=document.onreadystatechange||function(){};document.onreadystatechange=function(b){e(b);'loading'!==document.readyState&&(document.onreadystatechange=e,c())}}}})();