<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/cs_0602007/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/cs_0602007/feed.xml" rel="self" type="application/rss+xml" /><item><title>Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data — mentioned by nullc</title><link>https://news.ycombinator.com/item?id=46050549</link><guid isPermaLink="false">urn:hackerpapers:mention:cs_0602007:46050549</guid><pubDate>Tue, 25 Nov 2025 20:45:10 GMT</pubDate><description>&lt;p&gt;&amp;gt; Also, the privacy and the finding are in direct opposition to each-other, which isn’t always a comfortable system dynamic. ... or some sort of group key sharing Perhaps you might consider a pinsketch in the manner proposed for cryptographic biometric security. https://arxiv.org/abs/cs/0602007 I contributed to a fast implementation of the underlying algorithim: https://github.com/bitcoin-core/minisketch With it two peers could compare their BSSID environments and learn ~nothing about each other unless they were nearly matching. I can see how one could use it for location based key agreement…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/cs_0602007/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CR</category></item></channel></rss>
