<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0">
    <channel>
        <title>Recent RFCs</title>
        <link>https://www.rfc-editor.org</link>
        <description>Recently published RFCs</description>
        <lastBuildDate>Thu, 19 Nov 2026 18:35:10 GMT</lastBuildDate>
        <docs>https://validator.w3.org/feed/docs/rss2.html</docs>
        <generator>https://www.npmjs.com/package/feed</generator>
        <language>en-us</language>
        <item>
            <title><![CDATA[RFC 10021: Group Object Security for Constrained RESTful Environments (Group OSCORE)]]></title>
            <link>https://www.rfc-editor.org/info/rfc10021/</link>
            <guid isPermaLink="true">https://www.rfc-editor.org/info/rfc10021/</guid>
            <pubDate>Thu, 19 Nov 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[This document defines the security protocol Group Object Security for Constrained RESTful Environments (Group OSCORE), providing end-to-end security of messages exchanged with the Constrained Application Protocol (CoAP) between members of a group, e.g., sent over IP multicast. In particular, Group OSCORE provides protection and source authentication for group requests sent from a client to multiple servers and for the corresponding responses. Group OSCORE also defines a pairwise mode where each member of the group can efficiently derive symmetric pairwise keys to use with another member of the group for pairwise-protected communication. Group OSCORE can be used between endpoints communicating with CoAP or CoAP-mappable HTTP.]]></description>
        </item>
        <item>
            <title><![CDATA[RFC 10020: Group Communication for the Constrained Application Protocol (CoAP)]]></title>
            <link>https://www.rfc-editor.org/info/rfc10020/</link>
            <guid isPermaLink="true">https://www.rfc-editor.org/info/rfc10020/</guid>
            <pubDate>Thu, 19 Nov 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[The Constrained Application Protocol (CoAP) is a web transfer protocol for constrained devices and constrained networks. In a number of use cases, constrained devices often naturally operate in groups (e.g., in a building automation scenario, all lights in a given room may need to be switched on/off as a group). This document specifies the use of CoAP for group communication, including the use of UDP/IP multicast as the default underlying data transport. Both unsecure and secure CoAP group communication are specified. Security is achieved by use of the Group Object Security for Constrained RESTful Environments (Group OSCORE) protocol. The target application area of this specification is any group communication use cases that involve resource-constrained devices or networks that support CoAP. This document obsoletes RFC 7390 and updates RFCs 7252 and 7641.]]></description>
        </item>
        <item>
            <title><![CDATA[RFC 10097: Tiebreaking Resource Public Key Infrastructure (RPKI) Trust Anchors]]></title>
            <link>https://www.rfc-editor.org/info/rfc10097/</link>
            <guid isPermaLink="true">https://www.rfc-editor.org/info/rfc10097/</guid>
            <pubDate>Wed, 18 Nov 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[A Trust Anchor (TA) in the Resource Public Key Infrastructure (RPKI) is represented by a self-signed X.509 Certification Authority (CA) certificate. Over time, Relying Parties (RPs) may have acquired multiple different issuances of valid TA certificates from the same TA operator. This document specifies a tiebreaking scheme to be used by RPs to select one TA certificate for certification path validation. This document updates RFC 8630.]]></description>
        </item>
        <item>
            <title><![CDATA[RFC 10057: A YANG Data Model for Traffic Engineering Tunnels, Label Switched Paths, and Interfaces]]></title>
            <link>https://www.rfc-editor.org/info/rfc10057/</link>
            <guid isPermaLink="true">https://www.rfc-editor.org/info/rfc10057/</guid>
            <pubDate>Wed, 18 Nov 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[This document defines a YANG data model for the provisioning and management of Traffic Engineering (TE) tunnels, Label Switched Paths (LSPs), and interfaces. The model covers data pertinent to TE tunnels, TE LSPs, and TE interfaces that are independent of any technology or data plane encapsulation. The model is divided into two YANG modules that address both device-specific and device-independent data, supporting configuration, operational state, Remote Procedure Calls (RPCs), and event notifications.]]></description>
        </item>
        <item>
            <title><![CDATA[RFC 10056: Common YANG Data Types for Traffic Engineering]]></title>
            <link>https://www.rfc-editor.org/info/rfc10056/</link>
            <guid isPermaLink="true">https://www.rfc-editor.org/info/rfc10056/</guid>
            <pubDate>Wed, 18 Nov 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[<p>This document defines a collection of commonly used Traffic Engineering (TE) specific data types, identities, and groupings in YANG data modeling language. These derived common data types, identities, and groupings are intended to be imported by other modules that model configuration and state for TE constructs, such as TE topologies, TE tunnels, TE policies, TE paths, TE Label Switched Paths (LSPs), and TE interfaces.</p><p>This document obsoletes RFC 8776.</p>]]></description>
        </item>
        <item>
            <title><![CDATA[RFC 10094: Clarifying Segment Routing over IPv6 (SRv6) Segment Identifier (SID) List Processing]]></title>
            <link>https://www.rfc-editor.org/info/rfc10094/</link>
            <guid isPermaLink="true">https://www.rfc-editor.org/info/rfc10094/</guid>
            <pubDate>Tue, 17 Nov 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[<p>Segment Routing over IPv6 (SRv6) is the instantiation of Segment Routing (SR) on the IPv6 data plane. Segments are indicated by Segment Identifiers (SIDs). SRv6 utilizes the Segment Routing Header (SRH), an IPv6 extension header that includes a SID list indicating the sequence of segments and any additional processing to be performed.</p><p>This document updates RFC 8754 by clarifying the processing of SID list entries. It does not change any elements of the SRv6 architecture.</p>]]></description>
        </item>
        <item>
            <title><![CDATA[RFC 10079: Updates to the SFrame Cipher Suites Registry]]></title>
            <link>https://www.rfc-editor.org/info/rfc10079/</link>
            <guid isPermaLink="true">https://www.rfc-editor.org/info/rfc10079/</guid>
            <pubDate>Tue, 17 Nov 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[This document addresses two omissions in the Secure Frame (SFrame) protocol specification. First, the definition of the IANA "SFrame Cipher Suites" registry in RFC 9605 omits several important fields. This document updates the IANA registry by adding those fields and defining the contents of those fields for current entries. Second, the Authenticated Encryption with Associated Data (AEAD) construction based on AES-CTR and HMAC is defined only for the 128-bit security level. This document registers parallel constructions at the 256-bit security level.]]></description>
        </item>
        <item>
            <title><![CDATA[RFC 10091: Extension Registry for the Extensible Provisioning Protocol]]></title>
            <link>https://www.rfc-editor.org/info/rfc10091/</link>
            <guid isPermaLink="true">https://www.rfc-editor.org/info/rfc10091/</guid>
            <pubDate>Mon, 16 Nov 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[The Extensible Provisioning Protocol (EPP) includes features to add functionality by extending the protocol. It does not, however, describe how those extensions are maintained. This document describes a procedure for the registration and management of extensions to EPP, and it specifies a format for an IANA registry to record those extensions. This document obsoletes RFC 7451.]]></description>
        </item>
        <item>
            <title><![CDATA[RFC 10087: Extensible Provisioning Protocol (EPP) Transport over QUIC]]></title>
            <link>https://www.rfc-editor.org/info/rfc10087/</link>
            <guid isPermaLink="true">https://www.rfc-editor.org/info/rfc10087/</guid>
            <pubDate>Mon, 16 Nov 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[<p>This document specifies how an Extensible Provisioning Protocol (EPP)</p><p>session is mapped onto a QUIC connection.  EPP over QUIC (EoQ)</p><p>leverages features of the QUIC protocol.</p>]]></description>
        </item>
        <item>
            <title><![CDATA[RFC 10063: Near Real Time Mirroring (NRTM) Version 4]]></title>
            <link>https://www.rfc-editor.org/info/rfc10063/</link>
            <guid isPermaLink="true">https://www.rfc-editor.org/info/rfc10063/</guid>
            <pubDate>Mon, 16 Nov 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[This document specifies Near Real Time Mirroring version 4 (NRTMv4): a one-way synchronization protocol for Internet Routing Registry (IRR) records. NRTMv4 is based on files that are distributed over HTTPS. The protocol allows instances of IRR Database servers to mirror IRR records, specified in the Routing Policy Specification Language (RPSL), between each other.]]></description>
        </item>
        <item>
            <title><![CDATA[RFC 10082: Composite Module-Lattice-Based Digital Signature Algorithm (ML-DSA) for Use in the Cryptographic Message Syntax (CMS)]]></title>
            <link>https://www.rfc-editor.org/info/rfc10082/</link>
            <guid isPermaLink="true">https://www.rfc-editor.org/info/rfc10082/</guid>
            <pubDate>Sat, 07 Nov 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[The Composite Module-Lattice-Based Digital Signature Algorithm (ML-DSA) defines combinations of ML-DSA with RSA, ECDSA, and EdDSA. This document specifies the conventions for using Composite ML-DSA algorithms within the Cryptographic Message Syntax (CMS).]]></description>
        </item>
        <item>
            <title><![CDATA[RFC 10070: Updates to OAuth 2.0 JSON Web Token (JWT) Client Authentication and Assertion-Based Authorization Grants]]></title>
            <link>https://www.rfc-editor.org/info/rfc10070/</link>
            <guid isPermaLink="true">https://www.rfc-editor.org/info/rfc10070/</guid>
            <pubDate>Sat, 07 Nov 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[This document updates RFCs 7521, 7522, 7523, and 9126 with respect to the treatment of audience values in OAuth 2.0 Client Assertion Authentication and Assertion-based Authorization Grants to address a security vulnerability identified in the previous requirements for those audience values in multiple OAuth 2.0 specifications.]]></description>
        </item>
        <item>
            <title><![CDATA[RFC 10069: Managing Multiple Paths for a QUIC Connection]]></title>
            <link>https://www.rfc-editor.org/info/rfc10069/</link>
            <guid isPermaLink="true">https://www.rfc-editor.org/info/rfc10069/</guid>
            <pubDate>Sat, 07 Nov 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[<p>This document specifies a multipath extension for the QUIC protocol</p><p>to enable the simultaneous usage of multiple paths for a single</p><p>connection.  It introduces explicit path identifiers to create,</p><p>delete, and manage multiple paths.  This document does not specify</p><p>address discovery or management, nor how applications using QUIC</p><p>schedule traffic over multiple paths.</p>]]></description>
        </item>
        <item>
            <title><![CDATA[RFC 10073: Composite Module-Lattice-Based Digital Signature Algorithm (ML-DSA) for Use in X.509 Public Key Infrastructure]]></title>
            <link>https://www.rfc-editor.org/info/rfc10073/</link>
            <guid isPermaLink="true">https://www.rfc-editor.org/info/rfc10073/</guid>
            <pubDate>Fri, 06 Nov 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[This document defines a PQ/T hybrid scheme with concrete instantiations that combine the US NIST Module-Lattice-Based Digital Signature Algorithm (ML-DSA) with traditional algorithms RSASSA-PKCS1-v1_5, RSASSA-PSS, ECDSA, Ed25519, and Ed448. These combinations are tailored to meet regulatory guidelines in certain regions. Composite ML-DSA is applicable in applications that use X.509 or PKIX data structures that accept ML-DSA, but where the operator wants extra protection against breaks or catastrophic bugs in ML-DSA and where the level of security provided by Existential Unforgeability under Chosen Message Attack (EUF-CMA) is acceptable.]]></description>
        </item>
        <item>
            <title><![CDATA[RFC 10080: Updated Use of the Expires Message Header Field]]></title>
            <link>https://www.rfc-editor.org/info/rfc10080/</link>
            <guid isPermaLink="true">https://www.rfc-editor.org/info/rfc10080/</guid>
            <pubDate>Fri, 30 Oct 2026 00:00:00 GMT</pubDate>
            <description><![CDATA[This document allows broader use of the "Expires" message header field for mail messages. Message creators can then indicate when a message expires, while recipients can use this information to handle an expired message differently.]]></description>
        </item>
    </channel>
</rss>