rfc5106.The Extensible Authentication Protocol-Internet Key Exchange Protocol version 2 (EAP-IKEv2)

合集下载

SMTP错误码

SMTP错误码

错误总表420 1. T imeout Communication Problem Encountered DuringTransmission. Thie Is a Novell Groupwise Smtp Error 2. TcpRead Error 3. Tcp Write Error在联机时发生通讯中断的问题;Novell GroupW iseSMTP服务器的错误讯息此错误讯息只适用于Novell GroupW ise SMTP服务器,在此不多做赘述。

N/A421 1. Service Not Available, Closing Transmission Channel [thisMay Be a Reply To Any Command If the Service Knows It MustShut Down] 2. Service Not Available - the Sending EmailProgram Should Try Again Later括号内的主机无法提供正常的邮件服务,关闭传送管道,邮件将滞留在主机上收信者端邮件服务器暂时无法上线。

请收信者和邮件管理者确认收信端邮件服务器是否正常作业,通常是由于邮递员停机做问题的检测或是邮件服务器正在重开机中又或是服务器正在同时间处理大量的新进邮件或新进要求。

这类情形不会持续太久,若能晚点在尝试发送,也许问题已经解决。

请注意的是:这里指的邮件服务器可能是邮件发送途中的任何一台邮件服务器。

若是这种情形发生的太过于频繁,则需要与邮递员讨论。

421 1. the Smtp Service/server You Use Has a Limit On theNumber of Concurrent Smtp Streams Your Server Can Use 2.Too Many Concurrent Smtp Connections From This IpAddress; Please Try Again Later收件者SMTP 主机拒绝提供服务,因为已经超过其能提供的最大服务量SMTP 主机最大联机数量已达稍后再试422 The Recipient's Mailbox Is Over Its Storage Limit收信者邮件信箱的信件已经超过允许的最大容量可能收信者信箱被塞满1. 请收信者整理邮件信箱2. 请收信者通知邮递员加大信箱空间422 The Size of the Message Exceeds the Recipient's Size LimitsFor Incoming Emails邮件大小超过收信端邮件信箱的单次收信大小邮件大小超过收信端邮件信箱的单次收信大小。

insufficientauthenticationexception类 -回复

insufficientauthenticationexception类 -回复

insufficientauthenticationexception类-回复什么是InsufficientAuthenticationException类?在计算机编程中,InsufficientAuthenticationException类是指在认证过程中出现的异常情况。

这个异常类通常用于表示认证过程中存在不足的身份验证信息或权限不足的情况。

它是由许多编程语言和框架中所提供的安全认证机制中的一部分,为开发人员提供了一种捕获和处理认证异常的方法。

为什么会出现InsufficientAuthenticationException类?InsufficientAuthenticationException类通常在以下情况下出现:1. 用户认证信息不完整:当用户提供的认证信息不完整时,系统可能会抛出InsufficientAuthenticationException异常。

例如,用户只提供了用户名,但没有提供密码或其他必要的认证信息。

在这种情况下,系统无法对用户进行完整的身份验证,并且可能会抛出异常。

2. 权限不足:有些系统可能要求用户在通过某些操作之前进行特定的权限验证。

如果用户没有足够的权限执行所需的操作,系统可能会抛出InsufficientAuthenticationException异常。

例如,用户尝试执行需要管理员权限的操作,但是用户只具有普通用户权限,则系统可能会抛出异常。

3. 多因素认证失败:某些系统可能采用多因素认证来提高安全性。

这意味着用户需要提供多个认证因素,如密码、指纹、短信验证码等。

如果用户无法提供足够的认证因素,系统可能会抛出InsufficientAuthenticationException异常。

如何处理InsufficientAuthenticationException类?处理InsufficientAuthenticationException异常通常需要以下步骤:1. 捕获异常:在代码中使用try-catch语句块,将可能引发InsufficientAuthenticationException异常的代码放入try块中,并在catch块中捕获该异常。

insufficientauthenticationexception类 -回复

insufficientauthenticationexception类 -回复

insufficientauthenticationexception类-回复什么是InsufficientAuthenticationException类?如何处理该异常?InsufficientAuthenticationException类是Spring Security框架中的一个异常类,它表示在对系统资源进行访问时,当前认证的主体身份认证不足,导致访问被拒绝的情况。

该异常通常发生在用户操作需要更高级别权限或者更强的身份认证时。

Spring Security框架是基于Spring框架的安全认证和授权解决方案,它提供了一套完善的身份认证和授权机制,以保护应用程序中的资源不受未授权的访问。

在实际的开发过程中,我们通常使用Spring Security框架来处理用户身份验证和授权,并且使用其提供的各种异常来处理不同的安全问题。

InsufficientAuthenticationException类的出现代表着当前用户的身份认证程度不足以满足访问所需的权限要求。

这可能是因为用户身份认证信息错误、缺失或者过期导致的。

为了确保系统的安全性,不允许未经身份验证的用户访问受保护的资源,因此当发生InsufficientAuthenticationException异常时,我们需要采取相应的措施进行处理。

以下是一步一步回答如何处理InsufficientAuthenticationException类的异常的方法:1. 检查用户身份认证信息:首先,我们需要检查用户的身份认证信息是否正确、完整和有效。

这包括检查用户名、密码、角色等认证信息是否与系统中存储的信息一致,以及认证令牌是否已过期。

可以通过审查用户提供的身份凭证,比对数据库中的存储信息来实现,或者使用Spring Security 提供的内置机制。

2. 更新身份认证信息:如果用户提供的身份认证信息错误或过期,我们需要更新其认证信息。

这可能包括重置密码、更新角色或延长认证令牌的有效期。

RFC 2026

RFC 2026

Network Working Group T. HowesRequest for Comments: 2254 Netscape Communications Corp. Category: Standards Track December 1997The String Representation of LDAP Search Filters1. Status of this MemoThis document specifies an Internet standards track protocol for the Internet community, and requests discussion and suggestions forimprovements. Please refer to the current edition of the "Internet Official Protocol Standards" (STD 1) for the standardization state and status of this protocol. Distribution of this memo is unlimited.Copyright NoticeCopyright (C) The Internet Society (1997). All Rights Reserved. IESG NoteThis document describes a directory access protocol that provides both read and update access. Update access requires secureauthentication, but this document does not mandate implementation of any satisfactory authentication mechanisms.In accordance with RFC 2026, section 4.4.1, this specification is being approved by IESG as a Proposed Standard despite thislimitation, for the following reasons:a. to encourage implementation and interoperability testing ofthese protocols (with or without update access) before theyare deployed, andb. to encourage deployment and use of these protocols in read-only applications. (e.g. applications where LDAPv3 is used asa query language for directories which are updated by somesecure mechanism other than LDAP), andc. to avoid delaying the advancement and deployment of other Internet standards-track protocols which require the ability to query, but not update, LDAPv3 directory servers.Howes Standards Track [Page 1]RFC 2254 String Representation of LDAP December 1997Readers are hereby warned that until mandatory authenticationmechanisms are standardized, clients and servers written according to this specification which make use of update functionality areUNLIKELY TO INTEROPERATE, or MAY INTEROPERATE ONLY IF AUTHENTICATION IS REDUCED TO AN UNACCEPTABLY WEAK LEVEL.Implementors are hereby discouraged from deploying LDAPv3 clients or servers which implement the update functionality, until a Proposed Standard for mandatory authentication in LDAPv3 has been approved and published as an RFC.2. AbstractThe Lightweight Directory Access Protocol (LDAP) [1] defines anetwork representation of a search filter transmitted to an LDAP server. Some applications may find it useful to have a common way of representing these search filters in a human-readable form. This document defines a human-readable string format for representing LDAP search filters.This document replaces RFC 1960, extending the string LDAP filter definition to include support for LDAP version 3 extended matchfilters, and including support for representing the full range ofpossible LDAP search filters.Howes Standards Track [Page 2]RFC 2254 String Representation of LDAP December 19973. LDAP Search Filter DefinitionAn LDAPv3 search filter is defined in Section 4.5.1 of [1] asfollows:Filter ::= CHOICE {and [0] SET OF Filter,or [1] SET OF Filter,not [2] Filter,equalityMatch [3] AttributeValueAssertion,substrings [4] SubstringFilter,greaterOrEqual [5] AttributeValueAssertion,lessOrEqual [6] AttributeValueAssertion,present [7] AttributeDescription,approxMatch [8] AttributeValueAssertion,extensibleMatch [9] MatchingRuleAssertion}SubstringFilter ::= SEQUENCE {type AttributeDescription,SEQUENCE OF CHOICE {initial [0] LDAPString,any [1] LDAPString,final [2] LDAPString}}AttributeValueAssertion ::= SEQUENCE {attributeDesc AttributeDescription,attributeValue AttributeValue}MatchingRuleAssertion ::= SEQUENCE {matchingRule [1] MatchingRuleID OPTIONAL,type [2] AttributeDescription OPTIONAL,matchValue [3] AssertionValue,dnAttributes [4] BOOLEAN DEFAULT FALSE}AttributeDescription ::= LDAPStringAttributeValue ::= OCTET STRINGMatchingRuleID ::= LDAPStringAssertionValue ::= OCTET STRINGLDAPString ::= OCTET STRINGHowes Standards Track [Page 3]RFC 2254 String Representation of LDAP December 1997where the LDAPString above is limited to the UTF-8 encoding of the ISO 10646 character set [4]. The AttributeDescription is a string representation of the attribute description and is defined in [1]. The AttributeValue and AssertionValue OCTET STRING have the form defined in [2]. The Filter is encoded for transmission over anetwork using the Basic Encoding Rules defined in [3], withsimplifications described in [1].4. String Search Filter DefinitionThe string representation of an LDAP search filter is defined by the following grammar, following the ABNF notation defined in [5]. The filter format uses a prefix notation.filter = "(" filtercomp ")"filtercomp = and / or / not / itemand = "&" filterlistor = "|" filterlistnot = "!" filterfilterlist = 1*filteritem = simple / present / substring / extensiblesimple = attr filtertype valuefiltertype = equal / approx / greater / lessequal = "="approx = "~="greater = ">="less = "<="extensible = attr [":dn"] [":" matchingrule] ":=" value/ [":dn"] ":" matchingrule ":=" valuepresent = attr "=*"substring = attr "=" [initial] any [final]initial = valueany = "*" *(value "*")final = valueattr = AttributeDescription from Section 4.1.5 of [1] matchingrule = MatchingRuleId from Section 4.1.9 of [1]value = AttributeValue from Section 4.1.6 of [1]The attr, matchingrule, and value constructs are as described in thecorresponding section of [1] given above.Howes Standards Track [Page 4]RFC 2254 String Representation of LDAP December 1997If a value should contain any of the following charactersCharacter ASCII value---------------------------* 0x2a( 0x28) 0x29\ 0x5cNUL 0x00the character must be encoded as the backslash '\' character (ASCII 0x5c) followed by the two hexadecimal digits representing the ASCII value of the encoded character. The case of the two hexadecimaldigits is not significant.This simple escaping mechanism eliminates filter-parsing ambiguities and allows any filter that can be represented in LDAP to berepresented as a NUL-terminated string. Other characters besides the ones listed above may be escaped using this mechanism, for example, non-printing characters.For example, the filter checking whether the "cn" attribute contained a value with the character "*" anywhere in it would be represented as "(cn=*\2a*)".Note that although both the substring and present productions in the grammar above can produce the "attr=*" construct, this construct is used only to denote a presence filter.5. ExamplesThis section gives a few examples of search filters written using this notation.(cn=Babs Jensen)(!(cn=Tim Howes))(&(objectClass=Person)(|(sn=Jensen)(cn=Babs J*)))(o=univ*of*mich*)The following examples illustrate the use of extensible matching.(cn:1.2.3.4.5:=Fred Flintstone)(sn:dn:2.4.6.8.10:=Barney Rubble)(o:dn:=Ace Industry)(:dn:2.4.6.8.10:=Dino)Howes Standards Track [Page 5]RFC 2254 String Representation of LDAP December 1997The second example illustrates the use of the ":dn" notation toindicate that matching rule "2.4.6.8.10" should be used when making comparisons, and that the attributes of an entry's distinguished name should be considered part of the entry when evaluating the match.The third example denotes an equality match, except that DNcomponents should be considered part of the entry when doing the match.The fourth example is a filter that should be applied to anyattribute supporting the matching rule given (since the attr has beenleft off). Attributes supporting the matching rule contained in the DN should also be considered.The following examples illustrate the use of the escaping mechanism.(o=Parens R Us \28for all your parenthetical needs\29)(cn=*\2A*)(filename=C:\5cMyFile)(bin=\00\00\00\04)(sn=Lu\c4\8di\c4\87)The first example shows the use of the escaping mechanism torepresent parenthesis characters. The second shows how to represent a"*" in a value, preventing it from being interpreted as a substring indicator. The third illustrates the escaping of the backslashcharacter.The fourth example shows a filter searching for the four-byte value 0x00000004, illustrating the use of the escaping mechanism torepresent arbitrary data, including NUL characters.The final example illustrates the use of the escaping mechanism to represent various non-ASCII UTF-8 characters.6. Security ConsiderationsThis memo describes a string representation of LDAP search filters. While the representation itself has no known security implications, LDAP search filters do. They are interpreted by LDAP servers toselect entries from which data is retrieved. LDAP servers should take care to protect the data they maintain from unauthorized access.Howes Standards Track [Page 6]RFC 2254 String Representation of LDAP December 19977. References[1] Wahl, M., Howes, T., and S. Kille, "Lightweight Directory Access Protocol (v3)", RFC 2251, December 1997.[2] Wahl, M., Coulbeck, A., Howes, T., and S. Kille, "Lightweight Directory Access Protocol (v3): Attribute Syntax Definitions", RFC 2252, December 1997.[3] Specification of ASN.1 encoding rules: Basic, Canonical, and Distinguished Encoding Rules, ITU-T Recommendation X.690, 1994.[4] Yergeau, F., "UTF-8, a transformation format of Unicode and ISO 10646", RFC 2044, October 1996.[5] Crocker, D., "Standard for the Format of ARPA Internet TextMessages", STD 11, RFC 822, August 1982.8. Author's AddressTim HowesNetscape Communications Corp.501 E. Middlefield RoadMountain View, CA 94043USAPhone: +1 415 937-3419EMail: howes@Howes Standards Track [Page 7]RFC 2254 String Representation of LDAP December 19979. Full Copyright StatementCopyright (C) The Internet Society (1997). All Rights Reserved.This document and translations of it may be copied and furnished to others, and derivative works that comment on or otherwise explain it or assist in its implementation may be prepared, copied, published and distributed, in whole or in part, without restriction of any kind, provided that the above copyright notice and this paragraph are included on all such copies and derivative works. However, this document itself may not be modified in any way, such as by removing the copyright notice or references to the Internet Society or other Internet organizations, except as needed for the purpose ofdeveloping Internet standards in which case the procedures forcopyrights defined in the Internet Standards process must befollowed, or as required to translate it into languages other than English.The limited permissions granted above are perpetual and will not be revoked by the Internet Society or its successors or assigns.This document and the information contained herein is provided on an "AS IS" basis and THE INTERNET SOCIETY AND THE INTERNET ENGINEERING TASK FORCE DISCLAIMS ALL WARRANTIES, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF THE INFORMATIONHEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED WARRANTIES OFMERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.Howes Standards Track [Page 8]。

rfc5116.An Interface and Algorithms for Authenticated Encryption

rfc5116.An Interface and Algorithms for Authenticated Encryption

Network Working Group D. McGrew Request for Comments: 5116 Cisco Systems, Inc. Category: Standards Track January 2008 An Interface and Algorithms for Authenticated EncryptionStatus of This MemoThis document specifies an Internet standards track protocol for the Internet community, and requests discussion and suggestions forimprovements. Please refer to the current edition of the "InternetOfficial Protocol Standards" (STD 1) for the standardization stateand status of this protocol. Distribution of this memo is unlimited. AbstractThis document defines algorithms for Authenticated Encryption withAssociated Data (AEAD), and defines a uniform interface and aregistry for such algorithms. The interface and registry can be used as an application-independent set of cryptoalgorithm suites. Thisapproach provides advantages in efficiency and security, and promotes the reuse of crypto implementations.McGrew Standards Track [Page 1]Table of Contents1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1. Background . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2. Scope . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.3. Benefits . . . . . . . . . . . . . . . . . . . . . . . . . 41.4. Conventions Used in This Document . . . . . . . . . . . . 42. AEAD Interface . . . . . . . . . . . . . . . . . . . . . . . . 5 2.1. Authenticated Encryption . . . . . . . . . . . . . . . . . 5 2.2. Authenticated Decryption . . . . . . . . . . . . . . . . . 72.3. Data Formatting . . . . . . . . . . . . . . . . . . . . . 73. Guidance on the Use of AEAD Algorithms . . . . . . . . . . . . 8 3.1. Requirements on Nonce Generation . . . . . . . . . . . . . 8 3.2. Recommended Nonce Formation . . . . . . . . . . . . . . . 9 3.2.1. Partially Implicit Nonces . . . . . . . . . . . . . . 10 3.3. Construction of AEAD Inputs . . . . . . . . . . . . . . . 113.4. Example Usage . . . . . . . . . . . . . . . . . . . . . . 114. Requirements on AEAD Algorithm Specifications . . . . . . . . 125. AEAD Algorithms . . . . . . . . . . . . . . . . . . . . . . . 14 5.1. AEAD_AES_128_GCM . . . . . . . . . . . . . . . . . . . . . 14 5.1.1. Nonce Reuse . . . . . . . . . . . . . . . . . . . . . 14 5.2. AEAD_AES_256_GCM . . . . . . . . . . . . . . . . . . . . . 15 5.3. AEAD_AES_128_CCM . . . . . . . . . . . . . . . . . . . . . 15 5.3.1. Nonce Reuse . . . . . . . . . . . . . . . . . . . . . 165.4. AEAD_AES_256_CCM . . . . . . . . . . . . . . . . . . . . . 166. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 167. Other Considerations . . . . . . . . . . . . . . . . . . . . . 178. Security Considerations . . . . . . . . . . . . . . . . . . . 189. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 1810. References . . . . . . . . . . . . . . . . . . . . . . . . . . 19 10.1. Normative References . . . . . . . . . . . . . . . . . . . 19 10.2. Informative References . . . . . . . . . . . . . . . . . . 19 McGrew Standards Track [Page 2]1. IntroductionAuthenticated encryption [BN00] is a form of encryption that, inaddition to providing confidentiality for the plaintext that isencrypted, provides a way to check its integrity and authenticity.Authenticated Encryption with Associated Data, or AEAD [R02], addsthe ability to check the integrity and authenticity of someAssociated Data (AD), also called "additional authenticated data",that is not encrypted.1.1. BackgroundMany cryptographic applications require both confidentiality andmessage authentication. Confidentiality is a security service thatensures that data is available only to those authorized to obtain it; usually it is realized through encryption. Message authentication is the service that ensures that data has not been altered or forged by unauthorized entities; it can be achieved by using a MessageAuthentication Code (MAC). This service is also called dataintegrity. Many applications use an encryption method and a MACtogether to provide both of those security services, with eachalgorithm using an independent key. More recently, the idea ofproviding both security services using a single cryptoalgorithm hasbecome accepted. In this concept, the cipher and MAC are replaced by an Authenticated Encryption with Associated Data (AEAD) algorithm.Several crypto algorithms that implement AEAD algorithms have beendefined, including block cipher modes of operation and dedicatedalgorithms. Some of these algorithms have been adopted and provenuseful in practice. Additionally, AEAD is close to an ’idealized’view of encryption, such as those used in the automated analysis ofcryptographic protocols (see, for example, Section 2.5 of [BOYD]).The benefits of AEAD algorithms, and this interface, are outlined in Section 1.3.1.2. ScopeIn this document, we define an AEAD algorithm as an abstraction, byspecifying an interface to an AEAD and defining an IANA registry for AEAD algorithms. We populate this registry with four AEAD algorithms based on the Advanced Encryption Standard (AES) in Galois/CounterMode [GCM] with 128- and 256-bit keys, and AES in Counter and CBC MAC Mode [CCM] with 128- and 256-bit keys.In the following, we define the AEAD interface (Section 2), and then provide guidance on the use of AEAD algorithms (Section 3), andoutline the requirements that each AEAD algorithm must meetMcGrew Standards Track [Page 3](Section 4). Then we define several AEAD algorithms (Section 5), and establish an IANA registry for AEAD algorithms (Section 6). Lastly, we discuss some other considerations (Section 7).The AEAD interface specification does not address security protocolissues such as anti-replay services or access control decisions that are made on authenticated data. Instead, the specification aims toabstract the cryptography away from those issues. The interface, and the guidance about how to use it, are consistent with therecommendations from [EEM04].1.3. BenefitsThe AEAD approach enables applications that need cryptographicsecurity services to more easily adopt those services. It benefitsthe application designer by allowing them to focus on importantissues such as security services, canonicalization, and datamarshaling, and relieving them of the need to design cryptomechanisms that meet their security goals. Importantly, the security of an AEAD algorithm can be analyzed independent from its use in aparticular application. This property frees the user of the AEAD of the need to consider security aspects such as the relative order ofauthentication and encryption and the security of the particularcombination of cipher and MAC, such as the potential loss ofconfidentiality through the MAC. The application designer that uses the AEAD interface need not select a particular AEAD algorithm during the design stage. Additionally, the interface to the AEAD isrelatively simple, since it requires only a single key as input andrequires only a single identifier to indicate the algorithm in use in a particular case.The AEAD approach benefits the implementer of the crypto algorithmsby making available optimizations that are otherwise not possible to reduce the amount of computation, the implementation cost, and/or the storage requirements. The simpler interface makes testing easier;this is a considerable benefit for a crypto algorithm implementation. By providing a uniform interface to access cryptographic services,the AEAD approach allows a single crypto implementation to moreeasily support multiple applications. For example, a hardware module that supports the AEAD interface can easily provide cryptoacceleration to any application using that interface, even toapplications that had not been designed when the module was built.1.4. Conventions Used in This DocumentThe key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT","SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in [RFC2119].McGrew Standards Track [Page 4]2. AEAD InterfaceAn AEAD algorithm has two operations, authenticated encryption andauthenticated decryption. The inputs and outputs of these algorithms are defined below in terms of octet strings.An implementation MAY accept additional inputs. For example, aninput could be provided to allow the user to select between different implementation strategies. However, such extensions MUST NOT affect interoperability with other implementations.2.1. Authenticated EncryptionThe authenticated encryption operation has four inputs, each of which is an octet string:A secret key K, which MUST be generated in a way that is uniformly random or pseudorandom.A nonce N. Each nonce provided to distinct invocations of theAuthenticated Encryption operation MUST be distinct, for anyparticular value of the key, unless each and every nonce is zero- length. Applications that can generate distinct nonces SHOULD use the nonce formation method defined in Section 3.2, and MAY use any other method that meets the uniqueness requirement. Otherapplications SHOULD use zero-length nonces.A plaintext P, which contains the data to be encrypted andauthenticated.The associated data A, which contains the data to beauthenticated, but not encrypted.There is a single output:A ciphertext C, which is at least as long as the plaintext, oran indication that the requested encryption operation could not be performed.All of the inputs and outputs are variable-length octet strings,whose lengths obey the following restrictions:The number of octets in the key K is between 1 and 255. For each AEAD algorithm, the length of K MUST be fixed.McGrew Standards Track [Page 5]For any particular value of the key, either 1) each nonce provided to distinct invocations of the Authenticated Encryption operation MUST be distinct, or 2) each and every nonce MUST be zero-length. If zero-length nonces are used with a particular key, then eachand every nonce used with that key MUST have a length of zero.Otherwise, the number of octets in the nonce SHOULD be twelve(12). Nonces with different lengths MAY be used with a particular key. Some algorithms cannot be used with zero-length nonces, but others can; see Section 4. Applications that conform to therecommended nonce length will avoid having to construct nonceswith different lengths, depending on the algorithm that is in use. This guidance helps to keep algorithm-specific logic out ofapplications.The number of octets in the plaintext P MAY be zero.The number of octets in the associated data A MAY be zero.The number of octets in the ciphertext C MAY be zero.This specification does not put a maximum length on the nonce, theplaintext, the ciphertext, or the additional authenticated data.However, a particular AEAD algorithm MAY further restrict the lengths of those inputs and outputs. A particular AEAD implementation MAYfurther restrict the lengths of its inputs and outputs. If aparticular implementation of an AEAD algorithm is requested toprocess an input that is outside the range of admissible lengths, or an input that is outside the range of lengths supported by thatimplementation, it MUST return an error code and it MUST NOT outputany other information. In particular, partially encrypted orpartially decrypted data MUST NOT be returned.Both confidentiality and message authentication are provided on theplaintext P. When the length of P is zero, the AEAD algorithm actsas a Message Authentication Code on the input A.The associated data A is used to protect information that needs to be authenticated, but does not need to be kept confidential. When using an AEAD to secure a network protocol, for example, this input couldinclude addresses, ports, sequence numbers, protocol version numbers, and other fields that indicate how the plaintext or ciphertext should be handled, forwarded, or processed. In many situations, it isdesirable to authenticate these fields, though they must be left inthe clear to allow the network or system to function properly. When this data is included in the input A, authentication is providedwithout copying the data into the plaintext.McGrew Standards Track [Page 6]The secret key K MUST NOT be included in any of the other inputs (N, P, and A). (This restriction does not mean that the values of those inputs must be checked to ensure that they do not include substrings that match the key; instead, it means that the key must not beexplicitly copied into those inputs.)The nonce is authenticated internally to the algorithm, and it is not necessary to include it in the AD input. The nonce MAY be includedin P or A if it is convenient to the application.The nonce MAY be stored or transported with the ciphertext, or it MAY be reconstructed immediately prior to the authenticated decryptionoperation. It is sufficient to provide the decryption module withenough information to allow it to construct the nonce. (For example, a system could use a nonce consisting of a sequence number in aparticular format, in which case it could be inferred from the order of the ciphertexts.) Because the authenticated decryption processdetects incorrect nonce values, no security failure will result if a nonce is incorrectly reconstructed and fed into an authenticateddecryption operation. Any nonce reconstruction method will need totake into account the possibility of loss or reorder of ciphertextsbetween the encryption and decryption processes.Applications MUST NOT assume any particular structure or formattingof the ciphertext.2.2. Authenticated DecryptionThe authenticated decryption operation has four inputs: K, N, A, and C, as defined above. It has only a single output, either a plaintext value P or a special symbol FAIL that indicates that the inputs arenot authentic. A ciphertext C, a nonce N, and associated data A are authentic for key K when C is generated by the encrypt operation with inputs K, N, P, and A, for some values of N, P, and A. Theauthenticated decrypt operation will, with high probability, returnFAIL whenever the inputs N, P, and A were crafted by a nonce-respecting adversary that does not know the secret key (assuming that the AEAD algorithm is secure).2.3. Data FormattingThis document does not specify any particular encoding for the AEADinputs and outputs, since the encoding does not affect the securityservices provided by an AEAD algorithm.When choosing the format of application data, an application SHOULDposition the ciphertext C so that it appears after any other datathat is needed to construct the other inputs to the authenticated McGrew Standards Track [Page 7]decryption operation. For instance, if the nonce and ciphertext both appear in a packet, the former value should precede the latter. This rule facilitates efficient and simple hardware implementations ofAEAD algorithms.3. Guidance on the Use of AEAD AlgorithmsThis section provides advice that must be followed in order to use an AEAD algorithm securely.If an application is unable to meet the uniqueness requirement onnonce generation, then it MUST use a zero-length nonce. Randomizedor stateful algorithms, which are defined below, are suitable for use with such applications. Otherwise, an application SHOULD use nonces with a length of twelve octets. Since algorithms are encouraged tosupport that length, applications should use that length to aidinteroperability.3.1. Requirements on Nonce GenerationIt is essential for security that the nonces be constructed in amanner that respects the requirement that each nonce value bedistinct for each invocation of the authenticated encryptionoperation, for any fixed value of the key. In this section, we call attention to some consequences of this requirement in differentscenarios.When there are multiple devices performing encryption using a single key, those devices must coordinate to ensure that the nonces areunique. A simple way to do this is to use a nonce format thatcontains a field that is distinct for each one of the devices, asdescribed in Section 3.2. Note that there is no need to coordinatethe details of the nonce format between the encrypter and thedecrypter, as long the entire nonce is sent or stored with theciphertext and is thus available to the decrypter. If the completenonce is not available to the decrypter, then the decrypter will need to know how the nonce is structured so that it can reconstruct it.Applications SHOULD provide encryption engines with some freedom inchoosing their nonces; for example, a nonce could contain both acounter and a field that is set by the encrypter but is not processed by the receiver. This freedom allows a set of encryption devices to more readily coordinate to ensure the distinctness of their nonces.If a secret key will be used for a long period of time, e.g., across multiple reboots, then the nonce will need to be stored in non-volatile memory. In such cases, it is essential to use checkpointing of the nonce; that is, the current nonce value should be stored toprovide the state information needed to resume encryption in case of McGrew Standards Track [Page 8]unexpected failure. One simple way to provide a high assurance that a nonce value will not be used repeatedly is to wait until theencryption process receives confirmation from the storage processindicating that the succeeding nonce value has already been stored.Because this method may add significant latency, it may be desirable to store a nonce value that is several values ahead in the sequence. As an example, the nonce 100 could be stored, after which the nonces 1 through 99 could be used for encryption. The nonce value 200 could be stored at the same time that nonces 1 through 99 are being used,and so on.Many problems with nonce reuse can be avoided by changing a key in a situation in which nonce coordination is difficult.Each AEAD algorithm SHOULD describe what security degradation wouldresult from an inadvertent reuse of a nonce value.3.2. Recommended Nonce FormationThe following method to construct nonces is RECOMMENDED. The nonceis formatted as illustrated in Figure 1, with the initial octetsconsisting of a Fixed field, and the final octets consisting of aCounter field. For each fixed key, the length of each of thesefields, and thus the length of the nonce, is fixed. Implementations SHOULD support 12-octet nonces in which the Counter field is fouroctets long.<----- variable ----> <----------- variable ----------->+---------------------+----------------------------------+| Fixed | Counter |+---------------------+----------------------------------+Figure 1: Recommended nonce formatThe Counter fields of successive nonces form a monotonicallyincreasing sequence, when those fields are regarded as unsignedintegers in network byte order. The length of the Counter field MUST remain constant for all nonces that are generated for a givenencryption device. The Counter part SHOULD be equal to zero for the first nonce, and increment by one for each successive nonce that isgenerated. However, any particular Counter value MAY be skippedover, and left out of the sequence of values that are used, if it is convenient. For example, an application could choose to skip theinitial Counter=0 value, and set the Counter field of the initialnonce to 1. Thus, at most 2^(8*C) nonces can be generated when theCounter field is C octets in length.McGrew Standards Track [Page 9]The Fixed field MUST remain constant for all nonces that aregenerated for a given encryption device. If different devices areperforming encryption with a single key, then each distinct deviceMUST use a distinct Fixed field, to ensure the uniqueness of thenonces. Thus, at most 2^(8*F) distinct encrypters can share a keywhen the Fixed field is F octets in length.3.2.1. Partially Implicit NoncesIn some cases, it is desirable to not transmit or store an entirenonce, but instead to reconstruct that value from contextualinformation immediately prior to decryption. As an example,ciphertexts could be stored in sequence on a disk, and the nonce for a particular ciphertext could be inferred from its location, as long as the rule for generating the nonces is known by the decrypter. We call the portion of the nonce that is stored or sent with theciphertext the explicit part. We call the portion of the nonce that is inferred the implicit part. When part of the nonce is implicit,the following specialization of the above format is RECOMMENDED. The Fixed field is divided into two sub-fields: a Fixed-Common field and a Fixed-Distinct field. This format is shown in Figure 2. Ifdifferent devices are performing encryption with a single key, theneach distinct device MUST use a distinct Fixed-Distinct field. TheFixed-Common field is common to all nonces. The Fixed-Distinct field and the Counter field MUST be in the explicit part of the nonce. The Fixed-Common field MAY be in the implicit part of the nonce. Theseconventions ensure that the nonce is easy to reconstruct from theexplicit data.+-------------------+--------------------+---------------+| Fixed-Common | Fixed-Distinct | Counter |+-------------------+--------------------+---------------+<---- implicit ---> <------------ explicit ------------>Figure 2: Partially implicit nonce formatThe rationale for the partially implicit nonce format is asfollows. This method of nonce construction incorporates the best known practice; it is used by both GCM Encapuslating SecurityPayload (ESP) [RFC4106] and CCM ESP [RFC4309], in which the Fixed field contains the Salt value and the lowest eight octets of thenonce are explicitly carried in the ESP packet. In GCM ESP, theFixed field must be at least four octets long, so that it cancontain the Salt value. In CCM ESP, the Fixed field must be atleast three octets long for the same reason. This noncegeneration method is also used by several counter mode variantsincluding CTR ESP.McGrew Standards Track [Page 10]3.3. Construction of AEAD InputsIf the AD input is constructed out of multiple data elements, then it is essential that it be unambiguously parseable into its constituent elements, without the use of any unauthenticated data in the parsing process. (In mathematical terms, the AD input must be an injectivefunction of the data elements.) If an application constructs its AD input in such a way that there are two distinct sets of data elements that result in the same AD value, then an attacker could cause areceiver to accept a bogus set by substituting one set for the other. The requirement that the AD be uniquely parseable ensures that thisattack is not possible. This requirement is trivially met if the AD is composed of fixed-width elements. If the AD contains a variable- length string, for example, this requirement can be met by alsoincluding the length of the string in the AD.Similarly, if the plaintext is constructed out of multiple dataelements, then it is essential that it be unambiguously parseableinto its constituent elements, without using any unauthenticated data in the parsing process. Note that data included in the AD may beused when parsing the plaintext, though of course since the AD is not encrypted there is a potential loss of confidentiality wheninformation about the plaintext is included in the AD.3.4. Example UsageTo make use of an AEAD algorithm, an application must define how the encryption algorithm’s inputs are defined in terms of applicationdata, and how the ciphertext and nonce are conveyed. The clearestway to do this is to express each input in terms of the data thatform it, then to express the application data in terms of the outputs of the AEAD encryption operation.For example, AES-GCM ESP [RFC4106] can be expressed as follows. The AEAD inputs areP = RestOfPayloadData || TFCpadding || Padding || PadLength ||NextHeaderN = Salt || IVA = SPI || SequenceNumberwhere the symbol "||" denotes the concatenation operation, and thefields RestOfPayloadData, TFCpadding, Padding, PadLength, NextHeader, SPI, and SequenceNumber are as defined in [RFC4303], and the fieldsSalt and IV are as defined in [RFC4106]. The field RestOfPayloadData contains the plaintext data that is described by the NextHeader McGrew Standards Track [Page 11]field, and no other data. (Recall that the PayloadData fieldcontains both the IV and the RestOfPayloadData; see Figure 2 of[RFC4303] for an illustration.)The format of the ESP packet can be expressed asESP = SPI || SequenceNumber || IV || Cwhere C is the AEAD ciphertext (which in this case incorporates theauthentication tag). Please note that here we have not described the use of the ESP Extended Sequence Number.4. Requirements on AEAD Algorithm SpecificationsEach AEAD algorithm MUST only accept keys with a fixed key lengthK_LEN, and MUST NOT require any particular data format for the keysprovided as input. An algorithm that requires such structure (e.g., one with subkeys in a particular parity-check format) will need toprovide it internally.Each AEAD algorithm MUST accept any plaintext with a length betweenzero and P_MAX octets, inclusive, where the value P_MAX is specificto that algorithm. The value of P_MAX MUST be larger than zero, and SHOULD be at least 65,536 (2^16) octets. This size is a typicalupper limit for network data packets. Other applications may useeven larger values of P_MAX, so it is desirable for general-purposealgorithms to support higher values.Each AEAD algorithm MUST accept any associated data with a lengthbetween zero and A_MAX octets, inclusive, where the value A_MAX isspecific to that algorithm. The value of A_MAX MUST be larger thanzero, and SHOULD be at least 65,536 (2^16) octets. Otherapplications may use even larger values of A_MAX, so it is desirable for general-purpose algorithms to support higher values.Each AEAD algorithm MUST accept any nonce with a length between N_MIN and N_MAX octets, inclusive, where the values of N_MIN and N_MAX are specific to that algorithm. The values of N_MAX and N_MIN MAY beequal. Each algorithm SHOULD accept a nonce with a length of twelve (12) octets. Randomized or stateful algorithms, which are described below, MAY have an N_MAX value of zero.An AEAD algorithm MAY structure its ciphertext output in any way; for example, the ciphertext can incorporate an authentication tag. Each algorithm SHOULD choose a structure that is amenable to efficientprocessing.McGrew Standards Track [Page 12]An Authenticated Encryption algorithm MAY incorporate or make use of a random source, e.g., for the generation of an internalinitialization vector that is incorporated into the ciphertextoutput. An AEAD algorithm of this sort is called randomized; though note that only encryption is random, and decryption is alwaysdeterministic. A randomized algorithm MAY have a value of N_MAX that is equal to zero.An Authenticated Encryption algorithm MAY incorporate internal state information that is maintained between invocations of the encryptoperation, e.g., to allow for the construction of distinct valuesthat are used as internal nonces by the algorithm. An AEAD algorithm of this sort is called stateful. This method could be used by analgorithm to provide good security even when the application inputszero-length nonces. A stateful algorithm MAY have a value of N_MAXthat is equal to zero.The specification of an AEAD algorithm MUST include the values ofK_LEN, P_MAX, A_MAX, N_MIN, and N_MAX defined above. Additionally,it MUST specify the number of octets in the largest possibleciphertext, which we denote C_MAX.Each AEAD algorithm MUST provide a description relating the length of the plaintext to that of the ciphertext. This relation MUST NOTdepend on external parameters, such as an authentication strengthparameter (e.g., authentication tag length). That sort of dependence would complicate the use of the algorithm by creating a situation in which the information from the AEAD registry was not sufficient toensure interoperability.EACH AEAD algorithm specification SHOULD describe what securitydegradation would result from an inadvertent reuse of a nonce value. Each AEAD algorithm specification SHOULD provide a reference to adetailed security analysis. This document does not specify aparticular security model, because several different models have been used in the literature. The security analysis SHOULD define orreference a security model.An algorithm that is randomized or stateful, as defined above, SHOULD describe itself using those terms.McGrew Standards Track [Page 13]。

Outlook Express 错误代码表

Outlook Express 错误代码表

按照下列“Q”代表问题,“A”代表解答。

Q:the server says:550 relaying mail to <> is not allowedQ:The server says:550 <>... relaying deniedQ:the server says:550 5.7.1 relaying not permitted:A:使用某些Smtp服务器时,限制了收件人的地址,只能换一个Smtp服务器。

Q:The server says:550 <>:local user onlyQ:The server says:550 <>:Invalid UserQ:The server says:550 Invalid recipientA:使用,,和之类的Smtp服务器时,只能用自身的信箱发信,所以要在Outlook Express的“帐户属性”中的“个人信息”里面填写正确的邮件地址。

Q:the server says:551 delivery not allowed to non-local recipientQ:The server says:553 Relay restriction.Q:The server says:553 From <>, message blocked.Q:The server says:553 sorry,you are not allow to use this SMTP to relay your eamiQ:The server says:553 sorry, that domain isn't in my list of allowed rcpthostsA:使用,,,等大多数信箱的smtp服务器时,只能用自身的信箱发信,所以要在Outlook Express的“帐户属性”中的“个人信息”里面填写正确的邮件地址。

请求不符合 rfc3986协议(一)

请求不符合 rfc3986协议(一)

请求不符合 rfc3986协议(一)协议模板:请求不符合 RFC39861. 引言本协议旨在解决请求不符合 RFC3986 规范的问题。

作为优秀的律师,我们以客户的利益为先,帮助客户了解问题的发生、可能产生的后果,并提供解决方案。

2. 请求不符合 RFC3986 的背景•RFC3986 是统一资源标识符(Uniform Resource Identifier)的语法规范,用于标识互联网上的资源。

该规范定义了 URI 的组成部分、编码方式以及有效字符等要求。

•请求不符合 RFC3986 可能导致系统无法正确解析请求,造成功能异常、数据丢失、安全风险等问题。

3. 问题描述•客户在使用某系统时,发现部分请求无法成功处理。

经分析,发现这些请求不符合 RFC3986 的要求,导致无法正确解析。

•请求中可能包含非法字符、缺少必要的编码等问题。

4. 可能的后果•无法正确处理请求可能导致系统功能异常,影响用户体验。

•部分非法请求可能给系统带来安全风险,如跨站脚本攻击(XSS)、注入攻击等。

5. 解决方案为解决请求不符合 RFC3986 的问题,建议以下措施:1.验证请求参数格式:在系统接收到请求时,进行严格的参数格式验证,包括合法字符、编码要求等。

2.转义非法字符:对于包含非法字符的请求参数,在处理前进行适当的字符转义,确保请求符合 RFC3986 的要求。

3.提供编码规范和示例:在系统文档中明确指出请求的编码规范,并提供示例,帮助用户正确构建请求。

4.规范化输出:确保系统返回的响应中,包括 URI 等标识符的输出符合 RFC3986 的要求。

6. 风险提示•如果客户未采取上述措施,持续使用不符合 RFC3986 规范的请求可能会导致系统稳定性、安全性等方面的风险。

•本律师事务所建议客户尽快解决请求不符合 RFC3986 的问题,以降低潜在的损失和风险。

7. 免责声明本协议仅为律师事务所对客户提供的建议和解决方案,不能代表其对相关规范的解释和约束力。

和SIP有关的RFC

和SIP有关的RFC
RFC 3666 SIP Public Switched Telephone Network (PSTN) Call Flows.
RFC 3680 SIP Event Package for Registrations
RFC 3702 Authentication, Authorization, and Accounting Requirements for the SIP
RFC 3515 The Session Initiation Protocol (SIP) Refer Method
RFC 3578 Mapping of Integrated Services Digital Network (ISDN) User Part (ISUP) Overlap Signalling to the SIP
RFC 4244 An Extension to the SIP for Request History Information
RFC 4245 High-Level Requirements for Tightly Coupled SIP Conferencing
RFC 4320 Actions Addressing Identified Issues with the SIP's Non-INVITE Transaction
RFC 3581 An Extension to the SIP for Symmetric Response Routing
RFC 3603 Private SIP Proxy-to-Proxy Extensions for Supporting the PacketCable Distributed Call Signaling Architecture.

insufficientauthenticationexception类 -回复

insufficientauthenticationexception类 -回复

insufficientauthenticationexception类-回复[InsufficientAuthenticationException类] 是Java Spring Security 框架中的一个异常类。

在本文中,我们将详细介绍InsufficientAuthenticationException类的含义、发生原因、常见示例以及如何处理这个异常。

首先,让我们来了解InsufficientAuthenticationException类的含义。

该类是Spring Security框架中的一个异常类,用于表示认证不足的异常情况。

也就是说,在进行身份验证过程时,如果发现认证不足以满足要求,就会抛出此异常。

接下来,让我们来分析一下InsufficientAuthenticationException类可能发生的原因。

该异常通常在以下几种情况下被抛出:1. 用户登录时提供的凭证不完整或无效:当用户提供的用户名或密码不符合要求时,该异常可能被抛出。

这可能是由于用户输入错误的凭证或黑客试图进行恶意登录而导致的。

2. 缺少必要的认证信息:有时候,特定的应用程序可能需要更多的认证信息来完成身份验证过程。

如果缺少必要的认证信息,就会抛出该异常。

3. 认证过程中的错误配置:在Spring Security框架中,可能会发生某些配置错误,导致认证无法成功完成。

这些错误配置可能会导致认证异常,其中之一就是InsufficientAuthenticationException。

现在,我们来看几个常见的示例,以更好地理解InsufficientAuthenticationException类的实际用例。

1. 用户登录时提供的凭证不完整或无效:假设一个网站要求用户在登录时同时提供用户名和密码。

如果用户只提供了其中一个或两个都错误,那么就有可能引发InsufficientAuthenticationException异常。

TD信息元素详解

TD信息元素详解

信息元素功能性定义作者:李欣目录目录 (1)信息元素功能性定义 (11)1 核心网信息元素 (11)1.1 CN Information elements (11)1.2 CN Domain System Information (11)1.3 CN Information info (11)1.4 IMEI (11)1.5 IMSI (GSM-MAP) (11)1.6 Intra Domain NAS Node Selector (11)1.7 Location Area Identification (12)1.8 NAS message (12)1.9 NAS system information (GSM-MAP) (12)1.10 Paging record type identifier (12)1.11 PLMN identity (12)1.12 PLMN Type (12)1.13 P-TMSI (GSM-MAP) (12)1.14 RAB identity (12)1.15 Routing Area Code (12)1.16 Routing Area Identification (13)1.17 TMSI (GSM-MAP) (13)2 UTRAN 移动信息元素 (13)2.1 Cell Access Restriction (13)2.2 Cell identity (13)2.3 Cell selection and re-selection info for SIB3/4 (13)2.4 Cell selection and re-selection info for SIB11/12 (13)2.5 Mapping Info (14)2.6 URA identity (14)3 UE 信息元素 (14)3.1 Activation time (14)3.2 Capability Update Requirement (14)3.3 Cell update cause (15)3.4 Ciphering Algorithm (15)3.5 Ciphering mode info (15)3.6 CN domain specific DRX cycle length coefficient (15)3.7 CPCH Parameters (15)3.8 C-RNTI (15)3.9 DRAC system information (15)3.10 Void (16)3.11 Establishment cause (16)3.12 Expiration Time Factor (16)3.13 Failure cause (16)3.14 Failure cause and error information (16)3.15 Initial UE identity (16)3.16 Integrity check info (16)3.17 Integrity protection activation info (17)3.18 Integrity protection Algorithm (17)3.19 Integrity protection mode info (17)3.20 Maximum bit rate (17)3.21 Measurement capability (17)3.22 Paging cause (17)3.23 Paging record (17)3.24 PDCP capability (17)3.25 Physical channel capability (18)3.26 Protocol error cause (18)3.27 Protocol error indicator (18)3.28 RB timer indicator (18)3.29 Redirection info (18)3.30 Re-establishment timer (18)3.31 Rejection cause (18)3.32 Release cause (18)3.33 RF capability FDD (19)3.34 RLC capability (19)3.35 RLC re-establish indicator (19)3.36 RRC transaction identifier (19)3.37 Security capability (19)3.38 START (19)3.39 Transmission probability (19)3.40 Transport channel capability (20)3.41 UE multi-mode/multi-RAT capability (20)3.42 UE radio access capability (20)3.43 UE Timers and Constants in connected mode (21)3.44 UE Timers and Constants in idle mode (21)3.45 UE positioning capability (21)3.46 URA update cause (21)3.47 U-RNTI (21)3.48 U-RNTI Short (21)3.49 UTRAN DRX cycle length coefficient (21)3.50 Wait time (21)3.51 UE Specific Behavior Information 1 idle (21)3.52 UE Specific Behavior Information 1 interRAT (22)4 无线承载信息元素 (22)4.0 Default configuration identity (22)4.1 Downlink RLC STATUS info (22)4.2 PDCP info (22)4.3 PDCP SN info (22)4.4 Polling info (22)4.5 Predefined configuration identity (23)4.6 Predefined configuration value tag (23)4.7 Predefined RB configuration (23)4.8 RAB info (23)4.9 RAB info Post (23)4.10 RAB information for setup (23)4.11 RAB information to reconfigure (24)4.12 NAS Synchronization indicator (24)4.13 RB activation time info (24)4.14 RB COUNT-C MSB information (24)4.15 RB COUNT-C information (24)4.16 RB identity (24)4.17 RB information to be affected (24)4.18 RB information to reconfigure (25)4.19 RB information to release (25)4.20 RB information to setup (25)4.21 RB mapping info (25)4.22 RB with PDCP information (25)4.23 RLC info (25)4.24 Signaling RB information to setup (26)4.25 Transmission RLC Discard (26)5 传输信道信息元素 (26)5.1 Added or Reconfigured DL TrCH information (26)5.2 Added or Reconfigured UL TrCH information (27)5.3 CPCH set ID (27)5.4 Deleted DL TrCH information (27)5.5 Deleted UL TrCH information (27)5.6 DL Transport channel information common for all transport channels (27)5.7 DRAC Static Information (27)5.8 Power Offset Information (28)5.9 Predefined TrCH configuration (28)5.10 Quality Target (28)5.11 Semi-static Transport Format Information (28)5.12 TFCI Field 2 Information (28)5.13 TFCS Explicit Configuration (28)5.14 TFCS Information for DSCH (TFCI range method) (29)5.15 TFCS Reconfiguration/Addition Information (29)5.16 TFCS Removal Information (29)5.17 Void (29)5.18 Transport channel identity (29)5.19 Transport Format Combination (TFC) (29)5.20 Transport Format Combination Set (29)5.21 Transport Format Combination Set Identity (29)5.22 Transport Format Combination Subset (29)5.23 Transport Format Set (29)5.24 UL Transport channel information common for all transport channels (30)6 物理信道信息元素 (30)6.1 AC-to-ASC mapping (30)6.2 AICH Info (30)6.3 AICH Power offset (30)6.4 Allocation period info (30)6.5 Alpha (30)6.6 ASC Setting (30)6.7 Void (31)6.8 CCTrCH power control info (31)6.9 Cell parameters Id (31)6.10 Common timeslot info (31)6.11 Constant value (31)6.12 CPCH persistence levels (31)6.13 CPCH set info (31)6.14 CPCH Status Indication mode (31)6.15 CSICH Power offset (32)6.16 Default DPCH Offset Value (32)6.17 Downlink channelisation codes (32)6.18 Downlink DPCH info common for all RL (32)6.19 Downlink DPCH info common for all RL Post (32)6.20 Downlink DPCH info common for all RL Pre (32)6.21 Downlink DPCH info for each RL (32)6.22 Downlink DPCH info for each RL Post (33)6.23 Downlink DPCH power control information (33)6.24 Downlink information common for all radio links (33)6.25 Downlink information common for all radio links Post (33)6.26 Downlink information common for all radio links Pre (33)6.27 Downlink information for each radio link (33)6.28 Downlink information for each radio link Post (33)6.29 Void (33)6.30 Downlink PDSCH information (33)6.31 Downlink rate matching restriction information (34)6.32 Downlink Timeslots and Codes (34)6.33 DPCH compressed mode info (34)6.34 DPCH Compressed Mode Status Info (34)6.35 Dynamic persistence level (34)6.36 Frequency info (34)6.37 Individual timeslot info (35)6.38 Individual Timeslot interference (35)6.39 Maximum allowed UL TX power (35)6.40 Void (35)6.41 Midamble shift and burst type (35)6.42 PDSCH Capacity Allocation info (35)6.43 PDSCH code mapping (36)6.44 PDSCH info (36)6.45 PDSCH Power Control info (36)6.46 PDSCH system information (36)6.47 PDSCH with SHO DCH Info (36)6.48 Persistence scaling factors (36)6.49 PICH Info (36)6.50 PICH Power offset (37)6.51 PRACH Channelisation Code List (37)6.52 PRACH info (for RACH) (37)6.53 PRACH partitioning (37)6.54 PRACH power offset (37)6.55 PRACH system information list (37)6.56 Predefined PhyCH configuration (38)6.57 Primary CCPCH info (38)6.58 Primary CCPCH info post (38)6.59 Primary CCPCH TX Power (38)6.60 Primary CPICH info (38)6.61 Primary CPICH Tx power (38)6.62 Primary CPICH usage for channel estimation (38)6.63 PUSCH info (38)6.64 PUSCH Capacity Allocation info (38)6.65 PUSCH power control info (39)6.66 PUSCH system information (39)6.67 RACH transmission parameters (39)6.68 Radio link addition information (39)6.69 Radio link removal information (39)6.70 SCCPCH Information for FACH (39)6.71 Secondary CCPCH info (39)6.72 Secondary CCPCH system information (40)6.73 Secondary CPICH info (40)6.74 Secondary scrambling code (40)6.75 SFN Time info (40)6.76 SSDT cell identity (40)6.77 SSDT information (40)6.78 STTD indicator (40)6.79 TDD open loop power control (41)6.80 TFC Control duration (41)6.81 TFCI Combining Indicator (41)6.82 TGPSI (41)6.83 Time info (41)6.84 Timeslot number (41)6.85 TPC combination index (41)6.86 TSTD indicator (41)6.87 TX Diversity Mode (41)6.88 Uplink DPCH info (41)6.89 Uplink DPCH info Post (42)6.90 Uplink DPCH info Pre (42)6.91 Uplink DPCH power control info (42)6.92 Uplink DPCH power control info Post (42)6.93 Uplink DPCH power control info Pre (42)6.94 Uplink Timeslots and Codes (42)6.95 Uplink Timing Advance (42)6.96 Uplink Timing Advance Control (43)7 测量信息元素 (43)7.1 Additional measurements list (43)7.2 Cell info (43)7.3 Cell measured results (43)7.4 Cell measurement event results (44)7.5 Cell reporting quantities (44)7.6 Cell synchronization information (44)7.7 Event results (44)7.8 FACH measurement occasion info (45)7.9 Filter coefficient (45)7.10 HCS Cell re-selection information (45)7.11 HCS neighboring cell information (45)7.12 HCS Serving cell information (45)7.13 Inter-frequency cell info list (46)7.14 Inter-frequency event identity (46)7.15 Inter-frequency measured results list (46)7.16 Inter-frequency measurement (46)7.17 Inter-frequency measurement event results (47)7.18 Inter-frequency measurement quantity (47)7.19 Inter-frequency measurement reporting criteria (47)7.20 Inter-frequency measurement system information (47)7.21 Inter-frequency reporting quantity (47)7.22 Inter-frequency SET UPDATE (48)7.23 Inter-RAT cell info list (48)7.24 Inter-RAT event identity (48)7.25 Inter-RAT info (48)7.26 Inter-RAT measured results list (48)7.27 Inter-RAT measurement (49)7.28 Inter-RAT measurement event results (49)7.29 Inter-RAT measurement quantity (49)7.30 Inter-RAT measurement reporting criteria (49)7.31 Inter-RAT measurement system information (50)7.32 Inter-RAT reporting quantity (50)7.33 Intra-frequency cell info list (50)7.34 Intra-frequency event identity (50)7.35 Intra-frequency measured results list (50)7.36 Intra-frequency measurement (50)7.37 Intra-frequency measurement event results (51)7.38 Intra-frequency measurement quantity (51)7.39 Intra-frequency measurement reporting criteria (51)7.40 Intra-frequency measurement system information (51)7.41 Intra-frequency reporting quantity (52)7.42 Intra-frequency reporting quantity for RACH reporting (52)7.43 Maximum number of reported cells on RACH (52)7.44 Measured results (52)7.45 Measured results on RACH (52)7.46 Measurement Command (52)7.47 Measurement control system information (53)7.48 Measurement Identity (53)7.49 Measurement reporting mode (53)7.50 Measurement Type (53)7.51 Measurement validity (53)7.52 Observed time difference to GSM cell (53)7.53 Periodical reporting criteria (53)7.54 Primary CCPCH RSCP info (54)7.55 Quality measured results list (54)7.56 Quality measurement (54)7.57 Quality measurement event results (54)7.58 Quality measurement reporting criteria (54)7.59 Quality reporting quantity (54)7.60 Reference time difference to cell (54)7.61 Reporting Cell Status (55)7.62 Reporting information for state CELL_DCH (55)7.63 SFN-SFN observed time difference (55)7.64 Time to trigger (55)7.65 Timeslot ISCP info (55)7.66 Traffic volume event identity (55)7.67 Traffic volume measured results list (55)7.68 Traffic volume measurement (55)7.69 Traffic volume measurement event results (56)7.70 Traffic volume measurement object (56)7.71 Traffic volume measurement quantity (56)7.72 Traffic volume measurement reporting criteria (56)7.73 Traffic volume measurement system information (56)7.74 Traffic volume reporting quantity (56)7.75 UE internal event identity (56)7.76 UE internal measured results (57)7.77 UE internal measurement (57)7.78 UE internal measurement event results (57)7.79 UE internal measurement quantity (57)7.80 UE internal measurement reporting criteria (57)7.81 Void (58)7.82 UE Internal reporting quantity (58)7.83 UE Rx-Tx time difference type 1 (58)7.84 UE Rx-Tx time difference type 2 (58)7.85 UE Transmitted Power info (58)7.86 UE positioning Ciphering info (58)7.87 UE positioning Error (58)7.88 UE positioning GPS acquisition assistance (59)7.89 UE positioning GPS almanac (59)7.90 UE positioning GPS assistance data (59)7.91 UE positioning GPS DGPS corrections (59)7.92 UE positioning GPS ionospheric model (59)7.93 UE positioning GPS measured results (59)7.94 UE positioning GPS navigation model (60)7.95 UE positioning GPS real-time integrity (60)7.96 UE positioning GPS reference time (60)7.97 UE positioning GPS UTC model (61)7.98 UE positioning IPDL parameters (61)7.99 UE positioning measured results (61)7.100 UE positioning measurement (61)7.101 UE positioning measurement event results (61)7.102 Void (62)7.103 UE positioning OTDOA assistance data for UE-assisted (62)7.104 Void (62)7.105 UE positioning OTDOA measured results (62)7.106 UE positioning OTDOA neighbor cell info (62)7.107 UE positioning OTDOA quality (63)7.108 UE positioning OTDOA reference cell info (63)7.109 UE positioning position estimate info (64)7.110 UE positioning reporting criteria (64)7.111 UE positioning reporting quantity (64)7.112 T ADV info (65)8 其它信息元素 (65)8.1 BCCH modification info (65)8.2 BSIC (65)8.3 CBS DRX Level 1 information (65)8.4 Cell Value tag (65)8.5 Inter-RAT change failure (65)8.6 Inter-RAT handover failure (66)8.7 Inter-RAT UE radio access capability (66)8.8 Void (66)8.9 MIB Value tag (66)8.10 PLMN Value tag (66)8.11 Predefined configuration identity and value tag (66)8.12 Protocol error information (66)8.13 References to other system information blocks (66)8.14 References to other system information blocks and scheduling blocks (67)8.15 Rplmn information (67)8.16 Scheduling information (67)8.17 SEG COUNT (67)8.18 Segment index (67)8.19 SIB data fixed (67)8.20 SIB data variable (67)8.21 SIB type (67)8.22 SIB type SIBs only (67)9 ANSI-41 Information elements (68)10 Multiplicity values and type constraint values (68)信息元素功能性定义消息是由多个信息元素组合而成,信息元素根据其功能的不同划分为:核心网域信息元素、UTRAN 移动信息元素、UE 信息元素、无线承载信息元素、传输信道信息元素、物理信道信息元素和测量信息元素。

一种新的IPv6安全协议——有限制发送协议

一种新的IPv6安全协议——有限制发送协议
有 其局 限性. 12 Iv . P 6安 全 协 议 I se 法 解 决 的 安 全 隐 患 Pe 无
以 Iv 议 的子 协议移 动 Iv P 6协 P 6协议 ( P 6 为例 , MIv ) 它也 采用 IS c体 系 中认 证 协 议 ( H) 封 装安 Pe A ,
全 载荷 ( S ) It nt E P , e e 密钥 交换协 议 (K 来 提供 认证 、 nr I E) 数据 完整 性和 机密 性保 护.
第 4期

种 新 的 Iv P 6安 全 协 议 — — 有 限 制 发 送 协 议
胡 清桂
( 内江 师 范 学 院 现 代 教 育 技 术 中 心 ,四川 内江 6 11 ) 4 12

要 : 本 文 针 对 安 全 协 议 Isc无 法 解 决 的 安 全 隐 患 提 出 了 一 种 新 的 网 络 安 全 协 议 — — 有 限 制 发 送 协 Pe
第 4期
胡 清桂 : 种 新 的 Iv 一 P6安 全 协议 — — 有 限 制 发 送 协 议
的数 据分组 耗尽 内存 , 而无 法响应 其他 有用 信息 , 造成 拒绝 服 务攻 击 . 因为 目前 的单播 数 据 分组 的路 由只依赖 于 目的地址 , 并不 一定 要查看 源地 址 , 因此黑 客可 以将数 据分 组 的源地址设 置成 一个 不存在 的 地址 或一 个合 法 的地址 来欺 骗对 方服 务器 . 到 目前为止 , 这样 的安 全隐 患还没 有较 好 的解 决 方 法. 包 过 滤技 术 ” pc e ft ig 可 以减 轻这 “ ( akt l r ) en i 类攻 击造成 的威 胁 , 过滤 技术 原理在 于 监视 并 过滤 网络 上流 人 流 出 的 I 包 P包 , 拒绝 发 送 可疑 的 I . P包

pam authentication返回值

pam authentication返回值

pam authentication返回值PAM(PluggableAuthenticationModule)是Linux系统中用于用户身份验证的模块,它支持多种身份验证方式,包括但不限于密码、令牌等。

在PAM中,认证过程的返回值用于表示不同的认证状态,下面将介绍PAMauthentication返回值的含义。

1.PAM_SUCCESS:表示认证成功。

这是PAM模块期望的返回值,当模块成功完成了身份验证过程,并且通过了所有预设的验证条件时,应该返回这个值。

2.PAM_INFO_MSG:表示附加信息消息。

当PAM模块在认证过程中产生了附加信息时,会返回这个值。

这个值通常包含一些描述性的消息,用于提供给用户一些额外的信息。

3.PAM_CRED_INCOMPLETE:表示认证信息不完整。

当PAM模块在认证过程中发现用户提供的认证信息不完整或者不符合预设的条件时,会返回这个值。

这通常意味着用户需要提供更多的认证信息或者重新尝试认证。

4.PAM_PERMFAILURE:表示权限失败。

当PAM模块在认证过程中发现用户没有足够的权限来完成所请求的操作时,会返回这个值。

这通常意味着用户需要提升权限或者寻找其他方式来完成认证过程。

5.PAM_CRED_EXPIRE:表示认证信息过期。

当PAM模块在认证过程中发现用户提供的认证信息已经过期时,会返回这个值。

这通常意味着用户需要重新获取新的认证信息或者重新进行身份验证。

6.PAM_AUTHINFO_UNAVAIL:表示无法提供认证信息。

当PAM模块无法提供所需的认证信息时,会返回这个值。

这通常意味着模块无法正常工作或者需要更多的配置信息才能完成认证过程。

总结起来,PAMauthentication返回值用于表示不同的认证状态和情况,开发者可以根据这些返回值来判断用户是否通过了身份验证,以及需要采取哪些措施来处理认证失败的情况。

在编写PAM模块时,建议根据实际需求选择适当的返回值,以确保模块能够正确地完成身份验证过程。

insufficientauthenticationexception类 -回复

insufficientauthenticationexception类 -回复

insufficientauthenticationexception类-回复什么是InsufficientAuthenticationException类?InsufficientAuthenticationException类是Spring Security框架中的一个异常类。

该类的主要作用是指示在认证过程中发生了不足的身份验证引发的异常。

在Spring Security中,身份验证是确保用户实体是合法的过程。

这个过程通常包括用户提供凭据(如用户名和密码)以验证其身份,并且它是保护应用程序免受未经授权的访问的重要步骤。

然而,有时在进行身份验证时,可能会遇到身份验证不足的情况,而此时就会抛出InsufficientAuthenticationException异常。

通常情况下,InsufficientAuthenticationException异常是由以下几个原因引起的:1. 缺少必需的凭据:身份验证通常需要用户提供一些凭据,例如用户名和密码。

如果用户没有提供所需的凭据,系统将无法进行适当的身份验证,从而导致发生InsufficientAuthenticationException异常。

2. 凭据无效:如果用户提供的凭据无效,系统将无法确定他们的身份是否合法。

这可能是因为密码错误、用户名不存在或用户的帐户已被锁定等原因。

在这种情况下,Spring Security会引发InsufficientAuthenticationException异常。

3. 缺乏必需的权限:除了验证用户的身份外,访问应用程序通常还需要用户具备特定的权限。

如果用户身份验证成功,但缺乏所需的权限,系统将引发InsufficientAuthenticationException异常。

如何处理InsufficientAuthenticationException异常?处理InsufficientAuthenticationException异常的方法取决于应用程序的具体需求和安全策略。

insufficientauthenticationexception类 -回复

insufficientauthenticationexception类 -回复

insufficientauthenticationexception类-回复什么是InsufficientAuthenticationException类?InsufficientAuthenticationException类是一个在Java Spring Security框架中使用的异常类。

该类在用户进行身份验证时,如果认证不足或不成功,就会被抛出。

它表示用户无法通过安全验证,因此无法获得所需的资源或执行所请求的操作。

在网络应用程序中,安全性是至关重要的。

身份验证是确保用户身份有效性和授权访问的过程。

当用户试图访问某些受限资源时,应用程序会要求用户进行身份验证。

如果用户未能提供有效的凭据,或者未通过其他安全验证机制,那么应用程序将抛出InsufficientAuthenticationException异常。

为什么会抛出InsufficientAuthenticationException异常?InsufficientAuthenticationException异常的抛出通常是由以下原因之一引起的:1. 无效的凭证:用户提交的凭证(例如用户名和密码)无效或错误。

这可能是用户错误输入凭证或恶意第三方试图访问受限资源的结果。

2. 身份验证机制不足:应用程序使用的身份验证机制不足以确认用户的身份。

这可能是由于安全配置错误、安全验证框架缺陷或配置不当引起的。

3. 用户权限不足:用户已成功通过身份验证,但他们被授予的权限不足以访问所请求的资源。

这可能是由于用户角色不匹配、权限配置错误或应用程序逻辑错误引起的。

如何处理InsufficientAuthenticationException异常?在遇到InsufficientAuthenticationException异常时,开发人员可以采取以下措施来处理异常并为用户提供更好的用户体验:1. 异常处理与提示消息:捕获InsufficientAuthenticationException 异常,并为用户提供相应的错误消息或提示,以指导他们采取适当的行动。

fatal forbid remote connection with trust method

fatal forbid remote connection with trust method

fatal forbid remote connection with trust method 错误信息"fatal forbid remote connection with trust method" 通常表示在远程连接时出现了致命的错误,并且该连接不允许使用信任方法。

这种错误出现的原因有以下几种:
1. 远程服务器不允许使用信任方法进行连接。

某些服务器可能配置为只接受特定的身份验证方法,而不允许使用信任方法。

2. 客户端与服务器之间的通信出现问题,导致无法建立信任关系。

3. 证书问题:如果远程连接需要使用证书进行身份验证,可能是证书无效、过期或与服务器不匹配。

要解决这个问题,可以尝试以下步骤:
1. 确认远程服务器是否允许使用信任方法进行连接。

如果不允许,你可能需要使用其他身份验证方法,如用户名和密码。

2. 检查客户端与服务器之间的网络连接,确保它们之间的通信正常。

3. 如果需要使用证书进行身份验证,请确保证书有效且与服务器匹配。

4. 尝试使用其他远程连接工具或客户端,以确定问题是否与特定的工具或客户端有关。

一种新的IPv6安全协议-有限制发送协议

一种新的IPv6安全协议-有限制发送协议

一种新的IPv6安全协议-有限制发送协议
胡清桂
【期刊名称】《河北工程大学学报(自然科学版)》
【年(卷),期】2011(028)004
【摘要】介绍了安全协议IPsec的不足,并针对IPsec无法解决的安全隐患提出了一种新的网络安全协议—有限制发送协议.在新的协议中,如果主机向网络发送大量的具有攻击性的数据包时,其发送权利将会受到限制,从而保证网络的安全.采用了OPNET仿真软件对新的协议进行了仿真,仿真结果表明,采用新的协议时,网络性能要好.采用新的协议时,平均HTTP响应时间为0.013 s;不采用新的协议时,平均HTTP响应时间为0.032 s.
【总页数】4页(P93-96)
【作者】胡清桂
【作者单位】内江师范学院现代教育技术中心,四川内江641112
【正文语种】中文
【中图分类】TP393.1
【相关文献】
1.一种新的基于HMIPv6的车载网络移动协议仿真研究 [J], 刘书如;张启坤;甘勇
2.一种新的IPv6任播地址解析协议及应用 [J], 王建;李方伟
3.工业控制网络协议与IPv6协议的一种转换方法 [J], 吉顺如;杨泽平;万锋
4.一种新的IPv6安全协议——有限制发送协议 [J], 胡清桂
5.一种新的移动IPv6协议——P2PMIPv6 [J], 胡清桂
因版权原因,仅展示原文概要,查看原文内容请购买。

相关主题
  1. 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
  2. 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
  3. 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。

Network Working Group H. Tschofenig Request for Comments: 5106 D. Kroeselberg Category: Experimental Nokia Siemens Networks A. Pashalidis NEC Y. Ohba Toshiba F. Bersani France Telecom February 2008 The Extensible Authentication Protocol-Internet Key Exchange Protocolversion 2 (EAP-IKEv2) MethodStatus of This MemoThis memo defines an Experimental Protocol for the Internetcommunity. It does not specify an Internet standard of any kind.Discussion and suggestions for improvement are requested.Distribution of this memo is unlimited.AbstractThis document specifies EAP-IKEv2, an Extensible AuthenticationProtocol (EAP) method that is based on the Internet Key Exchange(IKEv2) protocol. EAP-IKEv2 provides mutual authentication andsession key establishment between an EAP peer and an EAP server. It supports authentication techniques that are based on passwords,high-entropy shared keys, and public key certificates. EAP-IKEv2further provides support for cryptographic ciphersuite negotiation,hash function agility, identity confidentiality (in certain modes of operation), fragmentation, and an optional "fast reconnect" mode. Tschofenig, et al. Experimental [Page 1]Table of Contents1. Introduction (3)2. Terminology (4)3. Protocol Overview (6)4. Fast Reconnect (9)5. Key Derivation (12)6. Session ID, Peer ID, and Server ID (13)7. Error Handling (13)8. Specification of Protocol Fields (16)8.1. The Flags, Message Length, and Integrity ChecksumData Fields (17)8.2. EAP-IKEv2 Header (19)8.3. Security Association Payload (19)8.4. Key Exchange Payload (20)8.5. Nonce Payload (20)8.6. Identification Payload (20)8.7. Certificate Payload (20)8.8. Certificate Request Payload (20)8.9. Encrypted Payload (20)8.10. Authentication Payload (20)8.11. Notify Payload (21)8.12. Next Fast-ID Payload (21)9. Payload Types and Extensibility (22)10. Security Considerations (22)10.1. Protected Ciphersuite Negotiation (23)10.2. Mutual Authentication (23)10.3. Integrity Protection (23)10.4. Replay Protection (23)10.5. Confidentiality (23)10.6. Key Strength (24)10.7. Dictionary Attack Resistance (24)10.8. Fast Reconnect (25)10.9. Cryptographic Binding (25)10.10. Session Independence (25)10.11. Fragmentation (26)10.12. Channel Binding (26)10.13. Summary (26)11. IANA Considerations (27)12. Contributors (28)13. Acknowledgements (28)14. References (29)14.1. Normative References (29)14.2. Informative References (29)Appendix A (30)Tschofenig, et al. Experimental [Page 2]1. IntroductionThis document specifies EAP-IKEv2, an EAP method that is based on the Internet Key Exchange Protocol version 2 (IKEv2) [1]. EAP-IKEv2provides mutual authentication and session key establishment between an EAP peer and an EAP server. It supports authentication techniques that are based on the following types of credentials:o Asymmetric key pairs: these are public/private key pairs where the public key is embedded into a digital certificate, and thecorresponding private key is known only to a single party.o Passwords: these are low-entropy bit strings that are known toboth the server and the peer.o Symmetric keys: these are high-entropy bit strings that are known to both the server and the peer.It is possible to use a different authentication credential (andthereby technique) for each direction, e.g., the EAP server mayauthenticate itself using a public/private key pair and the EAPclient may authenticate itself using a symmetric key. In particular, the following combinations are expected to be used in practice; these are referred to as "use cases" or "modes" in the remainder of thisdocument:1. EAP server: asymmetric key pair, EAP peer: asymmetric key pair2. EAP server: asymmetric key pair, EAP peer: symmetric key3. EAP server: asymmetric key pair, EAP peer: password4. EAP server: symmetric key, EAP peer: symmetric keyNote that in use cases 2 and 4, a symmetric key is assumed to bechosen uniformly at random from its key space; it is thereforeassumed that symmetric keys are not derived from passwords. Deriving a symmetric key from a password is insecure when used with mode 4since the exchange is vulnerable to dictionary attacks, as described in more detail in Section 10.7. Also note that in use case 3, theEAP server must either have access to all passwords in plaintext, or, alternatively, for each password store, the value prf(password,"KeyPad for EAP-IKEv2") for all supported pseudorandom functions (also Tschofenig, et al. Experimental [Page 3]see Section 8.10 below and Section 2.15 of [1]). Other conceivableuse cases are not expected to be used in practice due to keymanagement issues, and have not been considered in this document.Note that the IKEv2 protocol is able to carry EAP exchanges. Bycontrast, EAP-IKEv2 does not inherit this capability. That is, it is not possible to tunnel EAP methods inside EAP-IKEv2. Also note that the set of functionality provided by EAP-IKEv2 is similar, but notidentical, to that provided by other EAP methods such as, forexample, EAP-TLS [6].The remainder of this document is structured as follows:o Section 2 provides an overview of the terminology and theabbreviations used in this document.o Section 3 provides an overview of the full EAP-IKEv2 exchange and thereby specifies the protocol message composition.o Section 4 specifies the optional EAP-IKEv2 "fast reconnect" modeof operation.o Section 5 specifies how exportable session keys are derived.o Section 6 specifies how the Session-ID, Peer-ID, and Server-IDelements are derived.o Section 7 specifies how errors that may potentially occur duringprotocol execution are handled.o Section 8 specifies the format of the EAP-IKEv2 data fields.Section 8.1 describes how fragmentation is handled in EAP-IKEv2.o Section 9 specifies the payload type values and describes protocol extensibility.o Section 10 provides a list of claimed security properties.2. TerminologyThis document makes use of terms defined in [2] and [1]. Inaddition, the keywords MUST, MUST NOT, REQUIRED, SHALL, SHALL NOT,SHOULD, SHOULD NOT, RECOMMENDED, MAY, and OPTIONAL, when they appear in this document, are to be interpreted as described in [3]. Tschofenig, et al. Experimental [Page 4]A list of abbreviations that are used in this document follows.AUTH:Denotes a data field containing either a Message AuthenticationCode (MAC) or a signature. This field is embedded into anAuthentication payload, defined in Section 8.10.CERT:Public key certificate or similar structure.CERTREQ:Certificate Request.NFID:Next Fast-ID payload (see Sections 4 and 8.12)EMSK:Extended Master Session Key, defined in [2].HDR:EAP-IKEv2 header, defined in Section 8.2.I:Initiator, the party that sends the first message of an EAP-IKEv2 protocol run. This is always the EAP server.MAC:Message Authentication Code. The result of a cryptographicoperation that involves a symmetric key.MSK:Master Session Key, defined in [2].prf:Pseudorandom function: a cryptographic function whose output isassumed to be indistinguishable from that of a truly randomfunction.Tschofenig, et al. Experimental [Page 5]R:Responder, the party that sends the second message of an EAP-IKEv2 protocol run. This is always the EAP peer.SA:Security Association. In this document, SA denotes a type ofpayload that is used for the negotiation of the cryptographicalgorithms that are to be used within an EAP-IKEv2 protocol run.Specifically, SAi denotes a set of choices that are accepted by an initiator, and SAr denotes the choice of the responder.Signature:The result of a cryptographic operation that involves anasymmetric key. In particular, it involves the private part of a public/private key pair.SK:Session Key. In this document, the notation SK{x} denotes that x is embedded within an Encrypted payload, i.e., that x is encrypted and integrity-protected using EAP-IKEv2 internal keys. These keys are different in each direction.SK_xx:EAP-IKEv2 internal key, defined in Section 2.14 of [1].SKEYSEED:Keying material, defined in Section 2.14 of [1].3. Protocol OverviewIn this section, the full EAP-IKEv2 protocol run is specified. Allmessages are sent between two parties, namely an EAP peer and an EAP server. In EAP-IKEv2, the EAP server always assumes the role of the initiator (I), and the EAP peer that of the responder (R) of anexchange.The semantics and formats of EAP-IKEv2 messages are similar, albeitnot identical, to those specified in IKEv2 [1] for the establishment of an IKE Security Association. The full EAP-IKEv2 protocol runconsists of two roundtrips that are followed by either an EAP-Success or an EAP-Failure message. An optional roundtrip for exchanging EAP identities may precede the two exchanges.Tschofenig, et al. Experimental [Page 6]1. R<-I: EAP-Request/Identity2. R->I: EAP-Response/Identity(Id)3. R<-I: EAP-Req (HDR, SAi, KEi, Ni)4. R->I: EAP-Res (HDR, SAr, KEr, Nr, [CERTREQ], [SK{IDr}])5. R<-I: EAP-Req (HDR, SK{IDi, [CERT], [CERTREQ], [NFID], AUTH})6. R->I: EAP-Res (HDR, SK{IDr, [CERT], AUTH})7. R<-I: EAP-SuccessFigure 1: EAP-IKEv2 Full, Successful Protocol RunFigure 1 shows the full EAP-IKEv2 protocol run, including theoptional EAP identity exchange (messages 1 and 2). A detailedspecification of the message composition follows.Messages 1 and 2 are a standard EAP Identity Request and Response, as defined in [2]. Message 3 is the first EAP-IKEv2-specific message.With this, the server starts the actual EAP authentication exchange. It contains the initiator Security Parameter Index (SPI) in the EAP- IKEv2 header (HDR) (the initiator selects a new SPI for each protocol run), the set of cryptographic algorithms the server is willing toaccept for the protection of EAP-IKEv2 traffic (encryption andintegrity protection), and the derivation of the session key. Thisset is encoded in the Security Association payload (SAi). It alsocontains a Diffie-Hellman payload (KEi), and a Nonce payload (Ni).When the peer receives message 3, it selects a set of cryptographicalgorithms from the ones that are proposed in the message. In thisoverview, it is assumed that an acceptable such set exists (and isthus selected), and that the Diffie-Hellman value KEi belongs to anacceptable group. The peer then generates a non-zero Responder SPIvalue for this protocol run, its own Diffie-Hellman value (KEr) andnonce (Nr), and calculates the keys SKEYSEED, SK_d, SK_ai, SK_ar,SK_ei, SK_er, SK_pi, and SK_pr, according to Section 2.14 of [1].The peer then constructs message 4. In the context of use cases 1,2, and 3, the peer’s local policy MAY dictate the inclusion of theoptional CERTREQ payload in that message, which gives a hint to theserver to include a certificate for its public key in its nextmessage. In the context of use case 4, the peer MUST include theoptional SK{IDr} payload, which contains its EAP-IKEv2 identifier,encrypted and integrity-protected within an Encrypted payload. Thekeys used to construct this Encrypted payload are SK_er (forencryption) and SK_ar (for integrity protection), in accordance with Tschofenig, et al. Experimental [Page 7][1]. The responder’s EAP-IKEv2 identifier (IDr) is likely to beneeded in these use cases by the server in order to select thecorrect symmetric key or password for the construction of the AUTHpayload of message 5.Upon reception of message 4, the server also computes SKEYSEED, SK_d, SK_ai, SK_ar, SK_ei, SK_er, SK_pi, and SK_pr, according to Section2.14 of [1]. If an SK{IDr} payload is included, the server decrypts it and verifies its integrity with the corresponding keys. In thisoverview, decryption and verification is assumed to succeed. Theserver then constructs message 5, which contains only the EAP-IKEv2header followed by a single Encrypted payload. The keys used togenerate the encrypted payload MUST be SK_ei (for encryption) andSK_ai (for integrity protection), in accordance with [1]. Theinitiator MUST embed at least two payloads in the Encrypted Payload, as follows. An Identification payload with the initiator’s EAP-IKEv2 identifier MUST be embedded in the Encrypted payload. TheAuthentication payload MUST be embedded in the Encrypted payload. A Certificate payload, and/or a Certificate Request payload, MAY alsobe embedded in the Encrypted payload. Moreover, a Next Fast-Reconnect Identifier payload MAY also be embedded in the Encryptedpayload. Message 5 is sent to the responder.Upon reception of message 5, the responder (EAP peer) authenticatesthe initiator (EAP server). The checks that are performed to thisend depend on the use case, local policies, and are specified in [1]. These checks include (but may not be limited to) decrypting theEncrypted payload, verifying its integrity, and checking that theAuthentication payload contains the expected value. If all checkssucceed (which is assumed in this overview), then the responderconstructs message 6. That message MUST contain the EAP-IKEv2 header followed by a single Encrypted payload, in which at least two further payloads MUST be embedded, as shown in Figure 1.Upon reception of message 6, the initiator (EAP server) authenticates the responder (EAP peer). As above, the checks that are performed to this end depend on the use case, local policies, and MUST includedecryption and verification of the Encrypted payload, as well aschecking that the Authentication payload contains the expected value. If the optional SK{IDr} payload was included in message 4, the EAPserver MUST also ensure that the IDr payload in message 6 isidentical to that in message 4.If authentication succeeds, an EAP-Success message is sent to theresponder as message 7. The EAP server and the EAP peer generate aMaster Session Key (MSK) and an Extended Master Session Key (EMSK)after a successful EAP-IKEv2 protocol run, according to Section 5. Tschofenig, et al. Experimental [Page 8]4. Fast ReconnectThis section specifies a "fast reconnect" mode of operation for EAP- IKEv2. This mode is mandatory to implement, but optional to use.The purpose of fast reconnect is to enable an efficient re-authentication procedure that also results in a fresh MSK and EMSK.The "fast reconnect" mode can only be used where an EAP-IKEv2security context already exists at both the server and the peer, and its usage is subject to the local policies. In other words, it canonly be used by an EAP server/EAP peer pair that has alreadyperformed mutual authentication in a previous EAP-IKEv2 protocol run. The fast reconnect mode makes use of dedicated "fast reconnect EAPidentifiers". The idea is that the server indicates its willingness to engage in "fast reconnect" protocol runs in the future byincluding the optional "Next Fast-ID" (NFID) payload in message 5 of a "full" protocol run (see Figure 1), or in message 3 of a "fastreconnect" protocol run (see Figure 2). This NFID payload contains a special EAP identity, denoted Fast Reconnect Identity (FRID) as theNetwork Access Identifier (NAI) in the EAP-Response/Identity message. The FRID contains an obfuscated username part and a realm part. When generating a FRID, the following aspects should be considered:The FRID and therefore the pseudonym usernames are generated bythe EAP server. The EAP server produces pseudonym usernames in an implementation-dependent manner. Only the EAP server needs to be able to map the pseudonym username to the permanent identity.EAP-IKEv2 includes no provisions to ensure that the same EAPserver that generated a pseudonym username will be used on theauthentication exchange when the pseudonym username is used. Itis recommended that the EAP servers implement some centralizedmechanism to allow all EAP servers of the home operator to mappseudonyms generated by other severs to the permanent identity.If no such mechanism is available, then the EAP server, failing to understand a pseudonym issued by another server, can request thepeer to send the permanent identity.When generating FRIDs, the server SHOULD choose a fresh and unique FRID that is different from the previous ones that were used after the same full authentication exchange. The FRID SHOULD include a random component in the username part. The random component works as a reference to the security context. Regardless of theconstruction method, the pseudonym username MUST conform to thegrammar specified for the username portion of an NAI. Also, theFRID MUST conform to the NAI grammar [4]. The EAP servers, which subscribers of an operator can use, MUST ensure that the username part of a FRIDs that they generate are unique.Tschofenig, et al. Experimental [Page 9]The peer MAY use the FRID to indicate to start a "fast reconnect"protocol run. The EAP Identity Response MUST be sent at thebeginning of a "fast reconnect" protocol run. If, in the previoussuccessful "full" (resp. "fast reconnect") EAP-IKEv2 protocolexecution, the server had not included an NFID payload in message 5(resp. 3), then the peer MUST NOT start a fast reconnect protocolrun. On reception of FRID, the server maps it to an existing EAP-IKEv2 security context. Depending on local policy, the server either proceeds with the "fast reconnect" protocol run, or proceeds withmessage 3 of a "full" protocol run. If the server had advertised the FRID in the previous EAP-IKEv2 protocol execution, it SHOULD proceed with a "fast reconnect" protocol run. The peer MUST be able tocorrectly handle a message 3 of a "full" protocol run, even if itindicated a FRID in its EAP Identity Response.Because the peer may fail to save a FRID that was sent in the NFIDpayload (for example, due to malfunction), the EAP server SHOULDmaintain, at least, the most recently used FRID in addition to themost recently issued FRID. If the authentication exchange is notcompleted successfully, then the server MUST NOT overwrite the FRIDthat was issued during the most recent successful authenticationexchange.The EAP-IKEv2 fast reconnect exchange is similar to the IKE-SArekeying procedure, as specified in Section 2.18 of [1]. Thus, ituses a CREATE_CHILD_SA request and response. The SPIs on those twomessages would be the SPIs negotiated on the previous exchange.During fast reconnect, the server and the peer MAY exchange freshDiffie-Hellman values.1. R<-I: EAP-Request/Identity2. R->I: EAP-Response/Identity(FRID)3. R<-I: EAP-Req(HDR, SK{SA, Ni, [KEi], [NFID]})4. R->I: EAP-Res(HDR, SK{SA, Nr, [KEr]})5. R<-I: EAP-SuccessFigure 2: Fast Reconnect Protocol RunFigure 2 shows the message exchange for the EAP-IKEv2 fast reconnect mode. As in the full mode, the EAP server is the initiator and theEAP peer is the responder. The first two messages constitute thestandard EAP identity exchange. Note that, in order to use the "fast reconnect" mode, message 2 MUST be sent. This is in order to enable the peer to indicate its "fast reconnect" identity FRID in message 2. Tschofenig, et al. Experimental [Page 10]If the server can map the FRID to an existing EAP-IKEv2 context itproceeds with message 3. Note that, in this message, the server MAY embed an NFID payload into the encrypted payload to provide a newFRID to the peer. The server MAY choose to perform a full EAP-IKEv2 run, in which case, it would respond with a message that conforms to the format of message 3 in Figure 1.Messages 3 and 4 establish a new EAP-IKEv2 security context. Inmessage 3, the initiator MUST select a new (non-zero) value for theSPI field in each proposal substructure in the SA payload (seeSection 3.3 of [1]). The value of the IKE_SA Responder’s SPI fieldin HDR MUST be the one from the previous successful EAP-IKEv2protocol run. The nonce inside the Nonce payload (Ni) MUST be fresh, and the Diffie-Hellman value inside the Diffie-Hellman payload (ifpresent, KEi) MUST also be fresh. If present, the Diffie-Hellmanvalue MUST be drawn from the same group as the Diffie-Hellman valuein the previous successful full EAP-IKEv2 protocol run. Note thatthe algorithms and keys that are used to construct the Encryptedpayload in message 3 are the same as in the previous successful EAP- IKEv2 protocol run.Upon reception of message 3, the responder (EAP peer) decrypts andverifies the Encrypted payload. If successful (as assumed in Figure 2), it constructs message 4 in a fashion similar to the construction of message 3. The responder MUST choose a new (non-zero) value forthe SPI field in each proposal substructure. Upon reception ofmessage 4, the initiator (EAP server) decrypts and verifies theEncrypted payload. If a correct message 4 is received, then thisprotocol run is deemed successful, and the server responds with anEAP-Success message (message 5).After successful EAP-IKEv2 fast reconnect protocol run, both theinitiator and the responder generate fresh keying material that isused for the protection of subsequent EAP-IKEv2 traffic.Furthermore, both the initiator and the responder MUST generate afresh MSK and EMSK and export them.The new EAP-IKEv2-specific keying material is computed in the sameway as in the full EAP-IKEv2 protocol run, and in accordance withSection 2.18 of [1]. That is, SKEYSEED is computed as SKEYSEED =prf(SK_d (old), [g^ir (new)] | Ni | Nr), where SK_d (old) is the key SK_d from the previous successful EAP-IKEv2 protocol run, Ni and Nrare the nonces (without the Nonce payload headers) that wereexchanged in messages 3 and 4, and g^ir (new) is the newly computedDiffie-Hellman key, if both the values KEi and KEr were present inmessages 3 and 4. The remaining EAP-IKEv2-specific keys (SK_d,SK_ai, SK_ar, SK_ei, SK_er, SK_pi, and SK_pr) are generated as in the full EAP-IKEv2 protocol run.Tschofenig, et al. Experimental [Page 11]The generation of a fresh MSK and EMSK follows the generation of the EAP-IKEv2-specific keys and adheres to the rules in Section 5.Note 1: In EAP-IKEv2, the EAP server initiates the fast reconnectmode and thereby causes fresh session keys to be established.Note 2: It is conceivable that an adversary tries to launch a replay attack against the EAP-IKEv2 fast reconnect mode of operation. Inparticular, the adversary may try to send a previously capturedmessage 3 in a subsequent fast reconnect protocol run. This replayattempt will, however, fail because the keys that the responder will use to verify and decrypt the Encrypted payload are changed withevery successful reconnect protocol run.5. Key DerivationThis section describes how the Master Session Key (MSK) and theExtended Master Session Key (EMSK) are derived in EAP-IKEv2. It isexpected that the MSK and the EMSK are exported by the EAP-IKEv2process and be used in accordance with the EAP keying framework [7]. During an EAP-IKEv2 protocol run, the initiator and the respondergenerate a number of keys, as described above and in accordance with Section 2.14 of [1]. The generation of these keys is based on apseudorandom function (prf) that both parties have agreed to use and that is applied in an iterative fashion. This iterative fashion isspecified in Section 2.13 of [1] and is denoted by prf+.In particular, following a successful EAP-IKEv2 protocol run, bothparties generate 128 octets of keying material, denoted KEYMAT, asKEYMAT = prf+(SK_d, Ni | Nr), where Ni and Nr are the nonces (justpayload without headers) from messages 3 and 4 shown in Figure 1 (in the context of a full EAP-IKEv2 protocol run) or Figure 2 (in thecontext of a fast reconnect EAP-IKEv2 protocol run). Note that only the nonces are used, i.e., not the entire Nonce payload that contains them.The first 64 octets of KEYMAT are exported as the EAP MSK, and thesecond 64 octets are exported as the EMSK.The MSK and EMSK MUST NOT be generated unless an EAP-IKEv2 protocolrun completes successfully. Note that the EAP-IKEv2 method does not produce an initialisation vector [7].Tschofenig, et al. Experimental [Page 12]6. Session ID, Peer ID, and Server IDThe EAP key management framework [7] requires that EAP methods export three information elements, called the Session-ID, the Peer-ID, andthe Server-ID. In EAP-IKEv2, these elements are derived as follows: o The Session-ID is constructed and exported as the concatenation of the following three elements, in this order: (a) the EAP Code Type for EAP-IKEv2 (to be defined by IANA), (b) the contents of theNonce Data field of the Nonce Payload Ni from message 3, (c) thecontents of the Nonce Data field of the Nonce Payload Nr frommessage 4.o In case of a full EAP-IKEv2 protocol run, the Peer-ID isconstructed and exported as the content of the Identification Data field of the Identification Payload IDr from message 6. Note that only the "actual" identification data is exported, as indicated in the Payload Length field; if the Identification Data fieldcontains any padding, this padding is ignored. In case of a "fast reconnect" protocol run, the Peer-ID field is constructed inexactly the same manner, where message 6 refers to the full EAP-IKEv2 protocol run that originally established the securitycontext between the EAP peer and EAP server.o In case of a full EAP-IKEv2 protocol run, the Server-ID isconstructed and exported as the contents of the IdentificationData field of the Identification Payload IDi from message 5. Note that only the "actual" identification data is exported, asindicated in the Payload Length field; if the Identification Data field contains any padding, this padding is ignored. In case of a "fast reconnect" protocol run, the Server-ID field is constructed in exactly the same manner, where message 5 refers to the fullEAP-IKEv2 protocol run that originally established the securitycontext between the EAP peer and EAP server.7. Error HandlingThis section specifies how errors are handled within EAP-IKEv2. For conveying error information from one party to the other, the Notifypayload is defined and used (see Section 8.11).If, in a full EAP-IKEv2 protocol run, authentication fails (i.e., the verification of the AUTH field fails at the server or the peer), but no other errors have occurred, the message flow deviates from thatdescribed in Section 3. The message flows in the presence ofauthentication failures are specified in Appendix A.Tschofenig, et al. Experimental [Page 13]If, in message 3 of a full EAP-IKEv2 protocol run (see Figure 1), the responder receives a Diffie-Hellman value (KEi) that belongs to agroup that is not supported (and in the absence of other errors),then the responder MUST send a message of the form shown in Figure 3 to the initiator. This effectively becomes message 4 in the fullprotocol run.1. R<-I: EAP-Request/Identity2. R->I: EAP-Response/Identity(Id)3. R<-I: EAP-Req (HDR, SAi, KEi, Ni)4. R->I: EAP-Res (HDR, N(INVALID_KE_PAYLOAD))Figure 3: Error Handling in Case of Unsupported D-H ValueThe above message consists of the EAP-IKEv2 header and a Notification payload with the value of the Notify Message Type field value set to 17 (INVALID_KE_PAYLOAD). There is a two-octet value associated with this notification: the number of the selected DH Group in big endian order, as specified in Section 3.10.1 of [1]. This number MUSTrepresent a DH group that is supported by both the initiator and the responder.If, during a full EAP-IKEv2 protocol run (see Figure 1), theinitiator receives a message conforming to Figure 3 instead of theusual message 4, then it MUST check whether or not the indicated DHgroup was proposed in message 3. If it was not, then the initiatorMUST silently discard the message. Otherwise, the protocol continues with a new message 3 that the initiator sends to the peer. In thisnew message 3, the initiator MUST use a Diffie-Hellman value that is drawn from the group that is indicated in the Notify payload ofmessage 4 in Figure 3.If, in the context of use case 4 and during a full EAP-IKEv2 protocol run (see Figure 1), the initiator receives, in message 4, an SK{IDr} payload that decrypts to a non-existent or unauthorised EAP-IKEv2responder identifier IDr*, then the server SHOULD continue theprotocol with a message conforming to the format of message 5. TheAUTH payload in that message SHOULD contain a value that iscomputationally indistinguishable from a value that it would contain if IDr* was valid and authorised. This can be accomplished, forexample, by generating a random key and calculating AUTH as usual(however, this document does not mandate a specific mechanism). Only after receiving message 6, the server SHOULD respond with an Tschofenig, et al. Experimental [Page 14]。

相关文档
最新文档