haveibeenpwned / pwnedpasswordsazurefunction Goto Github PK
View Code? Open in Web Editor NEWAPIs for the k-anonymity Pwned Passwords implementation
License: BSD 3-Clause "New" or "Revised" License
APIs for the k-anonymity Pwned Passwords implementation
License: BSD 3-Clause "New" or "Revised" License
Filing this as an issue, but it doesn't seem to be fixable until a new version of the Azure Functions Worker SDK is released. See these issues for details:
This seems to be broken for .NET 5.0 functions running in isolation mode.
Anything that would be useful? I'd love to assist.
I noticed the different regexes has no timeouts which means they could feasibly bring down with the “right” input (i will make a PR for this tomorrow, but creating an issue for posterity)
I would like to kindly bring attention to a potential issue in the ProcessAppendQueueItem, which is invoked by messages that enter the %TableNamespace%-ingestion
queue. For each queue item, function ProcessPasswordEntry is called to first increment the pwned passwords’ prevalence stored in the table entries and then increment the prevalence in the blob storage. However, this method is not idempotent. Suppose the function is crashed after incrementing table entries; when the function retries, the table entries and blob entries will be incremented again. The values stored in the table entries hence deviate from the blob entries and the ground truth. If the retry happens after incrementing both the table entries and the blob entries, both counters will deviate from the ground truth due to duplicate updates.
Though the deviation of the prevalence counter is not a huge problem, such an issue can be resolved by maintaining a LastRequestId
field in each table entry and blob entry, which stores the invocation id of the last ProcessAppendQueueItem function call. The invocation id is constant across Azure Function retries. Before updating a table/blob entry, if the comparison finds item.LastRequestId == FunctionContext.InvocationId
, this means the update has happened before, so continue to iterate the next table entry or blob. Otherwise, if item.LastRequestId != FunctionContext.InvocationId
, update the prevalence counter and the LastRequestId
field with FunctionContext.InvocationId
.
Thank you for considering this potential issue. I hope this suggestion can help improve the idempotency of the ProcessAppendQueueItem. Please feel free to reach out if you have any questions or concerns.
Hi all - I would like to contribute and was wondering if there are any issues that may have not been opened yet. If anyone wouldn't mind pointing me in the right direction, I would very much appreciate it. Thank you!
Any chance of providing k-anonymity ranges for NTLM hashes?
I think this would be valuable for checking local user's passwords in small AD domains, where downloading the whole corpus is a bit too much.
A declarative, efficient, and flexible JavaScript library for building user interfaces.
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google ❤️ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.