<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: ekr____</title><link>https://news.ycombinator.com/user?id=ekr____</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Sat, 12 Sep 2026 00:03:39 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=ekr____" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by ekr____ in "RFC 9851: TLS 1.2 is in Feature Freeze"]]></title><description><![CDATA[
<p>This isn't quite how TLS feature negotiation works.<p>Version numbers are negotiated and some of the parameters are carried along with the version, but a lot of functionality (e.g., cipher suites) is individually negotiated and to some extent orthogonal to the version. This of course also allows you to add new features to an existing version.<p>What this draft is saying is that the IETF will not be adding new features targeted at TLS 1.2.</p>
]]></description><pubDate>Mon, 03 Aug 2026 03:50:24 +0000</pubDate><link>https://news.ycombinator.com/item?id=49151020</link><dc:creator>ekr____</dc:creator><comments>https://news.ycombinator.com/item?id=49151020</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49151020</guid></item><item><title><![CDATA[New comment by ekr____ in "RFC 9851: TLS 1.2 is in Feature Freeze"]]></title><description><![CDATA[
<p>TLS is an extensible protocol. For instance, you can add new key establishment algorithms or cipher suites. What this specification is saying is that the IETF will not be publishing such extensions for TLS 1.2. For example, they will not be adding post-quantum key establishment.</p>
]]></description><pubDate>Mon, 03 Aug 2026 03:23:03 +0000</pubDate><link>https://news.ycombinator.com/item?id=49150872</link><dc:creator>ekr____</dc:creator><comments>https://news.ycombinator.com/item?id=49150872</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49150872</guid></item><item><title><![CDATA[New comment by ekr____ in "NSA and IETF: Fairness"]]></title><description><![CDATA[
<p>No disagreement there.</p>
]]></description><pubDate>Wed, 08 Jul 2026 13:49:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=48831958</link><dc:creator>ekr____</dc:creator><comments>https://news.ycombinator.com/item?id=48831958</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48831958</guid></item><item><title><![CDATA[New comment by ekr____ in "NSA and IETF: Fairness"]]></title><description><![CDATA[
<p>I have no opinion on ULA+NPTv6, other than Experimental doesn't mean you shouldn't use it. How else would people experiment. It does mean that the level of vetting by the IETF is potentially lower.<p>WRT IPv4 NAT, I'm not sure how much we can infer from the status. Many people at IETF were (and some still are) very anti-NAT, in part because they felt that IPv6 was the right solution. As a result, the IETF really avoided doing anything that looked like it was endorsing NAT, even though it's obviously just a fact of the Internet.</p>
]]></description><pubDate>Tue, 07 Jul 2026 18:25:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=48821606</link><dc:creator>ekr____</dc:creator><comments>https://news.ycombinator.com/item?id=48821606</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48821606</guid></item><item><title><![CDATA[New comment by ekr____ in "NSA and IETF: Fairness"]]></title><description><![CDATA[
<p>In fairness, I do think that this situation is somewhat different. As I noted above (<a href="https://news.ycombinator.com/item?id=48812792">https://news.ycombinator.com/item?id=48812792</a>), there are two main routes to an Informational RFC of this kind.<p>* Through the IETF<p>* Through the Independent Stream<p>The GOST documents went through the Independent Stream and therefore do not have IETF imprimateur. These documents are proposed for the IETF Stream and therefore require IETF Consensus to publish.<p>I know this is all super confusing. The basic problem is that the vast majority of RFCs come out of the IETF and so people often act as if all RFCs do. This is of course in part why people pursue Independent Stream publication rather than just publishing things on their own..</p>
]]></description><pubDate>Tue, 07 Jul 2026 16:09:20 +0000</pubDate><link>https://news.ycombinator.com/item?id=48819788</link><dc:creator>ekr____</dc:creator><comments>https://news.ycombinator.com/item?id=48819788</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48819788</guid></item><item><title><![CDATA[New comment by ekr____ in "NSA and IETF: Fairness"]]></title><description><![CDATA[
<p>This document actually is being advanced as Informational, though there are also non-IETF Informational RFCs (see upthread).</p>
]]></description><pubDate>Tue, 07 Jul 2026 03:25:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=48813360</link><dc:creator>ekr____</dc:creator><comments>https://news.ycombinator.com/item?id=48813360</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48813360</guid></item><item><title><![CDATA[New comment by ekr____ in "NSA and IETF: Fairness"]]></title><description><![CDATA[
<p>> What’s his next step if the authors publish as an information RFC? He can’t stop that, right?<p>This is a slightly complicated question. There are several main routes to an Informational RFC.<p>* Through the IETF Stream, either through the Working Group (what is happening now) or via sponsorship by an Area Director. The former is what is happening now (this document is not up for Proposed Standard). I don't think the latter is likely to happen if TLS WG decides not to publish. If the TLS WG <i>does</i> decide to publish, then there are a number of steps afterward (AD review, IETF Last Call, IESG Review), plus potential avenues for appeal at some of these stages.<p>* Through the Independent Submissions Editor (ISE) (though in another comment wbl says that the ISE is not going to publish cryptography standards <a href="https://news.ycombinator.com/item?id=48812844">https://news.ycombinator.com/item?id=48812844</a>). This is essentially at the sole discretion of the ISE and can't be appealed.<p>In either case, if the document makes it through all these gates and is eventually published as an RFC, then that's pretty much it, as RFCs aren't changed once published.</p>
]]></description><pubDate>Tue, 07 Jul 2026 03:24:37 +0000</pubDate><link>https://news.ycombinator.com/item?id=48813356</link><dc:creator>ekr____</dc:creator><comments>https://news.ycombinator.com/item?id=48813356</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48813356</guid></item><item><title><![CDATA[New comment by ekr____ in "NSA and IETF: Fairness"]]></title><description><![CDATA[
<p>Good question.<p>If the document is dropped by the IETF, nothing at all would happen. It's already a valid code point registration, and indeed the authors could have just published the document, registered the code points, and stopped (see: <a href="https://datatracker.ietf.org/doc/draft-barnes-tls-this-could-have-been-an-email/" rel="nofollow">https://datatracker.ietf.org/doc/draft-barnes-tls-this-could...</a>).<p>If the authors decided to later pick up the document somewhere else, then they could probably get the reference changed to whatever that was, as long as the semantics were identical.</p>
]]></description><pubDate>Tue, 07 Jul 2026 02:24:53 +0000</pubDate><link>https://news.ycombinator.com/item?id=48813004</link><dc:creator>ekr____</dc:creator><comments>https://news.ycombinator.com/item?id=48813004</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48813004</guid></item><item><title><![CDATA[New comment by ekr____ in "NSA and IETF: Fairness"]]></title><description><![CDATA[
<p>You're right. Bad writing on my part. Edited to make it clear.</p>
]]></description><pubDate>Tue, 07 Jul 2026 02:06:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=48812885</link><dc:creator>ekr____</dc:creator><comments>https://news.ycombinator.com/item?id=48812885</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48812885</guid></item><item><title><![CDATA[New comment by ekr____ in "NSA and IETF: Fairness"]]></title><description><![CDATA[
<p>Adding a little color here... There are already code points registered for pure ML-KEM on the basis of the draft.<p>The hybrid code point you reference is "preliminary" in the sense that when the RFC for hybrid ECC/ML-KEM is published (it's already been approved, <a href="https://datatracker.ietf.org/doc/draft-ietf-tls-ecdhe-mlkem/" rel="nofollow">https://datatracker.ietf.org/doc/draft-ietf-tls-ecdhe-mlkem/</a>), it will replace the reference in the registry. However, it will have the same code point and the same semantics. If, for some reason, the IETF were to change the semantics, a new code point would have to be assigned for interop reasons.</p>
]]></description><pubDate>Tue, 07 Jul 2026 01:58:31 +0000</pubDate><link>https://news.ycombinator.com/item?id=48812831</link><dc:creator>ekr____</dc:creator><comments>https://news.ycombinator.com/item?id=48812831</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48812831</guid></item><item><title><![CDATA[New comment by ekr____ in "NSA and IETF: Fairness"]]></title><description><![CDATA[
<p>> (2) The RFC at issue documents the possibility of running TLS with pure MLKEM rather than in a hybrid configuration with ECDH. Hybrid TLS is already the mainstream, documented, standardized method for using PQC in a TLS connection. Bernstein is canvassing opposition to any documentation of the possibility of pure MLKEM in TLS.<p>Two more pieces of context here: 
1. The IETF allows code point registrations based purely on the existence of a specification, and the pure ML-KEM code points have already been assigned (<a href="https://www.iana.org/assignments/tls-parameters/tls-parameters.xhtml#tls-parameters-8" rel="nofollow">https://www.iana.org/assignments/tls-parameters/tls-paramete...</a>). The question at hand is whether the IETF will publish an RFC documenting the ML-KEM cipher suites [edited to make clear that ML-KEM is documented already].<p>2. It is also possible to publish an RFC via what's called "Independent Submission" (<a href="https://www.rfc-editor.org/authors/rfc-independent-submissions/" rel="nofollow">https://www.rfc-editor.org/authors/rfc-independent-submissio...</a>), which is not subject to the IETF Consensus process. This is, for instance, how the GOST RFC (<a href="https://datatracker.ietf.org/doc/rfc9367/" rel="nofollow">https://datatracker.ietf.org/doc/rfc9367/</a>) was published. If the IETF opts not to publish this draft, the authors can still submit it to the Independent Submissions Editor.</p>
]]></description><pubDate>Tue, 07 Jul 2026 01:51:50 +0000</pubDate><link>https://news.ycombinator.com/item?id=48812792</link><dc:creator>ekr____</dc:creator><comments>https://news.ycombinator.com/item?id=48812792</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48812792</guid></item><item><title><![CDATA[New comment by ekr____ in "Opening up 'Zero-Knowledge Proof' technology to promote privacy in age assurance"]]></title><description><![CDATA[
<p>That's not really possible to explain in this space, unfortunately, but the overall idea is that there are mathematical techniques that allow you to prove that you have a valid certificate without revealing which one it is.</p>
]]></description><pubDate>Thu, 02 Jul 2026 12:52:24 +0000</pubDate><link>https://news.ycombinator.com/item?id=48760756</link><dc:creator>ekr____</dc:creator><comments>https://news.ycombinator.com/item?id=48760756</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48760756</guid></item><item><title><![CDATA[New comment by ekr____ in "Opening up 'Zero-Knowledge Proof' technology to promote privacy in age assurance"]]></title><description><![CDATA[
<p>This isn't correct. With ZKP-based systems even the CA can't track you. That's the "zero-knowledge" part.</p>
]]></description><pubDate>Thu, 02 Jul 2026 04:03:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=48756423</link><dc:creator>ekr____</dc:creator><comments>https://news.ycombinator.com/item?id=48756423</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48756423</guid></item><item><title><![CDATA[New comment by ekr____ in "Opening up 'Zero-Knowledge Proof' technology to promote privacy in age assurance"]]></title><description><![CDATA[
<p>The proof is bound to a cryptographic key stored in a tamper-resistant module (as in a phone).<p>See <a href="https://educatedguesswork.org/posts/age-verification-id/#device-binding" rel="nofollow">https://educatedguesswork.org/posts/age-verification-id/#dev...</a> for some more detail.</p>
]]></description><pubDate>Thu, 02 Jul 2026 04:02:06 +0000</pubDate><link>https://news.ycombinator.com/item?id=48756414</link><dc:creator>ekr____</dc:creator><comments>https://news.ycombinator.com/item?id=48756414</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48756414</guid></item><item><title><![CDATA[New comment by ekr____ in "The KIDS Act would require age checks to get online"]]></title><description><![CDATA[
<p>Note that the EU is proposing to do this [0]. The ZKP part is a bit of a WIP and there have been some questions about the quality [1].<p>[0] <a href="https://digital-strategy.ec.europa.eu/en/faqs/eu-age-verification-solution" rel="nofollow">https://digital-strategy.ec.europa.eu/en/faqs/eu-age-verific...</a><p>[1] <a href="https://proton.me/blog/eu-age-verification-app-hacked" rel="nofollow">https://proton.me/blog/eu-age-verification-app-hacked</a></p>
]]></description><pubDate>Sun, 28 Jun 2026 23:01:35 +0000</pubDate><link>https://news.ycombinator.com/item?id=48712675</link><dc:creator>ekr____</dc:creator><comments>https://news.ycombinator.com/item?id=48712675</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48712675</guid></item><item><title><![CDATA[New comment by ekr____ in "The KIDS Act would require age checks to get online"]]></title><description><![CDATA[
<p>My sense is that many jurisdictions do not consider this sufficient, as they want to prevent parents from allowing their children to access restricted material (as happens fairly frequently). However, I guess we'll see.</p>
]]></description><pubDate>Sun, 28 Jun 2026 22:59:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=48712648</link><dc:creator>ekr____</dc:creator><comments>https://news.ycombinator.com/item?id=48712648</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48712648</guid></item><item><title><![CDATA[New comment by ekr____ in "The KIDS Act would require age checks to get online"]]></title><description><![CDATA[
<p>> You don't wind up in a database for buying alcohol.<p>I don't think this is a good assumption. It's not uncommon for stores to scan your ID when you buy alcohol.<p>> This proposal puts your name right next to the category of porn you're into, which will be a great way to coerce all those politicians into voting for the "correct" bill. Would be a shame if they found out a state senator watched porn, so maybe they'd better vote yes on the proposal.<p>This is not quite how typical systems are structured. Rather, the service provider outsources the age assurance to some third party Age Verification Provider (AVP), which then just returns an age estimate or a yes/no. Commonly, the AVP will have a stated policy that they don't share your identity with the client.<p>Obviously, you have to trust the AVP to comply with this policy, which is not ideal. There are approaches (e.g., zero-knowledge proofs) that provide some technical privacy protections, but they're not currently in wide use.<p>Note: this is not an endorsement of age assurance; I'm just trying to clarify the situation.</p>
]]></description><pubDate>Sun, 28 Jun 2026 22:57:52 +0000</pubDate><link>https://news.ycombinator.com/item?id=48712636</link><dc:creator>ekr____</dc:creator><comments>https://news.ycombinator.com/item?id=48712636</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48712636</guid></item><item><title><![CDATA[New comment by ekr____ in "The KIDS Act would require age checks to get online"]]></title><description><![CDATA[
<p>Note that California AB1043 isn't actually age verification; rather it just requires the OS to ask for your age, not check it.</p>
]]></description><pubDate>Sun, 28 Jun 2026 22:43:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=48712515</link><dc:creator>ekr____</dc:creator><comments>https://news.ycombinator.com/item?id=48712515</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48712515</guid></item><item><title><![CDATA[New comment by ekr____ in "Choosing a Public DNS Resolver"]]></title><description><![CDATA[
<p>Hence Encrypted Client Hello (<a href="https://datatracker.ietf.org/doc/rfc9849/" rel="nofollow">https://datatracker.ietf.org/doc/rfc9849/</a>), though   deployment is still thin.</p>
]]></description><pubDate>Sun, 28 Jun 2026 18:30:35 +0000</pubDate><link>https://news.ycombinator.com/item?id=48710068</link><dc:creator>ekr____</dc:creator><comments>https://news.ycombinator.com/item?id=48710068</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48710068</guid></item><item><title><![CDATA[New comment by ekr____ in "What we call "age verification" is actually mass surveillance"]]></title><description><![CDATA[
<p>Typically these APIs are designed so you can't make arbitrary queries, but rather there are fixed age brackets.</p>
]]></description><pubDate>Tue, 23 Jun 2026 16:54:04 +0000</pubDate><link>https://news.ycombinator.com/item?id=48647806</link><dc:creator>ekr____</dc:creator><comments>https://news.ycombinator.com/item?id=48647806</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48647806</guid></item></channel></rss>