CN101421972B - Data packet compressing and ciphering method, node and apparatus in remote communication network - Google Patents

Data packet compressing and ciphering method, node and apparatus in remote communication network Download PDF

Info

Publication number
CN101421972B
CN101421972B CN2007800131468A CN200780013146A CN101421972B CN 101421972 B CN101421972 B CN 101421972B CN 2007800131468 A CN2007800131468 A CN 2007800131468A CN 200780013146 A CN200780013146 A CN 200780013146A CN 101421972 B CN101421972 B CN 101421972B
Authority
CN
China
Prior art keywords
bag
compression
encryption
action
compressed
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN2007800131468A
Other languages
Chinese (zh)
Other versions
CN101421972A (en
Inventor
G·佩勒蒂尔
K·斯万布罗
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Telefonaktiebolaget LM Ericsson AB
Original Assignee
Telefonaktiebolaget LM Ericsson AB
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from US11/733,561 external-priority patent/US20070242703A1/en
Priority claimed from US11/733,558 external-priority patent/US8189586B2/en
Application filed by Telefonaktiebolaget LM Ericsson AB filed Critical Telefonaktiebolaget LM Ericsson AB
Priority claimed from PCT/SE2007/050235 external-priority patent/WO2007117217A2/en
Publication of CN101421972A publication Critical patent/CN101421972A/en
Application granted granted Critical
Publication of CN101421972B publication Critical patent/CN101421972B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

A method for operating telecommunication network comprises: performing compression to at least a part of the message header of the package and performing encryption to at least a part of the package on the node sending position, in order to combine the compression and encryption to the degree that the decompression verification and decryption verification to the package are interdependent at the node receiving position.

Description

Packet compression in the telecommunications network and encryption method, node and device
Technical field
1/
The present invention relates to the processing of the packet in the telecommunication, include but not limited in telecommunication, carry out such as the encryption of packet and the operation of compression.
Background technology
2/
Generally be divided into multilayer such as networked systems such as telecommunication systems.For example, International Organization for Standardization has been developed Open System Interconnection (OSI) networking model (being also referred to as the OSI seven layer model), and is described in OSI7498.Seven layers of osi model (as shown in figure 38) layering (is that ground floor is a layer 7 to top layer from bottom) is as follows: physical layer, data link layer (i.e. " link " layer), network layer, transport layer, session layer, presentation layer and application layer.In (original text) specification used " modellayer (model layer) " and Modellayer (model layer) quite or similar, no matter use the network technology standard of this model layer whether to refer explicitly to osi model.In each model layer, the function of each layer can be carried out by one or more entities or function.For example, on this meaning, in each model layer, can exist such as work done during compression ergosphere, encryption function layer and various functional layers such as verification and functional layer.
3/
Because the immense success of the Internet, Internet protocol (IP) is used in various links has become challenging task.The IP agreement is used the IP bag, and the IP bag generally has the net load of the substantial user data of net load net load carrying and " header " that adds usually in the original position of IP bag.The general carrying of header helps to handle one or more layers the information of IP packet of passing osi model.
4/
Because the header of IP agreement is quite big, and the IP protocol application is for example often not simple as cellular link in narrow band link.For example, consider by the agreement that is used for ip voice (VoIP:voice-over-IP) (IP, UDP, RTP) the normal speech data of Chuan Songing, wherein header can occupy the about 70% of bag, this causes the service efficiency of this link very low.
A. header-compressed: general introduction
6/
Header-compressed is to make such as economically feasible key factors of wireless IP operation such as speech business and video traffics.This term of header-compressed (HC) is encompassed in and makes carrying based on the minimized technology of the used necessary bandwidth of the information in the header of every jumping (per-hop) on the point-to-point link.The header-compressed solution is developed the efficient of improving this class business by the robust header compression of IETF (ROHC) working group.
7/
Generally speaking, header compression method has used above 10 years in the Internet community; Existing several agreements commonly used, RFC1144 (the tcp/ip header of link " compression low-speed serial " (Van Jacobson of Van Jacobson for example, Compressing TCP/IP Headers forLow-Speed Serial Links, IETF RFC1144, IETF Network Working Group, February1990)), RFC2507 (Mikael Degermark, Bj
Figure G2007800131468D0002192720QIETU
" IP header-compressed " (Mikael Degermark, Bj of rn Nordgren, Stephen Pink
Figure 2007800131468100002G2007800131468D0002192720QIETU
RnNordgren, Stephen Pink; IPHeader Compression, IETF RFC2507, IETFNetwork Working Group, and RFC2508 (the IP/UDP/RTP header of link " compression low-speed serial " (Steven Casner of StevenCasner, Van Jacobson February1999)), Van Jacobson, Compressing IP/UDP/RTP Header forLow-Speed Serial Links; IETF RFC2508, IETF Network Working Group, February1999)).
8/
The fact that the header-compressed utilization is such, promptly some fields in the header do not change in stream, perhaps change with little and/or predictable value.Header compression scheme is utilized these features, only at the initial static information that sends, sends to bag with its absolute value or as difference from bag and change field.As for the information of completely random, then must send with the form of not doing any compression.
9/
Header-compressed is characterized by two reciprocations between state machine usually, and state machine is a compressor reducer and another state machine is a decompressor, and each state machine keeps some and the relevant information of compressed stream in context.
10/
Compressed context comprises and keeps relevant information about past bag, and compresses and the decompress subsequent bag with this information." robust header compression (ROHC): framework and four conventions (profiles): RTP, UDP, ESP and not compression " (Carsten Bormann as people such as CarstenBormann among the IETF RFC3095 in April calendar year 2001, et al.RObust HeaderCompression (ROHC): Fram ework and four profiles:RTP, UDP, ESPand uncompressed.IETF RFC3095, April2001) described:
The context of compressor reducer is to be used for the state of header compression.The context of decompressor is to be used for decompressing the state of header.When which using, any in these two or the combination of these two are commonly called " context " clear.Context contains the relevant information from the previous header in the packet data streams, such as static fields and the possible fiducial value that is used to compress and decompresses.In addition, the additional information of describing packet data streams also is contextual part, for example how to change about the IP identifier field and about the information of sequence number between typical bag and the bag or time mark increase.
11/
Keeping compressor state and decompressor states (being called context), consistent with each other to keep header overhead to hang down as far as possible simultaneously be challenging task.A state machine is arranged as compressor reducer, and a state machine is arranged as decompressor.The compressor state machine directly influences the height of compression efficiency, because it is the important component part of logic that is used to control the selection of the type of compressed package that will send; The effect of decompression states machine mainly provides the logic that is used for feedback (if available) and discerns the bag type that can attempt decompressing.
12/
Providing method to be proved to be successful the successful bag of decompression to decompressor is the updating context bag.Such bag can be verified owing to decompress, so can upgrade context.For ROHC, updating context bag type is carried cyclic redundancy code (CRC) in its form; This be the verification that on the original, uncompressed header, calculates and.This CRC is used to check the decompression success of each bag; When being proved to be successful, this context can be updated.
13/
Rely on other method and guarantee the successful bag that decompresses, promptly do not provide method to be proved to be successful the bag of the successful packet format of decompression to decompressor, this bag is an independent packet, only carries the required information of decompression of self, then should bag.These bags do not upgrade context.
14/
Header-compressed uses sequence number to come each bag of unique identification.In header-compressed, come packed field based on the function of sequence number (SN) usually.Both can from agreement, derive this sequence number (for example, RTP SN) that is in compression, also can produce this sequence number by compressor reducer.In this article, when the difference between the two was uncorrelated, this sequence number was called main sequence number (MSN).
15/
Following hypothesis is used in the design of early stage header-compressed convention (header compression profile): the channel between compressor reducer and decompressor does not reorder to the header-compressed bag, and requires this channel to be kept for each packet sequencing of compressive flow.The reason of this hypothesis is that initial consideration uses the potential candidate's of RoHC channel to guarantee submitting according to the order of sequence of bag; This hypothesis helps to improve compression efficiency and packet loss tolerance limit (tolerance against packet loss), and this two project is marked on and is listed in peak demand at that time.
16/
Except other improves, the current RoHCv2 convention of developing will be handled not in-order the submitting and coding method itself between the interior compression end points of compression protocol.
17/
Many dissimilar compressions can be used more than link layer.These compressions comprise net load compression (for example referring to Pereira R. " using the IP net load compression of DEFLATE " (Pereira R., IP Payload Compression Using DEFLATE, IETF RFC2394, December1998); And " using the IP net load compression of LZS " (Friend R.et R.Monsour of Friend R and R.Monsour, IP Payload Compression Using LZS, IETF RFC2395, December1998)), signaling compression is (for example referring to " signaling compression (SigComp) " (Price of people such as Price R., R.et al., Signalling Compression (SigComp), IETF RFC3320, January2003)), header is removed and reproduce and header-compressed.For example, about header-compressed " tcp/ip header of compression low-speed serial link " (Van Jacobson referring to Van Jacobson, Compressing TCP/IP Headers forLow-Speed Serial Links, IETF RFC1144, IETF Network Working Group.February1990); Mikael Degermark, Bj
Figure 2007800131468100002G2007800131468D0002192720QIETU
" IP header-compressed " (Mikael Degermark, Bj of people such as rn Nordgren, Stephen Pink
Figure 2007800131468100002G2007800131468D0002192720QIETU
Rn Nordgren, Stephen Pink; IP Header Compression, IETF RFC2507, IETF Network Working Group, February1999); " the IP/UDP/RTP header of compression low-speed serial link " (Steven Casner of Steven Casner and Van Jacobson, Van Jacobson, CompressingIP/UDP/RTP Headers for Low-Speed Serial Links, IETF RFC2508, IETFNetwork Working Group, February1999); " being used for high time delay, packet loss and the enhancing compressed rtp (CRTP) of the link that reorders " (Koren T. of people such as Koren T., Casner S., Geevarghese J., Thompson B. and P.Ruddy, Casner S., Geevarghese J., Thompson B.and P.Ruddy, Enhanced Compressed RTP (CRTP) for Links with High Delay, Packet Loss and Reordering, IETFRFC3545, IETF Network Working Group, July2003); " robust header compression (ROHC): framework and four convention: RTP, UDP, ESP and not compressions " (Carsten Bormann of people such as Carsten Bormann, et al.RObust Header Compression (ROHC): Framework and four profiles:RTP, UDP, ESP anduncompressed.IETF RFC3095, April2001); " robust header compression (ROHC): the compression convention that is used for IP " (Jonsson L.andG.Pelletier of Jonsson L. and G.Pelletier, RObust Header Compression (ROHC): A compression profilefor IP, IETF RFC3843, June2004); " robust header compression (ROHC): the agreement that is used for UDP-Lite " of Pelletier G. (Pelletier G., RObust HeaderCompression (ROHC): Profiles for UDP-Lite, IETF RFC4019, April2005); And " robust header compression (ROHC): convention or TCP/IP, Internet draft (in carrying out) " (Pelletier of people such as Pelletier G., Sandlund K. and L.Jonsson, G., Sandlund, K.and L.Jonsson.Robust Header Compression (ROHC): AProfile orTCP/IP, Internet Draft (work in progress).＜draft-ietf-rohc-tcp-11.txt 〉, January2006).Arbitrary type of these compression types can be designed to be used in sequence number and verification and.
18/
Also can use other optimization (as the compression of other type) further to strengthen the performance of bandwidth-limited systems.
B. header-compressed: check
20/
Robust header compression is used the verification of going up or calculating at header compression (for example, in the initialization bag) and (CRC) on header compression not (for example, compressed package in).Use verification and verify correct decompression on the decompressor.More particularly, for example, header-compressed is used verification usually and is verified the result that it decompresses and attempts.This verification and can be the verification of calculating for the uncompressed state of just compressed information and, perhaps also can be for be sent in verification that information between compressor reducer and the decompressor (compressed information, not any information in the combination in any of compressed information or compression protocol information or these three kinds of information) calculates and.
21/
Equally, before decryption process, use frame check and sequence (FCS) usually, can cause incorrect encryption context to guarantee the information of not submitting to decipherment algorithm.
22/
Nd residual error may cause losing to any function discussed above synchronously, this depends on employed algorithm.
23/
Header-compressed can benchmark principle safe in utilization be guaranteed can not be owing to the context that packet loss loses between compressor reducer and decompressor is synchronous.Based on replying that decompressor is received, compressor reducer be sure of that decompressor has successfully upgraded context from the updating context bag.Yet most of bag types of using with safety benchmark principle are independent, and the renewal context therefore is out of the ordinary.
24/
Compressor reducer usually only receive come from decompressor be used for just upgrade its compressed context after the replying of updating context bag (MSN with feedback message identifies).
25/
Decompressor upgrades its context with the Cyclic Redundancy Check that carries in the header compression (as if appearing in the packet format, then not necessarily true with safe benchmark operate the time) usually behind the result of check solution compression.Be subjected to rate limit, decompressor is replied renewal to compressor reducer usually.
C. secure/encrypted
27/
Use the evolution of new architectural model and the node number that design inclination comprises in the minimizing transmission path, and tend to use the interface of Open Standardization.This tradition of transferring to have improved again between function is separated, and has also created the new credible model for fail safe.Although fail safe generally is regarded as the end-to-end function between the communication host in the Internet example, security mechanism also is normally placed in the low model layer to solve rudimentary safety problem.
28/
With regard to fail safe, the encryption of packet data streams requires transmitting terminal and receiving terminal to keep encrypted state information usually.This information is commonly referred to as the encryption context.
29/
Encryption key can be this contextual part, for example encrypt conversion and can directly use " session " key, and another " master " key can be used to derive this session key.This master key is provided with secured fashion by IKMP usually.Other parameter that can find in context is for example encryption algorithm identifiers, session indicators, counting symbol, key length parameter etc. often.Many parameters in these parameters are exclusively used in the valid password conversion.
30/
Some algorithm can be derived the session key that is used to wrap based on the sequencing information related with bag.For example, real-time security benchmark agreement (SRTP) (referring to Fig. 1) derives the index of this bag based on the RTP sequence number of carrying in the bag.SRTP is the OSI application layer protocol, and predetermined being used for providing end-to-end safe floor to the real-time application that uses the RTP/RTCP agreement, as shown in Figure 2.For example, (IETF RFC3711 has description in March2004) to SRTP for Baugher M.et al., The Secure Real-time Transport Protocol (SRTP) at people such as Baugher M. " Security Real Time Protocol (SRTP) ".Affirmed in the literary composition that there is restriction in the derivation to cipher key index, because the derivation of right value is reordered sensitivity also to residual bit mistake sensitivity with the contextual renewal of encryption for big bag.Though the described amount of reordering reaches 2 15The order of individual bag and unlikely appearance, but this has highlighted existing undetected bit mistake may influence for safe floor, bag wrong in safe floor can upgrade the encryption context by index of reference mistakenly in the time interval of mistake, and destroys the deciphering of subsequent packet.
31/
These algorithms keep this sequencing information as encrypting contextual part, therefore, and to the correct index of this information and to be updated between the crypto endpoint must be robust.In order to use correct decruption key, must know right-on ordering.Opposite with the situation of the header-compressed of using RoHC, encrypt context in the time of most and under the situation that the operation that does not have arbitrary form is successfully checked, be updated.This needs robust mechanism to guarantee that ordering is correctly kept usually.In SRTP, can find about such encryption conversion with in case know these encryption conversions of session key and how carry out the example of encrypt and decrypt.
32/
So encryption function requires the reception order of encrypted packet identical with the order of transmission of these bags, perhaps can derive this information at least, to pick up correct decruption key.Otherwise encrypted data will be not correctly decrypted, and encrypt context and will become asynchronously, thereby give subsequent packet with error propagation.
D: compression: synchronously
34/
Fig. 3 shows the exemplary of carrying out compressor reducer (top) Yu the decompressor (bottom) of work with safe benchmark principle.Exchange compressed package (sequential axle) as time passes, and follow the sliding window of concrete event update safety benchmark (SN) LSB.Notice that sliding window constantly can comprise more than one value at some, but only have a safe benchmark that is used for the compression and the decompression of specific fields all the time.
35/
The target of compression peer (peers) is synchronous with certain benchmark maintenance of the compression/de-compression that is used for specified packet all the time.Particularly, followingly everyly be suitable for and in Fig. 3, reflected:
● decompressor can only be checked the successful decompression of updating context bag (bag of renewable safe benchmark).
● decompressor can not be checked the successful decompression of independent packet (not upgrading the bag of safe benchmark).
● when receiving from the replying of decompressor, compressor reducer upgrades the sliding window of its safe benchmark.From sliding window, remove previous benchmark (reply and/or dont answer), have only up-to-date that benchmark of replying to be left safe benchmark.
● when receiving the bag that its LSB lacks than previous bag, decompressor upgrades the sliding window of its safe benchmark, and this shows that the benchmark of before having replied with this decompressor done compression.Be left safe benchmark so have only it to reply the up-to-date benchmark that is sent out.
36/
The present art when being somebody's turn to do " optimization method " corresponding to use, compressor reducer always upgrades its context.This be because all bags that are sent out all comprise header compression not the verification that calculates and.This verification and decompressed device are used for the result of check solution compression procedure.If be proved to be successful, decompressor just upgrades its context.
37/
Encrypt contextual the present art corresponding to upgrading, use being seen highest sequence number when decrypted packet usually, also use upset counting symbol (roll-over counter) and other parameters, come to encrypt context for handled each bag upgrades.When carrying sequencing information on link and other enciphered messages, encrypt updating context and depend critically upon the assurance of submitting according to the order of sequence, very low residual bit error probability usually; Encrypt updating context and have no idea to check the result of decryption process usually.
E: Radio Access Network: general introduction
39/
In typical cellular wireless system, wireless user equipment (UE) communicates via Radio Access Network (RAN) and one or more core networks.Wireless user equipment (UE) can be such as mobile phone (" honeycomb " phone) and the travelling carriage that has the notebook computer of portable terminal, therefore, wireless user equipment units can be to use Radio Access Network carry out voice and/or data communication such as portable, pocket, hand-held, mobile device that be built in computer or vehicle-mounted.As selection, this wireless user equipment units also can be the fixed wireless device such as the fixed cellular equipment/terminal of part of wireless local loop etc.
40/
Radio Access Network (RAN) covers the geographic area that is divided into the sub-district, and base station services is in each sub-district.The sub-district is the geographic area of the wireless coverage that provided by the wireless base station device at the base station site place.Each sub-district is by unique identity code sign, and this identity code is broadcasted in the sub-district.The base station communicates by air interface (as radio frequency) and subscriber equipment (UE) in base station range.In Radio Access Network, several base stations generally connects (for example, by above-ground route or microwave) to radio network controller (RNC).Sometimes be also referred to as the radio network controller supervision of base station controller (BSC) and coordinate the various work of a plurality of connected base stations.Radio network controller generally is connected to one or more core networks.
41/
An example of Radio Access Network is Universal Mobile Telecommunications System (UMTS) grounding wireless access network network (UTRAN).UMTS is a third generation system, and its some aspect is based upon on the wireless access technology of the global system for mobile communications (GSM) that is considered to be in the Europe exploitation.UTRAN essence is the Radio Access Network that Wideband Code Division Multiple Access (WCDMA) is provided to subscriber equipment (UE).Third generation partner program (3GPP) promised to undertake further develop UTRAN with based on the Radio Access Network technology of GSM.
42/
This core network has two business fields, and RNC has the interface with these two business fields.Universal Mobile Telecommunications System (UMTS) grounding wireless access network network (UTRAN) comprises that the circuit switching connection is connected with packet switch.Thus, in UTRAN, circuit switching connects and comprises the radio network controller (RNC) that communicates with mobile switching centre (MSC), this center is connected to connection-oriented external core network again, and this network can be (for example) public switch telephone network (PSTN) and/or composite service digital network (ISDN).On the other hand, in UTRAN, packet switch connects and comprises the radio network controller that communicates with Serving GPRS Support Node (SGSN), Serving GPRS Support Node, this contact (for example is connected to packet network by backbone network and Gateway GPRS Support Node (GGSN) again, the Internet, X.25 external network).
43/
Several interfaces of being paid close attention to are arranged in UTRAN.Interface between radio network controller (RNC) and the core network is called as " Iu " interface.Interface between radio network controller (RNC) and its base station (BS) is called as " Iub " interface.Interface between user interface (UE) and base station (BS) is called as " air interface " or " radio frequency interface " or " Uu interface ".
44/
Fig. 4 shows the example of traditional architectures, the example that is to use the UTRAN architecture that illustrates here.What particularly paid close attention in the UTRAN architecture is that the tradition that is divided into different nodes between the function is separated: RNC handling ordered when harmless reorientation is supported (optional), thereby increased the expense that is used for a sequence number.Be encrypted in the Node B (NodeB) and carry out, and encryption requires each SDU to submit according to the order of sequence to keep the encryption context.It is synchronous not discharge (loose) in order to ensure this encryption, uses L2 frame check and sequence (FCS) usually, increases by the eight extra hytes in order to transmit on air interface.
45/
Hybrid ARQ (Hybrid-ARQ) mechanism requires to detect reliably the bit mistake between the transmission period of each code character, because it is necessary for the failure of RLC PDU detected transmission with request retransmission.Therefore, suppose that the residual bit-error-rate (BER) after the H-ARQ is very low.
F. system evolved: general introduction
47/
Third generation partner program (3GPP) is also being formulated the long-run development of third generation cell system, for example to satisfy the demand for higher user's bit rate.In September, 2006,3GPP has finally finished the UTRA that is called as evolution and the research project of UTRAN.The target of the research is defined the long-run development of 3GPP access technology in future (LTE).Also carried out being used for the research of system architecture evolution (SAE), to be one of exploitation with the 3GPP system development become the target of the research has high data rate more, the framework of the system of the multiple wireless access technology of support optimized of low latency, bag more.
48/
Evolution UTRAN comprises the evolution base station node, and for example enode b is eNB, and the evolution base station node provides evolution UTRA user plane (U-plane) and control plane (C-plane) protocol terminal to subscriber equipment (UE).As shown in Figure 5, eNB presides over following function: (1) be used for RRM (for example, radio bearer control, wireless allow to enter control), connect that mobility is controlled, the function of Dynamic Resource Allocation for Multimedia (scheduling); (2) for example comprise Mobility Management Entity (MME) to eNB assigned paging message; (3) user plane entity (UPE) is comprising the U plane bag termination of the IP header-compressed of customer traffic and encryption, paging reason (paging reasons) and support the exchange of the ambulant U of UE plane.
49/
The eNB node interconnects by X2 interface.The eNB node also is connected to evolution bag core (EPC) by the S1 node.IAD (aGW) in the S1 interface support package core and the contact of the multi-to-multi (many-to-many) between the eNB node.The S1 interface provides the access to the evolution RAN Radio Resource of the transmission that is used for user plane and control plane traffic carrying capacity.The S1 datum mark makes MME separate with UPE can to carry out, also MME that can implement to make up and UPE solution.
50/
What paid close attention to especially in the current suggestion of SAE/LTE architecture as shown in Figure 5, is the removal of RNC.The removal of RNC node causes such fact, and promptly encryption function is set in the same node now with the PDCP function of presiding over header compression function, for example in aGW or at the eNB node.Encryption function and PDCP function all terminate in the subscriber equipment (UE) of the other end.In other words, the interface between aGW and the eNB node is considered to incredible.The insincere eNB node that means may be impaired physically.The eNB node is in remote location usually, and if the eNB node impaired, so a large amount of user profile just might be stolen.Thereby the S1 interface requirement is applied to customer service with encryption, propagates to UE again.Secure tunnel on the S1 interface does not solve the credit problems of eNB node.
51/
One is that S1 interface or air interface (H-ARQ) may (when PDCP is among the aGW) produce unsorted bag about the problem that reorders between encryption and/or PDCP entity.Owing to encrypt and require sequencing information accurately, so must on air interface, keep or transmit the overhead that is used to sort.Under the situation about relocating that will support can't harm, also can in PDCP, require extra ordering expense.
52/
Fig. 6 represents the third party suggestion of an example about PCDP function and SAE/LTE architecture.In the SAE/LTE architecture, the PDCP function also can be located in the eNB node, also relates to same problem in this case.
G. many standalone feature layers
54/
The functional stratification that in each model layer, can have as previously mentioned, a plurality of standalone feature layers that are divided into separation.In model layer, form a plurality of functional layers and can produce sizable expense.This is essential in conventional art, because function often is assigned to different physical nodes, the situation in the example of evolution UTRAN (E-UTRAN) architecture is the same as outlined above.
55/
Consider conventional demixing technology, and at model layer 2 encryptions and current E-UTRAN/SAE/LTE architecture, each layer functions (for example encrypt) uses the independent mechanism of itself to keep ordering and carry out and encrypt, may with irrespectively match such as other functions such as header-compressed with the PDCP ordering.In order to ensure keeping correct encryption context, it is normally essential that the residual error on the H-ARQ agreement detects; This is also irrelevant with the potential check mechanism of other layer.
56/
The present art of header-compressed aspect is RoHC, " robust header compression (ROHC): framework and four convention: RTP referring to people such as Carsten Bormann, UDP, ESP and not compression " (Carsten Bormann, et al.RObust Header Compression (ROHC): Framework and four profiles:RTP, UDP, ESP anduncompressed.IETF RFC3095, April2001), also referring to Pelletier G., people's such as Sandlund K. and L.Jonsson " robust header compression framework, Internet draft (in carrying out) " (Pelletier G., Sandlund K.and L.Jonsson, The Robust HeaderCompression (ROHC) Framework, Internet Draft (work in progress),＜draft-ietf-rohc-rfc3095bis-framework-00.txt 〉, December2005).RoHC use at present its oneself sequence number and its own verification with.RoHC be applicable to too the ordering that relies on model layer 2 and verification and the encryption of the present art.RoHC does not handle and reorders at present, but is being devoted to the exploitation of this technology.With regard to the encryption type that this idea is paid close attention to, that represent the present art is SRTP; But SRTP works in the OSI application layer and does not combine with header-compressed.
57/
Consider conventional demixing technology, encrypt to use its oneself independent mechanism to keep ordering, encryption may combine with the PDCP ordering that has nothing to do with header-compressed, and in encryption, require on the H-ARQ agreement, to detect residual error guaranteeing from being used for the encryption context robust ground selection/derivation session key of crypto process, and encryption and header compression function have nothing to do.Encrypt with header-compressed and handled independently of each other always.A possible cause is that some function (for example often acts on connection, encrypt, reorder) on, except from the request of this layer self (for example, based on QoS request), be independent of and be difficult for perceiving them and handling and to the not homogeneous turbulence of other layer forwarding, as illustrated in Fig. 7.
58/
Fig. 8 illustrates the problem when pre-treatment by way of example.Even in the LTE/SAE canonical system, even also can cause remarkable expense at the functional stratification of same intranodal.For the expense of lower floor, following table 1 shows layer 2 function and corresponding expense (is unit with eight hytes).
59/
Table 1
● layer 2FCS: 3-4 eight hytes (handling the bit mistake)
● layer 2 (encryption): 2 eight hytes (reordering+encryption key)
● Layer 2PDCP SN:2 eight hyte (harmless reorientation-PDCP sequence number SeqNum PDU)
Overhead: 7+ eight hytes
60/
Therefore, target of the present invention is to provide one or more nodes, device, system, method or the technology in order to the related expense of the minimizing and the function (for example, link layer functionality) of model layer 2.
Summary of the invention
61/
A kind of operation comprises that the method for the telecommunications network of sending node and receiving node comprises, at least a portion at the sending node place to the header portion of bag is carried out compression and at least a portion of bag is carried out deciphering, thereby makes this compression and this encryption be attached to decompression checking and the degree of deciphering the affirmation interdependence at the bag at receiving node place.
62/
In its a kind of form, the compressed context that present technique relates to the transaction using combination or share and/shared service with encrypt contextual portfolio management.In the first routine mode of this form, combination or the transaction shared and/shared service comprise to at least a portion of compressed bag and to the part of encrypted bag is determined compound verification with.In the second routine mode of this form, the transaction of combination comprises that with compression function and the encryption function of sequence number as the information of sharing this sequence number is to derive session key to use by encryption function.In addition, in the second routine mode, to at least a portion of compressed bag also (alternatively) to at least a portion calculation check of encrypted bag and.In this dual mode, verification and help squeeze operation and the checking of cryptographic operation.
63/
In first mode, for the bag that enters at the sending node place, to the compressed candidature part that enters bag and encrypt candidate's net load partly determine initial verification and.This initial verification and be comprised in one and compressed and pass through in the bag to the interface that small part has been encrypted to small part., at receiving node place receive when interface pass through bag, carry out deciphering and decompress to obtain to restore bag thereafter.To restore bag determine the checking verification and, and by this checking verification and with initial verification and relatively come to determine these two checking of deciphering and decompression.
64/
In second mode, for the bag that enters at the sending node place, to the compressed candidature that enters bag partly determine initial verification and.This compressed candidature partly comprise be comprised in initial verification and in sequence number.This sequence number is included in one and has compressed and pass through in the bag to the interface that small part has been encrypted to small part.At receiving node place receive interface when passing through bag obtain this sequence number thereafter.Carrying out deciphering and decompressing with after obtaining to restore bag, to restore bag determine the checking verification and.By this checking verification and with initial verification and relatively come determine the decompression checking.
65/
In its a kind of form, present technique relates to safety (for example, can encrypt) header-compressed.For example, this form comprises that a kind of operation comprises the method for the telecommunications network of sending node and receiving node.This method comprises, for the bag that enters at the sending node place, encrypts header compression except that the field of the header with header compression channel information, and passes through at interface and to comprise the header compression of having encrypted in the bag.This method also comprises, passes through bag for the interface that receives at the receiving node place, and from the field acquired information of header with header compression channel information, and the deciphering interface passes through the header compression of bag.
66/
In its a kind of form, the shared transaction of present technique and/or shared service are to share information, such as shared sequence number.In other words, in this form of present technique, a functional layer is used the sequencing information that comes from another functional layer.Basically, sequencing information by any one use in encryption and/or header-compressed and/or net load compression and/or the signaling compression is derived from another process, this another process be encryption and/or header-compressed and/or net load compression and/or signaling compression and/or transmitting in order of being used for wrapping any another.
67/
In first mode that sequence number is shared, header compressor is the header of compressed package at first, transfers its sequence number to crypto process then.Crypto process is derived session key with this sequence number, and should bag with encryption.
68/
In second mode that sequence number is shared, encrypt (password) function sequence number can be used, secondly encryption function (in its cryptographic operation) will be used for header compressor to this sequence number.Header compressor with this sequence number as it MSN and compress this bag, and with this compressed package give crypto process.Crypto process is derived session key with this same sequence number then, and carries out encryption.If be suitable for, then this sequencing information by carrying in cryptographic protocol.
69/
Therefore, in a kind of form of described in the text shared transaction and/or shared service technology, a layer (as link layer) (is for example represented a plurality of functional layers, encrypt and/or net load compression and/or header-compressed) carrying sequencing information and verification and, described a plurality of functional layers are moved in same endpoints and shared same information.As another form, common at least in part the processing encrypted and header-compressed, with the session key of giving crypto process derive algorithm be provided between compression/crypto endpoint reorder with packet loss on robustness.And, in order to make more robust of selection that encryption key derives, under the cooperation of the context management of header-compressed, encrypt context management.
70/
Present technique described in the literary composition also comprises based on RoHC ordering introduces safety function (for example, encrypting) in that header compression protocol is inner, and robust and have expense ground and realize this safety function.For example, present technique comprises the current mechanism that encryption context management function is attached to the header-compressed context management of convention.In addition, present technique comprises based on RoHC and for the institute's protocols having on this channel and introduces safety function (encrypting and authentication) fully to protect header compression channel.Present technique also comprises the relatively complete security solution that is used for RoHC.
Description of drawings
71/
In the description more specifically of following preferred embodiment of setting forth with reference to accompanying drawing, the present invention is aforesaid and other target, feature and advantage is apparent, and the Reference numeral indication in the accompanying drawing spreads all over the same section of different views.Accompanying drawing needn't necessarily draw to scale, and it focuses on setting forth on the principle of the present invention.
72/
Fig. 1 is the schematic diagram that the example of explanation SRTP key derives.
73/
Fig. 2 is the schematic diagram of explanation Security Real Time Protocol (SRTP).
74/
Fig. 3 is the schematic diagram of the particular problem that relates in the use of concrete example of the System Framework that defines in 3GPP TR25.813 of explanation.
75/
Fig. 4 is a schematic diagram of using conventional Radio Access Network (RAN) architecture of UTRAN example architecture here, shows the layering expense.
76/
Fig. 5 is the schematic diagram that the function separation of the architecture that is used for system architecture evolution/Long Term Evolution (SAE/LTE) is described.
77/
Fig. 6 is the schematic diagram of explanation about example third party's suggestion of PDCP function and SAT/LTE architecture.
78/
Fig. 7 be the explanation tape verifying and, encrypt and the schematic diagram of the layered approach of compression.
79/
Fig. 8 is the schematic diagram of explanation unsolved layering overhead issues in telecommunications network.
80/
Fig. 9 A is the schematic diagram of telecommunications network, and wherein, first function of node and second function are used general shared transaction and/or shared service to reduce and unwrapped pin.
81/
Fig. 9 B is the schematic diagram of telecommunications network, wherein, same model layer but be assigned to first function of a plurality of nodes that comprise single sending node and second function and use general shared transaction and/or shared service to reduce to unwrap pin.
82/
Figure 10 is the schematic diagram of telecommunications network, wherein, provide and the configuration link layer protocol carry out first function, second function and shared transaction.
83/
Figure 11 is the schematic diagram of telecommunications network, wherein, shares transaction and/or shared service and comprises the shared information of being used by a plurality of functions of node.
84/
Figure 12 is the schematic diagram of telecommunications network, wherein, shares transaction and/or shared service and comprises by the initial sequence number of compression function.
85/
Figure 13 is the schematic diagram of telecommunications network, wherein, shares transaction and/or shared service and comprises by the initial sequence number of encryption function.
86/
Figure 14 is the schematic diagram of telecommunications network, wherein, sharing transaction and/or shared service comprises not only the second portion executable operations of bag but also to second function of first's executable operations of bag, described bag is subjected to first function operations at least in part.
87/
Figure 15 is the schematic diagram of telecommunications network, wherein, shares transaction and/or shared service and comprises that described bag is compressed at least in part to the encryption function of a part of executable operations of bag.
88/
Figure 16 is the schematic diagram of telecommunications network, wherein, share transaction and/or shared service comprise determine to share verification and.
89/
Figure 17 is the schematic diagram of telecommunications network, wherein, share transaction and/or shared service comprise at least a portion of the header of bag and at least a portion of the net load of bag determine verification and.
90/
Figure 18 is the schematic diagram of telecommunications network, wherein, sharing transaction and/or shared service for the first of wrapping (for example comprises, the header of bag) at least a portion determine verification and, this at least a portion is included in the parameter of being used by second function in the operation of the second portion of this bag.
91/
Figure 19 be the described action of explanation explanation or incident compressed context with the first routine mode of encrypting contextual portfolio management in relate to as basic, the representational action of example or the flow chart of incident.
92/
Figure 20 is the flow chart of the example action of the sending node place execution of explanation in the example embodiment of first mode of Figure 19.
93/
Figure 21 represents the bag description corresponding with the action of Figure 20.
94/
Figure 22 is the flow chart of the example action of the receiving node place execution of explanation in the example embodiment of first mode of Figure 19.
95/
Figure 23 represents the bag description corresponding with the action of Figure 22.
96/
Figure 24 be the explanation compressed context with the second routine mode of encrypting contextual portfolio management in relate to as basic, the representational action of example or the flow chart of incident.
97/
Figure 25 is the flow chart of explanation in the example action of the sending node place of the example embodiment of second mode of Figure 24 execution.
98/
Figure 26 represents the bag description corresponding with the action of Figure 25.
99/
Figure 27 is the flow chart of explanation in the example action of the receiving node place of the example embodiment of second mode of Figure 24 execution.
100/
Figure 28 represents the bag description corresponding with the action of Figure 27.
101/
Figure 29 be explanation as the non-limiting action of example or the flow chart of incident, described action or incident can be carried out in the example stand-by mode of the bag of the encryption with its header compression.
102/
Figure 30 is the flow chart of the bag content when describing in wrapping in compression and cryptographic operation differentiation corresponding to the exercises of Figure 29.
103/
Figure 31 is explanation as example, nonrestrictive, the action that can carry out in handling the by way of example that is received bag that its header compression done to encrypt or the flow chart of incident.
104/
Figure 32 is the flow chart of the bag content when describing in wrapping in compression and cryptographic operation differentiation corresponding to the exercises of Figure 29.
105/
Figure 33 represents the example embodiment based on RoHC.
106/
Figure 34 separates with the compression procedure of combination or merging and the schematic diagram that crypto process compares encrypting with the routine of compression.
107/
The schematic diagram of the order of Figure 35 action that to be explanation carry out for sending node and receiving node or incident, described sending node and receiving node have the compression procedure and the crypto process of combination and merging, and wherein sequence number is shared by compression procedure and crypto process.
108/
Figure 36 is that explanation has the action that relates in the sending node of combination or compression procedure that merges and crypto process or the flow chart of incident, and wherein sequence number is shared.
109/
Figure 37 is that explanation has the action that relates in the receiving node of combination or compression procedure that merges and crypto process or the flow chart of incident, and wherein sequence number is shared.
110/
Figure 38 is the schematic diagram of seven layers of osi layer model.
Embodiment
111/
In the following description, the unrestricted purpose for explanation has been illustrated the detail such as specific architecture, interface, technology etc., so that thorough understanding of the present invention to be provided.Yet, those skilled in the art know that the present invention can be applied in other embodiment different with these details.That is, those skilled in the art can design the various devices that comprise in principle of the present invention and main idea of the present invention and the scope, even described device is not here expressed.In some instances, omitted detailed description, in order to avoid make description of the invention unintelligible because of nonessential details to well-known equipment, circuit and method.Here all statements of describing principle of the present invention, form and execution mode and specific embodiments of the invention intend to comprise on its structure with function on the person of being equal to.In addition, determine that such person of being equal to had not only comprised the at present known person of being equal to but also had been included in the person of being equal to that will develop future, for example, can carry out same function and regardless of its structure any unit that is developed how.
112/
Therefore, for example, it will be appreciated by those skilled in the art that block diagram can represent to embody the concept map of the illustrative circuit of present technique principle here.Equally, also be appreciated that the various processes of representative such as arbitrary procedure figure, state permutation graph, false code, therefore described process can roughly be illustrated in the computer-readable medium, can be carried out by computer or processor, and no matter whether this computer or processor are clearly illustrated.
113/
By using specialized hardware and can carrying out the software that is associated with suitable software, can provide the function of the various devices that comprise the functional module that is labeled or is described as " processor " or " controller ".When providing by processor, can provide these functions by single application specific processor or a plurality of independent processor, some functions wherein can be that share or distributed.And, clearly use term " processor " or " controller " should not be interpreted into exclusively to refer to can executive software hardware, but can comprise Digital Signal Processing (DSP) hardware without limitation, be used for read-only memory (ROM), random-access memory (ram) and the nonvolatile memory of storing software.
1.0: the transaction of a plurality of function sharings
115/
Fig. 9 A shows two nodes 20,22 of telecommunications network, and these two nodes communicate by the interface of chain-dotted line 24 expressions.In the particular condition shown in Fig. 9 A, node 20 is sending nodes and node 22 is receiving nodes.The appointment of this sending node and receiving node is with reference to the direction as shown of bag stream, and wherein 26 bags that obtain are sent to sending node 20 from the bag source.Deliver to the bag of sending node 20 and handle, send to receiving node 22 by interface 24 then by sending node 20.Be appreciated that wrapping stream also can propagate to sending node 20 from receiving node 22 in opposite direction, still for the purpose of the remarkable form of describing present technique, considers enough to the unidirectional Bao Liuyi of receiving node 22 from sending node.
116/
Node 20 comprises first function 30 and second function 32, and the former is used for the first of the bag of being handled by node 20 is carried out first operation, and the latter is used for the second portion of this bag is carried out second operation.First function 30 and second function 32 can be in the same model layer, and can be thought the difference in functionality layer of same model layer respectively.For example, first function 30 can be considered to be in first functional layer in the particular model layer, and second function 32 can be considered to be in second functional layer in this particular model layer." layer " of employed any non-model layer should be understood that it is functional layer in the literary composition.
117/
Though belong to different functional layer (may in same model layer), first function 30 and second function 32 are configured to use to be shared transaction and/or shared service 34 and carries out operation to bag.Rely on and share transaction and/or shared service 34, after execution first operation is operated with second, have than the expense expense that lack, that belong to first function and second function of in the execution of first operation and second operation, not using this shared transaction and/or shared service 34 if passed through the bag of interface 24.
118/
Fig. 9 A also illustrates the identity function that receiving node 22 comprises sending node 20, perhaps perhaps more precisely, and the selected function of sending node 20 contrary.For example, receiving node 22 comprise second function contrary 40 and first function against 42.In addition, in the mode relevant with the shared transaction of sending node 20 and/or shared service 34, receiving node 22 has shared transaction and/or shared service 44, and they can be in the shared transaction of sending node 20 places use and/or the contrary types of transactions of shared service 34.
119/
In Fig. 9 A, carried out general elaboration to sharing transaction and/or shared service 34 in unrestriced mode.Described hereinafter about the shared transaction of the various exemplary form of sharing the transaction technology and/or concrete, representational, the non-restrictive example of shared service.For example, the neither one example is shared transaction and/or shared service will be by as exclusive or conditional, the several examples of this that is provided not are exhaustive, only are can be how by the more wide in range understanding of making up at least in part or merging such as the technology of sharing transaction to function in order to provide to their detailed description.Terminology used here " share with transaction " should be understood to include share transaction and shared service the two or comprise one of shared transaction and shared service.
120/
Will also be understood that the node such as sending node 20 described herein and receiving node 22 generally has many functions, more than specifically described function here, and this node is not limited to perhaps in fact be not limited to any specific quantity and the character of function as two the illustrated functions that comprise in this node.For example, in a unrestriced example embodiment, sending node 20 can be the IAD (aGW) or the enode b (eNB) of system architecture evolution/Long Term Evolution (SAE/LTE) telecommunications network, and sending node 20 can comprise illustrative functions shown in Figure 8 equally in other embodiments.In the SAE/LTE embodiment, interface 24 can be represented one or more (in groups) interface, such as S1 interface and Uu (air) interface.
121/
And, in the described example embodiment of Figure 10, be provided with and configuration link layer protocol 46 is carried out first function 30, second function 32 and shared transaction 34.In other embodiments, these functions do not need all to be carried out or presided over by this link layer protocol.
122/
For simplicity's sake, Fig. 9 A and Figure 10 illustrate the sending node 20 as single node that comprises first function 30 and second function 32.Yet terminology used here " node ", especially sending node are contained to have and are participated in a plurality of nodes of sharing the function in the transaction technology.In other words, wherein use the sending node of sharing the transaction technology to need not to be and need not to be single node, and can comprise a plurality of nodes, on described a plurality of nodes, can distribute multi-functional (for example, first function 30 and second function 32).For example, Fig. 9 B is shown as sending node 20 node that comprises two physically distinct nodes 20 (1) and 20 (2).First physical node 20 (1) comprises first function 30, and second physical node 20 (2) comprises second function 32.First function 30 and second function 32 can belong to or not belong to same model layer agreement 46B (for example, link layer), and are subordinated to or relate to and share transaction 34B.Sharing transaction 34B can be carried out or realized by the combination of first function 30 or second function 32 or first function 30 and second function 32.Therefore, () shared transaction technology for example, such as the difference in functionality of function 30 with function 32 was even these functions (for example, functional layer) can exist on different physical nodes or carry out when Fig. 9 B explanation was used for the difference in functionality layer.Although only be illustrated in the distribution of the shared transaction technology on a plurality of physical nodes at Fig. 9 B, this distribution is applicable to all embodiment and execution mode described here.
123/
In Fig. 9 A, Fig. 9 B, Figure 10 and all general embodiment subsequently, first function 30, second function 32 and shared transaction 34 can be carried out by the controller or the processor of sending node 20, if broadly describe and understanding speech mentioned above " processor " and " controller ".
124/
In a kind of form of technology shown in Figure 11, shared transaction comprises the shared information of being used by first function and second function.A non-restrictive example should sharing information is public sequencing information, and this information also special (for example) below is further described with reference to 4.0 joints.
125/
Basically, an individual character section that comprises sequencing information represents a plurality of processes by carrying, and no matter what combination of process is effective.Support the layer of compression of encryption and/or header-compressed and/or net load and/or signaling compression to be used to the carrying sequencing information.When an above functional layer is effective, this sequencing information to the multi-functional layer can be public (for example, header-compressed and encryption, perhaps other combination), and this sequencing information can be produced (perhaps, being produced by a plurality of valid process/algorithm so if carry out or activate a plurality of operations simultaneously) by arbitrary valid process/algorithm.This sequencing information also can come from the layer protocol under header-compressed process and/or crypto process and/or net load compression procedure and/or signaling compression procedure.Perhaps, this sequencing information also can come from other layer on the link layer, such as coming from application layer (for example, come from such as the real-time protocol (RTP) RTP that is positioned at application layer agreement).
126/
For example, in an example embodiment shown in Figure 12, first function 30 is data compression functions and second function 32 is encryption functions, and sharing information 34 (12) is the sequence number that is used for the sequence number MSN of compression function 30 by compression function 30 initial conducts.The also encrypted function 32 of same sequence number makes and is used for deriving the session key that is used for cryptographic operation.
127/
In another example embodiment as shown in figure 13, wherein also still the data compression function and second function 32 are encryption functions to first function 30, share information 34 (13) 32 initial by encryption function, therefrom derive the sequence number of session key, and should share information 34 and also be compressed function 30 as sequence number MSN.
128/
Sequence number can be used as the side-play amount of the shared sequence number that is used for compression algorithm and derives.Basically, the compression algorithm of transmission sequence number information is a side-play amount from the sequence numbering of sharing between a plurality of functional layers with this SEQ.XFER.
129/
Encryption layer for connecting executable operations, is handled all SDU usually, belongs to what IP stream with these SDU and has nothing to do.This may be identical for compression algorithm and compression protocol, handles the compression efficiency that strengthens to obtain but these compression algorithms and compression protocol often replace to thinner granularity (granularity) level executable operations and by stream to wrapping to carry out.In this case, with to " connection " unless other of executable operations layer shared sequence number will change value by SDU rather than by the bag on the stream---this connection is mapped to unique bag just and flows.
130/
The seen change pattern of compression algorithm of " by stream " had both depended on the speed (can change) of each stream on connecting and the number of various flows.Yet the change pattern of redirect in sequence number is limited to finite value probably, and compression algorithm can send compression bit (LSB or W-LSB) based on shared sequence number (be not based on its absolute value and just be based on side-play amount).Also can be at " header-compressed of robust (ROHC): framework and 4 convention: RTP, UDP, ESP and not compressions " (Carsten Bormann.et al.RObust Header Compression (ROHC): Framework and four profiles:RTP of people such as Carsten Bormann, UDP, ESP and uncompressed.IETF RFC3095 encodes referring to side-play amount in April2001).
131/
The example that can " press and flow " compression algorithm of operation comprises header-compressed and/or net load compression and/or signaling compression and/or header removal.
132/
In another form of the technology of using Figure 14 general remark, share transaction 34 (14) and comprise second function 32, this second function 32 is the second portion executable operations to wrapping not only, and the first's executable operations that can be subjected to 30 operations of first function at least in part to wrapping.For example, in an example embodiment shown in Figure 15, first function 30 is data compression functions and second function 32 is encryption functions, and at least a portion of the header of 32 pairs of bags of encryption function is encrypted (still, such as hereinafter explanation, ordering is encrypted to compression channel identifier or header).Below, further describe this example embodiment, special (for example) is with reference to 3.0 joints of this paper.
133/
In a kind of form with the technology of Figure 16 general remark, shared transaction comprise at least a portion of the first of bag and at least a portion of the second portion of this bag determine verification and, for example determine " share verification with ".Basal layer public verification of (underlying layer) carrying and information for example, are come carrying verification and information by the layer of supporting compression of encryption and/or header-compressed and/or signaling and/or net load compression.When the more than one function layer is effective, this information (for example can be common to a plurality of functional layers, header-compressed and encryption, perhaps other combination), and therefore this information can be produced (perhaps by any effective process/algorithm, if a plurality of operations are performed simultaneously or activate, produce by a plurality of valid process/algorithm so).
134/
In example embodiment as shown in figure 17, first function 30 is data compression functions, and the first of bag is the header of bag; Second function 32 is encryption functions, and the second portion of bag is the net load of bag.For at least a portion of the net load of at least a portion and the bag of the header of bag determine verification with.Below, further describe this embodiment, special (for example) is with reference to 2.1 joints of this paper.
135/
In another example embodiment shown in Figure 180, shared transaction for the first of wrapping (for example comprises, the header of bag) at least a portion determine verification and, and determined verification and this bag first that part of parameter of using by second function in the operation that the second portion of this bag is carried out that is included in.For example, second portion at bag is in the embodiment of net load of bag, for at least a portion of header of bag determine verification and, and the parameter of being used by second function in the operation of carrying out for the second portion of bag is sequence number, is its encryption context derivation session key with this sequence number.Below, further describe this example embodiment, special (for example) is with reference to 2.2 joints of this paper.
136/
Therefore, consider share transaction and some make up in essence or merge functional, provide method and apparatus be used for be operated between the multi-functional of same endpoints (for example, a plurality of functional layers of in same model layer, operating) share this such as transaction/information such as sequencing information and verification and information.Share the transaction technology and may be used on any two suitable transmissions and receiving node (no matter whether adjacent described node is), and special (but not exclusively) is suitable for a plurality of a plurality of function/processes of sharing same information of link layer representative wherein and keeps and transmit sorting and the situation or the architecture of verification and information.And, explain with reference to figure 10B that as previous the inner sending node of sharing the transaction technology that uses needs not to be single node, but can comprise a plurality of nodes, can distribute a plurality of functions by these contacts.Some functions that present technique comprises or be decided to be target (for example, some functional layers) can be (such as) header-compressed, header removal and regeneration, net load compression, signaling compression, encrypt and function such as reorder in any function, and the combination in any of above-mentioned functions.
137/
As above summary and following further explanation, header-compressed and encryption (and other possible function) can share sequencing information and verification and, minimizing have separately ordering and verification and expense.The SAE/LTE architecture provides candidate system for this idea, to be applied in IAD (aGW) and the subscriber equipment (UE).
138/
The multi-functional layer that layer representative as link layer operated in same endpoints (for example, encrypting and/or net load compression and/or header-compressed) come carrying sequencing information and verification and, and shared this same information.As another form, be provided at reordering during robustness with packet loss between compression/crypto endpoint when derive algorithm for the session key of crypto process, carry out encryption and header-compressed at least in part together.And, for the selection that encryption key is derived more sane, with the collaborative context management of encrypting of the context management of header-compressed.
139/
Use to share the minimizing that transaction between the transaction technology sharing functionality can cause expense, for example which can manage to use same information and the function that can in same endpoints, operate (for example the header-compressed of robust, header are removed, in net load compression, signaling compression and/or the combination in any of encrypting arbitrary) between share ordering and verification with.For example, use and to share the transaction technology, in some embodiment and/or embodiment, can reduce expense by the mode of table 2.
140/
Table 2
● public verification and (as CRC16): 2+ eight hytes (bit mistake, decompression, checking)
● Public sequence number: 1 eight hytes (reordering+encryption key)
Amount to: 3+ eight hytes
141/
As implied above, between the function that can manage to use same information and in same endpoints, operate (for example the header-compressed of robust, header are removed, in net load compression, signaling compression and/or the combination in any of encrypting any function), introduce such as the ordering of sharing and verification and shared transaction, can remove some expenses.Next, based on but be not limited to compressor reducer and decompressor ordering requirements and the behavior of RFC3095, be " header-compressed of robust (ROHC): framework and 4 convention: RTP, UDP, ESP and not compressions " (Carsten Bormann.et al.RObust Header Compression (ROHC): Framework and four profiles:RTP of people such as Carsten Bormann, UDP, ESP and uncompressed.IETFRFC3095, April2001), some possible one exemplary embodiment are described.
2.0: compressed context and the contextual portfolio management of encryption: general introduction
143/
In its a kind of form, present technique relates to the compressed context and the contextual portfolio management of encryption of the transaction of using combination or sharing.When using the ordering of deriving from compression protocol to carry out encryption with verification and (for example decompress and verify), the context management rule of compression algorithm is used to encrypt contextual management.The context management of this combination is characterised in that and is provided with sending node and receiving node, for example, sending node is being carried out compression and is being carried out at least a portion of bag and encrypt at least a portion of header portion of bag, thus compression with encrypt the degree that decompression checking and decryption verification at receiving node place bag become interdependence that is incorporated into.
144/
In the first routine mode of this form, the transaction of sharing or the child-operation of combination be included in at least a portion of compressed bag with will determine on the part of this encrypted bag compound verification with.For example, in first mode, as the verification of calculating in the sending node place and can cover this bag as described in part with encrypted (former unencrypted) part with compressed (former unpressed) part.The recipient, encryption layer is carried out the deciphering of encryption section of bag and decompressor compression section decompress (if do not have overlapping, then can carry out arbitrary processing earlier).In first mode, then use verification and verify the decompression process and these two result of decryption process, and when verification succeeds, cause corresponding compressed context and encrypt contextual renewal.In other words, if verified decompression, then finished deciphering and impliedly verified deciphering.
145/
In the second routine mode of compressed context and this form of encrypting contextual portfolio management, the child-operation of combination comprises with compression function and the encryption function of sequence number as the information of sharing, and the encrypted function of this sequence number is used for session key to be derived.In second mode, use the main sequence number of compression to come to encrypt under the situation that derives session key the context in encryption function, verification and only need covering (former unpressed) with part compressed, that comprise serial number information from it.Therefore, in this second routine mode, with at least a portion of compressed bag and (alternatively) with at least a portion of encrypted bag on calculation check with.In second mode, verification and only be used to confirm the result of the process of decompressing, when success, just cause to corresponding compressed context with encrypt context and upgrade.Therefore sequence number MSN is verified, and this is to be used to encrypt contextual unique sensitive information.
146/
In arbitrary mode, can use transport layer (for example, UDP, TCP) verification and the result who further confirms this process.The updating context rule is also followed the updating context logic of the compression in second mode.
147/
In same node, carry out encryption, can reduce the expense that is used for ranking function and reordering function with header-compressed.To can be the application achievements of present technique in an encrypted feature and header-compressed characteristics combination to a single-protocol.This agreement can comprise that also same typing rule also may be used to this to the support of net load compression.
148/
Context management is applicable to whole compressed package or the encrypted situation of its subclass (for example, only net load is encrypted) only here.In this dual mode, verification and help squeeze operation and the checking of cryptographic operation.
2.1: compressed context and the contextual portfolio management of encryption:
First mode: general introduction
150/
That Figure 19 shows that the first routine mode comprised is basic, representational example action or incident.Action 19-1 shows the example action of carrying out at the sending node place.Especially, for the bag that enters at sending node place, this compressed candidature part that enters bag with encrypt determine on candidate's net load part initial verification and.Compressed to small part with the interface of having encrypted to small part pass through comprise in the bag this initial verification and.On interface, pass through bag subsequently with this interface of transmission as described in the by way of example of interface 24 among Fig. 9 A.As indicated previously, interface 24 can be single face (for example S1 interface or the Uu interface under the situation that strengthens Node B), perhaps can represent jointly such as several interfaces such as S1 interface and Uu interfaces.Action 19-2 shows and is carrying out deciphering and decompressing with after obtaining to restore bag, and the interface at the receiving node place passes through the example action of carrying out in the reception of bag.The action of action 19-2 be included in recover to wrap determine the checking verification and.And, with the checking verification and with initial verification and relatively come determine the deciphering and the decompression checking.
2.1.1: compressed context and the contextual portfolio management of encryption:
First mode: carry out: sending node
152/
The example detailed embodiment of first mode of the Figure 19 at sending node place, the action of the flow chart by Figure 20 also is combined in bag that the correspondence of Figure 21 arranges and describes and describe, and illustrates.The corresponding detailed embodiment of first mode of the Figure 19 at receiving node place, the action of the flow chart by Figure 22 and describe in conjunction with the bag that the correspondence of Figure 23 is arranged describes.
153/
For the example embodiment of first mode, at the sending node place, action 19-1-a comprises for the compressed candidature part that enters bag and for encrypting partly definite initial verification of candidate's net load and ICKSUM.In this example embodiment, Figure 21 shows for the whole compressed candidature portion C CP that enters bag and whole encryption candidate net load part ECPR calculates and definite initial verification and ICKSUM.Being appreciated that can be for being less than whole verification and the ICKSUM that bag calculates action 19-1-a that enter, for example calculate for being less than whole compressed candidature portion C CP and/or being less than whole encryption candidate net load part ECPR, as long as verification and computational logic are known sending node and receiving node both sides, i.e. verification and computational logic as one man are pre-configured to be in sending node and receiving node in the two.
154/
Action 19-1-b comprises the compressed candidature portion C CP that enters bag is carried out compression so that compression strings CS to be provided.The compression of action 19-1-b can be any suitable compression method, includes but not limited to describe here or mentioned compression method.
155/
Action 19-1-c comprises that the encryption candidate net load part ECPR that enters bag to the major general encrypts to provide and encrypts string ES.In example embodiment shown in Figure 21, encrypt not only to cover and encrypt candidate's net load part ECPR, and cover compressed candidature portion C CP.Should know, in the change embodiment, encrypt and also can cover initial verification and ICKSUM.Perhaps, in another change embodiment, encrypt also can only cover and encrypt candidate's net load part ECPR (not covering compressed candidature portion C CP or initial verification and ICKSUM).No matter adopt any embodiment or change embodiment, action 19-1-b can be any suitable encryption technology, includes but not limited to describe here or mentioned encryption technology.
156/
Action 19-1-d comprises that formation passes through bag corresponding to the interface that enters bag.The group bag of action 19-1-d relate to pass through at interface comprise compression strings CS in the bag at least, encrypt string ES and initial verification and.When encryption only covered encryption candidate net load part ECPR, these three parts were arranged on interface separately and pass through in the bag.Yet, when encrypt to cover surpass encrypting candidate's net load part ECPR, encrypt string ES and can comprise all or part of of one or more other parts in other part that interface passes through bag.That is,, then pass through to comprise in the bag and encrypt string ES and be encompassed in interface and pass through that to comprise compressed candidature portion C CP in the bag all or part of at interface if encrypt to cover compressed candidature portion C CP.Equally, if encrypt to cover initial verification and ICKSUM, then pass through to comprise in the bag and encrypt string ES and be encompassed in interface and pass through and comprise initial verification and ICKSUM in the bag at interface.
2.1.2: compressed context and the contextual portfolio management of encryption:
First mode: carry out: receiving node
158/
In the detailed embodiment of the correspondence of first mode of the Figure 19 at receiving node place, the action of the flow chart by Figure 22 is also arranged in conjunction with the correspondence of Figure 23 that the corresponding bag of arranging is described and is described.The action 19-2-a of Figure 22 comprises that docking port passes through the encryption string ES deciphering of bag so that the deciphering string to be provided.The deciphering of action 19-2-a is carried out by the inverse process of the encryption technology of the correspondence of using in action 19-1-c place.
159/
Consider specific embodiments shown in Figure 21, comprise compression strings CS because encryption string ES is prepared to, will encrypt the net load part that string ES unpacks to be provided compression strings CS and encrypt candidate's net load part ECPR corresponding to (the supposition encrypt and decrypt is successful) so Figure 22 is shown decryption table.Encrypted as compression strings CS in another change embodiment, then this compression strings CS just can not move the deciphering of 19-2-a.And if initial verification and ICKSUM are not subjected to encrypting (shown in the dotted line of Figure 22) yet in a change embodiment again, it is decrypted that then initial verification and ICKSUM also can be used as the part of action 19-2-a.
160/
Action 19-2-b comprises that the compression strings CS that interface is passed through bag decompresses so that decompress(ion) string DS to be provided.The decompression of action 19-2-b is carried out by being used to move the inverse process of compression method of squeeze operation of 19-1-b.
161/
Action 19-2-c comprise for decompress(ion) string DS and deciphering string with corresponding to determine among the action 19-1-a initial verification and mode determine checking verification and VCKSUM.
162/
Action 19-2-d comprise the checking verification using as carry out in action 19-2-c place and with initial verification and deciphering that relatively comes to determine action 19-2-a and the checking of decompression of 19-2-b of moving.
163/
The action 19-2-e comprise according to the action 19-2-d checking upgrade compressed context.The action 19-2-f comprise according to the action 19-2-d checking upgrade the encryption context.
Compressed context and the contextual portfolio management of encryption:
First mode: conclusion
165/
Therefore, in compressed context and first mode of encrypting contextual portfolio management, encrypt use with compression or share same verification and, and verification and coverage comprise (to small part) net load.
166/
Basically, be used to verify the decompression process the result verification and also can confirm the success (for example, about decryption process) that session key is determined.As shown in wide in range among Figure 19 and among Figure 20 and Figure 21 with more specifically shown in the example embodiment, verification and cover bag part with encrypted (former unencryption) part with compressed (former compress) part.
167/
Transmitting terminal (for example) referring to the action 19-1-a of Figure 20, calculation check and, make this verification and cover bag part with encrypted (former unencryption) part and with compressed (former compression) part.
168/
Receiving terminal (for example) referring to Figure 20, bag decrypted earlier (for example, referring to action 19-2-a).Notice that ordering is independent of compression.Then can transmit the result of decryption process and do not verify the result of decryption process to decompressor.Then, carry out decompress (action 19-2-b).
169/
Then use verification of receiving and the result who verifies decompression process and decryption process with compressed package.If be proved to be successful, then upgrade compressed context respectively and encrypt context (action 19-2-e and action 19-2-f).When applicable, also upgrade compressed context based on executive mode based on the updating context attribute of compressed format.If verification and the whole at least encrypted information of covering so as long as decompression is that the successful decryption oprerations of then can supposing also is successful, and can be upgraded correlation behavior to handle next bag.
2.2: compressed context and the contextual portfolio management of encryption:
Second mode: general introduction
171/
In the second routine mode aspect compressed context and the contextual portfolio management of encryption, the child-operation of combination comprises that the encrypted function of this sequence number is used for session key or is used for deriving session key with the compression function and the decipher function of sequence number as the sequence number of the information of sharing.In addition, in the second routine mode of this form, for bag want this bag of compressed at least a portion and (alternatively) want encrypted part calculation check and.In this dual mode, verification and help squeeze operation and the checking of cryptographic operation.
2.2.1: compressed context and the contextual portfolio management of encryption:
Second mode: carry out: the action of sending node
173/
Figure 24 shows basic, the representational example action or the incident of the second routine mode that relates to.Action 24-1 shows the example action of carrying out in the sending node place.Especially, for the bag that enters at sending node place, to the compressed candidature that enters bag partly determine initial verification and.In this second mode, compressed candidature partly comprises the sequence number that is used for squeeze operation.And in this second mode, this same sequence number is used as the information of sharing to be used for deriving the session key that uses in the encryption of the encryption candidate net load part that enters bag.To small part compression and to the interface that small part is encrypted pass through comprise in the bag initial verification and.On interface, pass through bag subsequently with this interface of transmission as described in the by way of example of the interface among Fig. 9 A 24.As previously shown, interface 24 can be single face (for example at the S1 interface or the Uu interface that strengthen under the situation of Node B), perhaps can collectively represent such as S1 interface and Uu interface these two etc. several interfaces.Action 24-2 is illustrated in receiving interface and passes through the example action of promptly carrying out behind the bag, comprises and obtains sequence number.Carrying out after deciphering obtains with decompressing to recover bag, for recover bag determine the checking verification and.Use the checking verification and with initial verification and the checking that relatively comes to determine decompression.
174/
In the detailed embodiment of the example of second mode of the Figure 24 at receiving node place, the action of the flow chart by Figure 25 and describe in conjunction with the bag that the correspondence of Figure 26 is arranged describes.In the detailed embodiment of the example of second mode of the Figure 24 at receiving node place, the action of the flow chart by Figure 27 and describe in conjunction with the bag that the correspondence of Figure 28 is arranged describes.
175/
For the example embodiment of second mode, at the sending node place, action 24-1-a comprise determine initial verification and.Especially, for the compressed candidature portion C CP that enters bag determine initial verification and.If sequence number MSN is the sequence number as the part of original, uncompressed IP header, sequence number MSN should cover by verification with in the mode shown in corresponding description the among Figure 26 so.On the other hand, if sequence number MSN is produced and is not appeared in the original, uncompressed IP header by compression algorithm, its unique purposes is to this header decompression so, thereby sequence number MSN needs not to be the part (and therefore not needing by initial verification and covering) of the information that is verified after decompression process and decryption process.
176/
As option (with according to shown in the verification and the dotted line in the formation (checksum formation) of Figure 26), in some change embodiments, also for the encryption candidate net load part ECPR that enters bag determine initial verification and, the described encryption candidate net load part ECPR that enters bag is used for the sequence number of session key derivation.Being appreciated that can be to being less than whole verification and the ICKSUM that bag calculates action 24-1-a that enter, for example to being less than whole compressed candidature portion C CP and/or encrypting candidate's net load part ECPR and calculate, as long as sequence number MSN is calculated and as long as clear consistently or done pre-configured at sending node and receiving node both sides verification and computational logic to being less than.
177/
Action 24-1-b comprises the compressed candidature portion C CP that enters bag is carried out compression so that compression strings CS to be provided.The compression of action 24-1-b can be the compression method that is fit to arbitrarily, includes but not limited to the compression method of describing or mentioning here.
178/
Action 24-1-c comprises at least the encryption candidate net load part ECPR that enters bag encrypted to provide and encrypts string ES.In example embodiment shown in Figure 26, encrypt not only to cover and encrypt candidate's net load part ECPR, but also cover compressed candidature portion C CP substantially, except the sequence number MSN.Because this cause, sequence number MSN or its compressed version are illustrated in encryption string ES next door separately in Figure 26.Should know, in a change embodiment, encrypt and also can cover initial verification and ICKSUM.As selection, in another change embodiment, encryption can only cover encrypts candidate's net load part ECPR (and not covering compressed candidature portion C CP or initial verification and ICKSUM).No matter adopt what kind of embodiment or change embodiment, the encryption of action 24-1-b can be any suitable encryption technology, includes but not limited to describe here or mentioned encryption technology.
179/
Action 24-1-d comprises that formation passes through bag corresponding to the interface that enters bag.The group bag of action 24-1-d relate to pass through at interface comprise the compression strings CS that contains sequence number MSN at least in the bag, encrypt string ES and initial verification and.When encryption only covered encryption candidate net load part ECPR, these three parts were arranged on interface separately and pass through in the bag.Yet,, encrypt string ES and can comprise all or part of of one or more constituents in other part that interface passes through bag in case encrypt to cover surpass encrypt candidate's net load part ECPR.That is,, pass through at interface so and comprise encryption in the bag and go here and there ES and be encompassed in interface and pass through the part that comprises compressed candidature portion C CP in the bag if encrypt to cover compressed candidature portion C CP except that sequence number MSN.Equally, if encrypt to cover initial verification and ICKSUM, pass through to comprise in the bag at interface so and encrypt string ES and be encompassed in interface and pass through and comprise initial verification and ICKSUM in the bag.
2.2.2: compressed context and the contextual portfolio management of encryption:
Second mode: carry out: receiving node
181/
The bag that the action of the flow chart of Figure 27 and the correspondence of Figure 28 are arranged is described, the detailed embodiment of the correspondence of second mode of the Figure 24 that illustrates at the receiving node place.The action 24-2-a of Figure 27 comprises passing through the bag from interface and obtains sequence number MSN.For example, sequence number MSN can decompressedly be the part of not encrypted compression strings CS.If sequence number MSN will be used to deciphering, it can be not encrypted so, but it can be compressed.
182/
Action 24-2-b comprises that docking port passes through the encryption string ES deciphering of bag so that the deciphering string to be provided.24-2-b is corresponding with action, and Figure 28 shows such as comprising the deciphering string of compression strings part (for example, in the encrypted compression strings part in action 24-2-c place) with the net load of bag.The deciphering of action 24-2-b is carried out by the contrary of encryption technology of the correspondence of using at action 24-1-c place.
183/
Action 24-2-c comprises that the compression strings that docking port passes through bag partly decompresses so that the string that decompresses to be provided.24-2-c is corresponding with action, and Figure 28 shows such as the decompression string that comprises sequence number MSN.The decompression of action 24-2-c is carried out by being used to move the contrary of compression method of squeeze operation of 24-1-b.
184/
Action 24-2-d comprises at least decompressing string and the deciphering string is used corresponding to the mode of determining initial verification and ICKSUM in action 24-1-a determined checking verification and VCKSUM alternatively.
185/
Action 24-2-e comprise use the checking verification and with initial verification and the decompression of 24-2-c of relatively coming to determine to move verify.
186/
The action 24-2-f comprise according to the action 24-2-e checking upgrade compressed context.The action 24-2-g comprise according to the action 24-2-e checking upgrade the encryption context.
2.3: compressed context and the contextual portfolio management of encryption:
Second mode: conclusion
188/
In compressed context and first mode of encrypting contextual portfolio management, with the result's that is used to verify the decompression process verification with confirm the success (decryption process) that session key is definite.This verification and minimally covering comprise (MSN) of main sequence number with compressed (original, uncompressed) part, but, derive if decryption process is used for session key with same MSN, this verification is formed in the part encrypted (original unencryption) part with can not comprising so.
189/
At transmitting terminal, for example at sending node, calculation check and ICKSUM so that its minimally cover compressed (original, uncompressed) part---comprise MSN, if derive but decryption process is used for session key with same MSN, so this verification and can not comprise in forming partly with encrypted (original unencryption) part.
190/
At receiving terminal,, at least at first decompress or recovery MSN (action 24-2-a) for example at receiving node.Then carry out deciphering and decompress (, just must before the decompression of the field except that MSN, be decrypted) if a certain at least part of compression section is encrypted.Then, verification and only be used for confirming the result of the process of decompressing.If success, the updating context attribute based on compressed format also upgrades compressed context respectively and encrypts context based on mode of operation so, if be suitable for and define as compression algorithm.So sequence number MSN is verified, this is to encrypt contextual unique sensitive information.
2.4: compressed context and the contextual portfolio management of encryption:
Some advantages
192/
Aforesaid or as the compressed context that comprised in addition thus have many advantages with the contextual portfolio management of encryption, enumerate some advantages wherein below.The first routine advantage is that expense minimizes: when use common verification and the time, this technology is with the functional robust features that comprises the header-compressed updating context that expands to of the context management of cryptographic algorithm.This also can save some expenses.
193/
The second routine advantage is the influence to existing standard and architecture: this technology does not stop lower floor to have the error detection function of self.This technology is used as in the combination that is proposed, and can allow lower floor to close (turn off) their some error detection mechanisms, and this needs the independent encryption layer usually.This can reduce overhead.In other words, this is not layer violation or cross-level comprehensive (layer violation or cross-layer integration).
194/
The 3rd routine advantage is mutually beneficial and encrypts contextual enhancing robustness: encryption function is benefited from the robust features about the header compression algorithm of sequencing information, and has therefore reduced the encryption context and lost with respect to the synchronous possibility that sorts.If the synchronization loss with respect to ordering takes place, then will take place from the inside of the Restoration Mechanism of header compression algorithm synchronously again.
195/
The 4th routine advantage is the applicability to general header-compressed: this is particularly useful for most of ROHC conventions, includes but not limited to ROHC RTP (0x0001), UDP (0x0002), IP (0x0004), ESP (0x0003), TCP (0x0006), UDP-Lite (0x0008), RTP/UDP-Lite (0x0007) header compression protocol.For example, this also is associated with the cryptographic algorithm and the cryptographic algorithm of (but being not limited to) such as stream cipher especially, and this allows for example to utilize bit mask to come only certain bits encrypt/not to be encrypted.The example of this stream cipher comprises A5, GEA, UEA and AES.Password that other is relevant and cryptographic algorithm are those algorithms that utilize sequencing information to derive to add the required parameter of (separating) password.
196/
Feature that other of present technique is nonrestrictive and exemplary and advantage also comprise following every.
197/
Be used to verify the decompression process the result verification and can confirm that session key determines the success of (decryption process).When successful, this encryption context is updated.
198/
Use covered bag form part with encrypted (original unencryption) part and with verification of compressed (original, uncompressed) part and, can realize the encryption context management of robust.This verification and can using for the decompression process., and its result can use for cryptographic algorithm.
199/
Use bottom line to cover with compressed (original, uncompressed) part---comprise MSN verification and, can realize the encryption context management of robust, if derive but decryption process is used for session key with same main sequence number (MSN), so this verification and can not comprising form partly with encrypted (original unencrypted) part.This verification and can be for decompression process use, and its result can use for cryptographic algorithm.If practical, when success, just upgrade the encryption context so based on the updating context and the mode of operation of compression algorithm.
200/
Transport layer (for example, UDP, TCP) verification and can be used to provide further affirmation to the process result.
201/
When using UDP-Lite, this verification and use and UDP-Lite verification and identical coverage.
202/
If described verification and covered have at least the protection transport layer information, so this verification and can replace the transport layer verification and.At first verify the transport layer verification and.
203/
For example, aforesaid mode includes but not limited to ROHC RTP (0x0001), UDP (0x0002), IP (0x0004), ESP (0x0003), TCP (0x0006), UDP-Lite (0x0008), RTP/UDP-Lite (0x0007) header compression protocol applicable to the occasion of carrying out compression algorithm according to robust header compression (ROHC) convention.
204/
For example, aforesaid mode is generally applicable to the occasion of carrying out header compressor and/or decompressor according to any other header compression scheme.
205/
For example, aforesaid mode is the occasion of stream cipher applicable to cryptographic algorithm and cryptographic algorithm, includes but not limited to A5, GEA, UEA and AES.Utilize sequencing information to derive to add other cryptographic algorithm of (separating) close required parameter and cryptographic algorithm also within the scope of the present invention.
206/
For example, aforesaid mode is applicable to other compression algorithm, signaling compression for example, such as SigComp, (for example those are at " using the IP net load compression of DEFLATE " (Pereira of Pereira R. for the net load compression algorithm, R.IP Payload Compression UsingDEFLATE, IETF RFC2394, December1998) and " use LZS IP net load compression " (Friend of Friend R and R.Monsour, R.et R.Monsour, IPPayload Compression Using LZS, IETF RFC2395, December1998) defined in), perhaps applicable to require to sort with verification and any other operations, be used to sort with verification and this information can share with other algorithms, this information origin also ends at same node point.
207/
For example, aforesaid mode is applicable to aGW, the current part that is defined as SAE/LTE work in 3GPP RAN2 standardization effort group of aGW.
3.0: security header compression: general introduction
209/
According to another independent aspect of present technique, can be on the part of header compression protocol, the cooperation of the others described in for example can literary composition is used down, carries out and encrypts (encryption) function or password (ciphering) function.That is, method described here allows some or all net load of bag is encrypted, and also allows the header compression form is encrypted (except the header fields with the function that relates to header compression channel).
210/
The header compression algorithm robust header compression agreement of existing RoHC framework compatibility (for example with) is used for and will encrypts and effectively combination and produce the header-compressed stream of encrypting of header-compressed.Both wrapped to carry out and encrypted, and on the header compression as much as possible of himself, carried out again and encrypt in the whole header-compressed that comprises net load of the not compression expression that uses (otherwise may be compressed) header-compressed master's sequence number (MSN).Can not encrypted field be to support following every field:
Multiplexed (for example, RoHC CIDs) of-data flow,
-Bao type identification (for example, RoHC wraps type),
-(may compress) MSN, and
The identifier of-compression algorithm (for example, RoHC convention eight hytes) is at where applicable, for example, and for initial package (for example, RoHC IR bag).
211/
Comprise two corresponding node (adjacent or non-conterminous) in an embodiment example, unrestriced, wherein carry out header-compressed and encryption (for example among the aGW that in the 3GPP of SAE/LTE RAN2, defines).Which part of regulation " safe header compression form " will be not encrypted in this embodiment, and which part of regulation can be encrypted, also is defined in the logic that transmitting terminal and receiving terminal use.
212/
Encryption can be performed with the header-compressed in the same node, and this reduces the expense that sorts separately and strengthens the robustness that the key that is used to decipher is derived mechanism, it is characterized in that obtaining inheriting with reordering such as the robustness of anti-packet loss.This agreement also can comprise the support to the net load compression.
213/
This technology can be applicable to new convention (because must the existing RFC3095 of definition expansion version) in the RoHC framework,, the additional channel consultation parameter that encrypt context applicable to being used to construct again, reorders etc.The convention special purpose packet form (profile-specificpacket formats) of looking for novelty, but in the space that untapped bag type and the IR of RoHC wrap type, there is leeway to use.Therefore, the solution that proposes can be in " the header-compressed of robust (ROHC): framework and 4 convention: RTP as people such as Carsten Bormann, UDP, ESP and unpressed " (Carsten Bormann.et al.RObust HeaderCompression (ROHC): Framework and four profiles:RTP, UDP, ESPand uncompressed.IETF RFC3095, April2001) and Pelletier G., " header-compressed of robust (ROHC) framework: internet draft (in carrying out) " (Pelletier of Sandlund K. and L.Jonsson, G., Sandlund, K.and L.Jonsson, The RobustHeader Compression (ROHC) Framework, Internet Draft (work inprogress),＜draft-ietf-rohc-rfc3095bis-framework-00.txt 〉, December2005) compatible in the defined RoHC framework, can equally with clear stream share same channel so that encrypt RoHC stream.
214/
Prerequisite is by setting up and encrypt relevant channel parameter such as the negotiation during the initialization context, default value, in-band signalling or by static set-point.These parameters comprise the project that appears at usually in the encryption context: (for example, the AES in the f8-pattern is HMAC-SHA) with (2) master key in the password conversion that (1) will be used.
215/
Encrypt (for example, password) be used to make up header compression be the field of net load thereafter, except that following must remain (field that for example, contains the header of header compression channel information) the unencrypted field:
● the multiplexed identifier of the stream on header compression channel (CID).
● the header compression Format Type identifies (bag type identifier).
● main sequence number (if encrypted session key derives with MSN); MSN can be compressed.
● the compression algorithm identifier, when no multiplexed identifier is related with the security header compressive flow (the initial compression convention identifier of header compression).
216/
What therefore, describe in the literary composition for example is the method that operation comprises the telecommunications network of sending node and receiving node.This method comprises, for the bag that enters at the sending node place, the header compression except that the header fields with header compression channel information of this bag encrypted, and passed through to comprise in the bag at interface and encrypted header compression.This method also comprises, passes through bag for the interface of receiving at the receiving node place, obtains information and decipher the header compression that this interface passes through bag from the header fields with header compression channel information.
3.1: security header compression: compressor logic
218/
The flow chart of Figure 29 shows action example, unrestriced or incident, and they can be to prepare to have the by way of example execution of the bag of encrypting its header compression.Different protocol layers is appreciated that in fact a bag can have more than one header, because can add its header separately comprises many headers of multi-protocols with composition compound header.Corresponding with each action of Figure 29, Figure 30 shows the bag content description when a bag relates to squeeze operation and decryption oprerations.
219/
Figure 30 shows not header compression UH.Not header compression UH comprise as listed above can not encrypted fields (UF): multiplexed identifier (MUX ID), header compression Format Type sign (FMT ID), main sequence number (MSN) and compression algorithm identifier (CAI).That these four fields are formed altogether is described here " can not encrypted fields " or " UF ".
220/
Action 29-1 comprises determining to use which compressed context.Equally, action 29-2 comprises which determines to use encrypt context.The context of action 29-1 and 29-2 is determined based on definite ongoing transaction.Action 29-1 and 29-2 determine and can jointly carry out.
221/
Action 29-3 comprises based on the agreement of header-compressed or determines the value of main sequence number (MSN) according to the value that keep this locality.
222/
Action 29-4 comprises the header of compressed package.Figure 30 shows the production process of header compression CH.The compression of action 29-4 can be such as any suitable compression method of describing in the text or mentioning.
223/
Action 29-5 comprises that determining to wrap index is used for encrypted session key with generation.
224/
But action 29-6 comprise header compression that use for example wraps and encryption section (for example, the header compression channel information of the net load of bag and any maintenance, such as feed back, cut apart, verification and etc.) organize bag.Do not comprise in the group bag (packetization) of action 29-6 as listed above can not encrypted fields (UF): multiplexed identifier (MUX ID), header compression Format Type sign (FMT ID), main sequence number (MSN) and compression algorithm identifier (CAI).
225/
Action 29-7 comprises the packet encryption that forms in action 29-6, for example, carries out encryption according to the particular encryption algorithm that just is being used on CP of header compression that wraps and net load.Figure 30 shows the EP of encryption section of bag, as encrypted result.Cryptographic algorithm can (for example) be similar to such as " Security Real Time Protocol (SRTP) " (the Baugher M.et al. according to people such as Baugher M, The Secure Real-time Transport Protocol (SRTP), IETF RFC3711, encryption March2004).The action 29-7 encryption do not comprise aforesaid can not encrypted fields (UF).
226/
Action 29-8 is included in where applicable and upgrades the call parameter of encrypting in the context.
227/
Action 29-9 comprises by adding the listed group of the encryption section bag that can not encrypted fields (UF) will wrap among the action 29-6.These can not encrypted fields (UF) must be not encrypted, if but require compression also can be compressed.Correspondingly, Figure 30 shows and is ready for basically to the final bag P of lower floor's transmission or the formation of datagram.In fact, action 29-10 comprises to lower floor and transmits the datagram P that the result obtains (for example, to being used to cut apart and medium Access Layer (MAC) to correct logic channel and/or transmit queue mapping, for example it may be the scheduler program of transmission).
228/
Running order among Figure 29 can change.For example, the order between action 29-1 and the action 29-2 can be changed.Order between action 29-3, action 29-4 and the action 29-6 also can be changed.And action 29-8 and action 29-10 can whole and action 29-8 transposings.3.1: security header compression: decompressor logic
230/
The flow chart of Figure 31 shows action example, unrestriced or incident, and they can be carried out to handle the by way of example that has received bag, and this bag has been done encryption (for example, the action of carrying out at the receiving node place) to its header that has compressed.Corresponding with each action of Figure 31, Figure 32 describes the bag content when bag relates to squeeze operation and decryption oprerations.
231/
Action 31-1 comprises by handling header compression channel information and will unpack from the packet P that lower floor receives, described header compression channel information comprise such as multiplexed identifier (MUX ID), header compression Format Type sign (FMT ID), main sequence number (MSN) and compression algorithm identifier (CAI) can not encrypted fields (UF).
232/
Action 31-2 comprises determining to use which compressed context.In a single day this compressed context is determined, just comprises the decompression to MSN among the action 31-3.
233/
Action 31-4 comprises to determine to use which encryption context.Encrypt and contextually determine and to determine to interrelate about which header-compressed is contextual with action 31-2.
234/
Action 31-5 comprises definite bag index and derives session key.Preamble has been explained the derivation of session key, and the derivation of session key also can depend on cryptographic algorithm.This action obtains the correct ordering as the order of the bag of the encrypted processing of reflection of output.
235/
Action 31-6 comprises according to the encryption section deciphering (for example, DecryptDecryption (decrypting)) of the specific decipherment algorithm that just is being used to bag.As mentioned above, cryptographic algorithm can be similar to such as " Security Real Time Protocol (SRTP) " (the Baugher M.et al. according to people such as Baugher M, The Secure Real-time Transporr Protocol (SRTP), IETF RFC3711, deciphering March2004).
236/
Action 31-7 comprises consequent decrypted data packet is unpacked, for example by handle such as feed back, cut apart, verification and etc. the remaining part of header compression channel information unpack.
237/
Action 31-8 comprises the whole header compression of decrypted packet is partly decompressed, and forms not header compression UH.If be suitable for, action 31-9 can comprise the call parameter that upgrades in the encryption context.Action 31-10 comprises to upper strata (for example, networking layer, for example, IP stack (for example, with respect to the layer 3 in the osi model)) and transmits the datagram deciphered and decompressed.
238/
Running order among Figure 31 can change.For example, the order between action 31-3 and the action 31-4 can be exchanged.
239/
Figure 33 shows the example embodiment based on RoHC.Technology described here makes " safe convention " become possibility with other RoHC convention coexistence on same RoHC channel.This means that this function can flow On/Off by header-compressed.Yet require probably to specify new channel parameter, comprise being used for RoHC channel negotiation parameter.
3.3: security header compression: some advantages
241/
As mentioned above or the security header compress technique that otherwise comprises in the literary composition have many advantages, enumerate some advantages wherein below.The first routine advantage is that expense minimizes: use as the combination that is proposed in, this technology does not require that lower floor introduced their ordering before the independent encryption layer.This has reduced the expense in these lower floors.
242/
The second routine advantage is the influence to existing standard and architecture.In addition, the security header compress technique has been expanded as the function of header-compressed of suggestion here, does not also get rid of lower floor and has their function of deciphering and reordering of being used to.Use as the combination that is proposed in, the security header compress technique allows lower floor to close their ordering and pass through mechanism according to the order of sequence before the independent encryption layer.This has reduced overhead.In other words, this is not that layer violation or cross-level are comprehensive.Yet, do not need to define new compression algorithm (for example, RoHC convention) also with it standardization.
243/
The 3rd routine advantage is the practicality to general header-compressed, be particularly useful for most of ROHC agreements, include but not limited to ROHC RTP (0x0001), UDP (0x0002), IP (0x0004), ESP (0x0003), TCP (0x0006), UDP-Lite (0x0008), RTP/UDP-Lite (0x0007) header compression protocol.This technology also is associated with especially but is not limited to cryptographic algorithm and cryptographic algorithm such as stream cipher, for example utilizes bit mask to allow only certain bits encrypt/not to be encrypted.The example of this stream cipher comprises A5, GEA, UEA and AES.Other is relevant make encrypt with cryptographic algorithm be those algorithms that utilize sequencing information to derive to add (separating) close desired parameters.
4.0: sequence number is shared: general introduction
245/
In its a kind of form, the shared transaction of this technology is the shared information of sharing such as sequence number.In other words, in this form of this technology, functional layer is used the sequencing information from another functional layer.Basically, the sequencing information that any process in encryption and/or header-compressed and/or net load compression and/or the signaling compression is used is all derived in another process, i.e. any another process in encryption and/or header-compressed and/or net load compression and/or the signaling compression.
246/
Header-compressed is used a certain form of sequence number usually, is called as main sequence number (MSN) sometimes, normally compresses other field based on described form by setting up according to the function about the changing pattern of this sequence number.This sequence number derives from just compressed protocol fields, or is generated in this locality by compressor reducer.
247/
The a certain form that password (for example, encrypting) uses sequencing information usually derives session key based on described form under the contextual cooperation of encryption.
248/
In first mode that sequence number is shared, header compressor is the header of compressed package at first, and transfers its sequence number to crypto process.Crypto process (ciphering process) uses this sequence number to derive session key, and bag is carried out encryption (processes the packet with encryption).
249/
In second mode that sequence number is shared, encrypt (password) function the sequence number that encrypted (in its cryptographic operation) next time is used for header compressor can be used.Header compressor use this sequence number as it MSN and compress this bag, and will be compressed package give crypto process.Then, crypto process (encryption process) uses this same sequence number to derive session key, and carries out encryption (processes with encryption).If be suitable for the just carrying in cryptographic protocol of this sequencing information.
250/
In other words, in second mode, ordering (for example, sequence number) is produced by encryption function, and encryption function makes ordering can be used for header compression function.When compression (decompression), should compression (decompression) function should sort as main sequence number (MSN).
251/
Encrypt with compressing and generally be regarded as the process of separating.In the traditional approach, encryption is executed between the IP end host (remaining most incompressible headers), application program (can not detect, thereby intermediate system can not their encryption of opening/closing) between, perhaps be executed between the transmitter and receiver on the physical medium and (be positioned to adjacent node) unless can guarantee ordering.
252/
In any mode that described here sequence number is shared, encrypt adaptation layer and can be considered to be header-compressed.Figure 34 will encrypt and separate with the tradition of compression that (shown in Figure 34 left side) and sequence number described here are shared and combination or the compression procedure that merges and crypto process (shown on the right of Figure 34) compare.Basically, carry out the encryption of net load together with header-compressed.No matter be finally to obtain or obtain from encryption function from compression function, header-compressed master's sequence number (MSN) is used to derive session key from encrypt context.Encryption function uses sequence number MSN impliedly to derive session key from encrypt context.Encryption is put on the part corresponding to net load of bag with the header-compressed ordering.The same sequence number MSN process of being compressed is used for header compression, shown in the RoHC compression of Figure 34.
253/
Aspect sequence number shared, along with the main sequence number (MSN) that use is used to compress to derive session key is carried out encryptions on the net load of just compressed bag, encryption combined so that the SRTP mode is effective with compressing.Encryption is of value to the robust features of coding, and described coding is according to being used for MSN about the loss that himself requires synchronously with reordering.
254/
Example apparatus comprises two corresponding node (adjacent or non-conterminous), carries out compression and encrypt (for example being the defined IAD of SAE/LTE) in 3GPP RAN2 at described intranodal.The password conversion is derived algorithm (as " Security Real Time Protocol (SRTP) " (the Baugher M.et al. people such as Baugher M with key, The Secure Real-timeTransport Protocol (SRTP), IETF RFC3711, March2004) described in) use comes from compression algorithm (for example, main sequence number (MSN) RoHC) come the net load encrypt and decrypt.Do the robustness that means cryptographic session key derivation algorithm like this and inherited the anti-lost package of MSN between compression/crypto endpoint and the robust features that reorders in addition.
255/
So, can in same node, especially in the same node with RoHC, carry out encryption, thereby reduce expense and strengthened the robustness that the key of deciphering is derived mechanism with independent ordering with header-compressed.
256/
Can be useful on the additional outside negotiation mechanism of crypto process configuration, defined convention and other derivation convention (were it not for the ESP extension header) can not make an amendment and just use among the RFC3095.May improve in reordering is to make some minimum packet formats invalid.
4.1: sequence number is shared: example embodiment
258/
At Figure 35 is in embodiment example, unrestriced, show for the sending node with compression procedure combination or that merge and crypto process and receiving node performed basic, representational action or incident, the wherein shared sequence number of compression procedure and crypto process.Series of acts as described in Figure 35 both can be applicable to the first shared mode of sequence number (the selected or selection sequence number MSN of compression procedure in this mode), can be applicable to second mode (the selected or selection sequence number MSN of crypto process in this mode) that sequence number is shared again.Figure 36 and Figure 37 illustrate the action of sending node and receiving node respectively with the flow chart form.
259/
Figure 36 describes by the elemental motion of the compressor logic execution of sending node or the elementary event of management.Action 36-1 (referring to Figure 36) comprises determining to use which compressed context; Action 36-2 comprises which determines to use encrypt context.As previously mentioned, compressed context determines and contextual definite can the interrelating of encryption.
260/
Action 36-3 comprises the value of determining MSN.In first mode of this form, sequence number MSN (for example, based on the agreement of header-compressed or the value of keeping according to this locality) is kept or produced to compression procedure.In second mode, from crypto process, obtain sequence number MSN as next sequence number, crypto process will be used for ordering with this next sequence number in cryptographic operation.
261/
Action 36-4 comprises the actual compression of the header of bag.As previously mentioned, bag can contain a plurality of headers such as RTP header, UDP header and IP header, and all these a plurality of headers can constitute the header of the bag shown in Figure 39 8-1.
262/
Action 36-5 comprises the not compression expression method of using MSN (it is used to the header of compressed package), and determines to wrap index together with the not compression expression method of MSN that for example roll counter (rollover counter) is used key to derive algorithm, encrypts the highest MSN in the context and is used for the header of compressed package.
263/
Action 36-6 comprises the lucky particular encryption algorithm of using of basis the net load of bag is encrypted.This just becomes the encrypted part of this bag.This algorithm can be " Security Real Time Protocol (SRTP) " (the Baugher M.et al. that for example is similar to according to people such as BaugherM, The SecureReal-time Transport Protocol (SRTP), IETF RFC3711, encryption March2004).
264/
Action 36-7 comprises the call parameter that upgrades in the encryption context, if be suitable for.
265/
Action 36-8 comprise will bag header compression and encryption section and such as feed back, cut apart, Context identifier, verification and etc. residue header compression channel information sets bag.
266/
Action 36-9 comprises the datagram that obtains to the transmission result of lower floor's (for example, media access control layer (MAC) or rlc layer).
267/
Running order among Figure 36 is variable.For example, the order between action 36-1 and action 36-2 can be changed.Equally, action 36-5, action 36-6 and action 36-7 can whole and action 36-4 transposings.
268/
Figure 37 describes by the elemental motion of the decompressor logic execution of receiving node or the elementary event of management.Action 37-1 (referring to Figure 37) comprise by handle such as feed back, cut apart, Context identifier, verification and etc. header compression channel information, will unpack from the datagram that lower floor receives.
269/
Action 37-2 comprises to determine to use which compressed context.Action 37-3 comprise determine to use which encrypt context (compressed context determine with encrypt contextual determine can be combined once more).
270/
Action 37-4 comprises sequence number MSN is decompressed.Action 37-5 comprises whole header compression is partly decompressed.
271/
Action 37-6 comprises the not compression expression method of MSN that is used for the header decompression of bag, and determines to wrap index together with the not compression expression method of MSN that for example roll counter (rollover counter) is used key to derive algorithm, encrypts the highest MSN in the context and is used for the header of compressed package.
272/
Action 37-7 comprises according to the encryption section deciphering (DecryptDecryption) of decipherment algorithm to bag.As previously mentioned, encrypt/decrypt for example can be similar to " Security Real Time Protocol (SRTP) " (the Baugher M.et al. according to people such as Baugher M, The Secure Real-time TransportProtocol (SRTP), IETF RFC3711, description March2004).
273/
Action 37-8 comprises the call parameter that upgrades in the encryption context, if be suitable for.Action 37-9 comprises to upper strata Data transmission bag.
274/
The running order of Figure 37 can be changed..For example, the order between action 37-2 and action 37-3 can be changed.Equally, action 37-5, action 37-6 and action 37-7 can whole and action 37-5 transposings.
4.3: sequence number is shared: some advantages
276/
There are many advantages in sequence number share technique, method, embodiment and system described here, include but not limited to that (1) expense minimizes; (2) little to the influence of existing standard and architecture; (3) contextual robustness is encrypted in mutually beneficial and improvement; And (4) are applicable to common header-compressed.
277/
The first routine advantage is that expense minimizes.The sequence number technology of sharing can be used for expanding the function that is provided by robust header compression, provides sequencing information to comprise to encryption function.When with the sequence number technology of sharing with use the password Change-over knot do not expand net load altogether the time, this may be particularly useful.
278/
The second routine advantage is little to the influence of existing standard and architecture.This programme is also very little to the influence of present system configuration and goal systems, and especially the encryption adaptation layer in the header-compressed embodiment does not require existing header compression algorithm or its standard are changed.Desired only is carry out just to encrypt the usage negotiation of (with the parameter that is used to encrypt) (may outside band) before activate encrypting based on compression MSN.In addition, the function of header-compressed described here expansion is not got rid of lower floor and is had their function of encrypting and reordering of being used to.Use as the combination that is proposed in, it allows lower floor to close their ordering and pass through mechanism according to the order of sequence before the independent encryption layer.This has reduced overhead.In other words, this is not that layer violation or cross-level are comprehensive.
279/
The 3rd routine advantage is mutual reciprocity and mutual benefit and improves and encrypt contextual robustness.Therefore encryption function is benefited from the robust features for the header compression algorithm of sequencing information, and has reduced and encrypted context and lose synchronous possibility to ordering.If taken place to lose for ordering synchronously, will take place from the inside of the Restoration Mechanism of header compression algorithm synchronously again.Encryption function can not brought the context infringement of header compression algorithm, because the non-compression section of its pack processing.In this, encryption function and header compression function can not brought negative influence mutually, and on behalf of cryptographic algorithm, header-compressed look after ordering robustness and paring down expenses.
280/
The 4th routine advantage is the applicability to general header-compressed.This applicability is given prominence to, for example, most of ROHC conventions be can use, ROHC RTP (0x0001), UDP (0x0002), IP (0x0004), ESP (0x0003), TCP (0x0006), UDP-Lite (0x0008), RTP/UDP-Lite (0x0007) header-compressed convention included but not limited to.This technology also especially is related to but is not limited to enciphering algorithm and cryptographic algorithm such as stream cipher, for example utilizes bit mask to allow only certain bits encrypt/not to be encrypted.The example of this stream cipher comprises A5, GEA, UEA and AES.Other relevant enciphering and cryptographic algorithm are that those utilize to sort and derive the algorithm that adds (separating) close required parameter.
281/
According to the sequence number technology of sharing, will encrypt to combine and be applied to the bag data with compression algorithm.This is encrypted for example to use and changes based on the password of the addition stream cipher of encrypting, and described addition stream cipher uses session key to derive the index of usefulness.Used index is the main sequence number (MSN) of compression protocol.
282/
The sequencing information that any process in encryption and/or header-compressed and/or net load compression and/or the signaling compression is used is derived in another process, i.e. any another one process in encryption and/or header-compressed and/or net load compression and/or the signaling compression.
283/
Any process in encryption and/or header-compressed and/or net load compression and/or the signaling compression is used the sequencing information that comes from another functional process, and described functional process is any process in encryption and/or header-compressed and/or net load compression and/or the signaling compression.
284/
Especially, when any process in encryption and/or header-compressed and/or net load compression and/or the signaling compression was used sequencing information, this sequencing information came from header compression function.
285/
Ordering is produced by crypto process, and makes ordering can be used for header compression algorithm.Main sequence number (MSN) when compression uses this ordering to compress as it.
286/
For example, aforesaid method is applicable to the specific occasion of wherein carrying out compression algorithm according to robust header compression (ROHC) agreement, and described robust header compression (ROHC) agreement includes but not limited to ROHC RTP (0x0001), UDP (0x0002), IP (0x0004), ESP (0x0003), TCP (0x0006), UDP-Lite (0x0008), RTP/UDP-Lite (0x0007) header compression protocol.
287/
For example, aforesaid method is applicable to some specific occasions when arbitrarily other general compression scheme is carried out header compressor and/or header decompressor wherein.
288/
For example, aforesaid method is applicable to that cryptographic algorithm and cryptographic algorithm are the concrete examples of stream cipher, include but not limited to A5, GEA, UEA and AES.Utilize sequencing information to derive to add other cryptographic algorithm of (separating) close required parameter and cryptographic algorithm also within the scope of the present invention.
289/
For example, aforesaid other compression algorithm that may be used on, for example compress such as the signaling of SigComp, (for example those are at " using the IP net load compression of DEFLATE " (Pereira of PereiraR. for the net load compression algorithm, R.IP Payload Compression Using DEFLATE, IETF RFC2394, December1998) and " use LZS IP net load compression " (Friend of Friend R and R.Monsour, R.et R.Monsour, IP PayloadCompression UsingLZS, IETF RFC2395, December1998) defined in), perhaps may be used on requiring sorting with verification and any other operation, be used to sort with verification and this information can be shared by other algorithm, this information origin also ends at same node point.
290/
For example, aforesaid method is applicable to aGW, the current part that is defined as the SAE/LTE operation in 3GPP RAN2 standardization effort group of aGW.
291/
There are many advantages in technology described here, method, embodiment and system, include but not limited to that (1) expense minimizes; (2) little to the influence of existing standard and architecture; (3) with encrypt contextual mutually beneficial and encrypt contextual enhancing robustness; And (4) are to the applicability of common header-compressed.
292/
Although above description comprises many features, these features should not be interpreted as limiting the scope of the invention and should be interpreted as only providing the illustration of some present preferred embodiments.Be appreciated that scope of the present invention comprises conspicuous to those skilled in the art other embodiment fully, and be appreciated that therefore this scope is not restrictive.On the structure corresponding with the key element of above-mentioned preferred embodiment, chemically reach on the function, the known equivalent of those of ordinary skill in the art is incorporated in here clearly, and be defined as being comprised in here.And, therefore for device or method, will being there is no need by each problem that the present invention solves of being found described, because the present invention will comprise this device or method.

Claims (19)

1. an operation comprises the method for sending node (20) and the telecommunications network of receiving node (22), it is characterized in that: locate at least a portion of the header portion of bag carried out compression and at least a portion of described bag carried out to encrypt at described sending node (20), state the decompression checking of bag and the degree that decryption verification becomes interdependence in described receiving node (22) place thereby described compression and described encryption are combined.
2. the described method of claim 1 also comprises:
(1) for the bag of locating at described sending node (20) that enters, to described compressed candidature part that enters bag and the described encryption candidate net load that enters bag partly determine initial verification and, and compressed to small part with the interface of having encrypted to small part pass through comprise in the bag described initial verification and; And
(2) pass through bag for the described interface of locating to receive at described receiving node (22), carrying out described deciphering and described decompression with after obtaining to restore bag, to described recovery bag determine the checking verification and, and with described checking verification and with described initial verification and relatively come to determine these two checking of described deciphering and described decompression.
3. the method for claim 2, wherein, action (1) is included in be positioned at that described sending node (20) locates described and enters to wrap and carry out following action:
(1-a) to described described compressed candidature part that enters bag and described described the encryptions candidate net load that enters bag partly determine described initial verification with;
(1-b) the described described compressed candidature that enters bag is partly carried out compression so that compression strings to be provided;
(1-c) at least the described described encryption candidate net load that enters bag is partly encrypted so that the encryption string to be provided;
(1-d) by pass through at described interface comprise at least in the bag described compression strings, described encryption string and described initial verification and, form and to pass through bag corresponding to the described described interface that enters bag; And
Wherein, action (2) is included in and is positioned at described interface that described receiving node (22) locates and passes through to wrap and carry out following action:
(2-a) the described interface of deciphering passes through the described encryption string of bag so that the deciphering string to be provided;
(2-b) the described interface of decompression passes through the described compression strings of bag so that the string that decompresses to be provided;
(2-c) with corresponding to determine in the action (1-a) described initial verification and mode to described decompression string and described deciphering string determine described checking verification with;
(2-d) with described checking verification and with described initial verification and relatively come to determine to these two checking of the decompression of action deciphering of (2-a) and action (2-b).
4. the described method of claim 3 wherein, is describedly partly encrypted the action of encrypting string to provide to the described described encryption candidate net load that enters bag at least, also comprises the described described compressed candidature that enters bag is partly encrypted to be included in the described encryption string.
5. the described method of claim 3 wherein, is partly encrypted the described action of encrypting string to provide to the described described encryption candidate net load that enters bag at least, also comprises described initial verification and encrypts to be included in the described encryption string.
6. the described method of claim 3 also comprises following actions:
(2-e) upgrade compressed context according to the described checking of action (2-d); And
(2-f) upgrade the encryption context according to the described checking of action (2-d).
7. the described method of claim 1 also comprises:
(1) for the bag of locating at described sending node (20) that enters, to at least a portion of the described compressed candidature part that enters bag determine initial verification and, described compressed candidature partly comprises sequence number, and compressed to small part and to the interface that small part has been encrypted pass through comprise in the bag described initial verification and; And
(2) pass through bag for the described interface of locating to receive at described receiving node (22), obtaining sequence number and carrying out deciphering and decompress with after obtaining to restore bag, to described recovery bag determine the checking verification and and with described checking verification and with described initial verification and the checking that relatively comes to determine described decompression.
8. the described method of claim 7, wherein, action (1) is included in described sending node (20) and locates the described bag that enters is carried out following action:
(1-a) determine described initial verification and, described initial verification and for as the lower part definite:
The described described compressed candidature part that enters bag, described compressed candidature partly comprises described sequence number;
(1-b) the described described compressed candidature that enters bag is partly carried out compression so that compression strings to be provided;
(1-c) at least the described described encryption candidate net load that enters bag is partly encrypted so that the encryption string to be provided;
(1-d) by pass through at described interface comprise at least in the bag described compression strings, described sequence number and described initial verification and, form and to pass through bag corresponding to the described described interface that enters bag;
Wherein, action (2) is included in described receiving node (22) and locates that described interface is passed through bag and carry out following action:
(2-a) pass through bag and obtain described sequence number from described interface;
(2-b) the described interface of deciphering passes through the described encryption string of bag so that the deciphering string to be provided;
(2-c) the described interface of decompression passes through the described compression strings of bag so that the string that decompresses to be provided;
(2-d) with corresponding to initial verification described in the action (1-a) and the mode of determining, at least to described decompression string determine described checking verification and;
(2-e) with described checking verification and with described initial verification and the checking of described decompression that relatively comes to determine action (2-c).
9. the described method of claim 7, wherein, action (1) is included in described sending node (20) and locates the described bag that enters is carried out following action:
(1-a) determine described initial verification and, described initial verification and for as the lower part definite:
The described described compressed candidature part that enters bag, described compressed candidature partly comprises described sequence number; And
The described encryption candidate net load part that enters bag, the described described encryption candidate net load part that enters bag derives for session key uses described sequence number;
(1-b) the described described compressed candidature that enters bag is partly carried out compression so that compression strings to be provided;
(1-c) at least the described described encryption candidate net load that enters bag is partly encrypted so that the encryption string to be provided;
(1-d) by pass through at described interface comprise at least in the bag described compression strings, described sequence number and described initial verification and, form and to pass through bag corresponding to the described described interface that enters bag;
Wherein, action (2) is included in described receiving node (22) and locates that described interface is passed through bag and carry out following action:
(2-a) pass through bag and obtain described sequence number from described interface;
(2-b) the described interface of deciphering passes through the described encryption string of bag so that the deciphering string to be provided;
(2-c) the described interface of decompression passes through the described compression strings of bag so that the string that decompresses to be provided;
(2-d) with corresponding to initial verification described in the action (1-a) and the mode of determining, at least to described decompression string and to described deciphering string determine described checking verification and;
(2-e) with described checking verification and with described initial verification and the checking of described decompression that relatively comes to determine action (2-c).
10. claim 8 or 9 described methods, wherein, the described at least described described encryption candidate net load that enters bag partly the encryption to provide encrypted the action of going here and there, and also comprises described at least a portion that enters the described compressed candidature part of bag is encrypted to be included in the described encryption string.
11. claim 8 or 9 described methods wherein, are describedly partly encrypted so that the action of described encryption string to be provided the described described encryption candidate net load that enters bag at least, also comprise described initial verification and encrypt to be included in the described encryption string.
12. claim 8 or 9 described methods also comprise following actions:
(2-f) upgrade compressed context according to the described checking of action (2-e); And
(2-g) upgrade the encryption context according to the described checking of action (2-e).
13. method of operating the bag sending node (20) of telecommunications network, wherein said bag sending node is configured at least a portion of the header portion of bag carried out compression and at least a portion of bag carried out encrypt, thereby makes described compression and described encryption combine the decompression checking of described bag and the degree that decryption verification becomes interdependence.
14. the described method of claim 13, wherein, for the bag of locating at described sending node (20) that enters, described bag sending node (20) be configured to the described compressed candidature part that enters bag and to the described encryption candidate net load that enters bag partly determine initial verification and, and in the bag that has compressed to small part and encrypted, comprise to small part described initial verification and, to transmit by interface.
15. the described method of claim 13, wherein, for the bag of locating at described sending node (20) that enters, described bag sending node (20) be configured to at least a portion of the described compressed candidature part that enters bag determine initial verification and, described compressed candidature partly comprises sequence number, described node also be configured to compressed to small part with the interface of having encrypted to small part pass through comprise in the bag described initial verification and, to transmit by interface.
16. method of operating the bag receiving node (22) of telecommunications network, wherein said bag receiving node (22) is configured to carry out the decompression and the deciphering of bag, described wrapping (1) at least a portion of its header portion carried out compression also (2) its at least a portion has been carried out encryption, become the degree of interdependence by the checking of the decompression of described bag receiving node (22) execution and deciphering thereby described compression and described encryption are combined.
17. the described method of claim 16, wherein, described bag receiving node (22) is configured to according to described checking compressed context and these two renewal of encryption context.
18. an operation comprises the method for the telecommunications network of sending node (20) and receiving node (22), it is characterized in that:
(1), encrypts the header compression of described bag but have except the header fields of header compression channel information, and pass through at interface and to comprise the header compression of having encrypted in the bag for the bag of locating at described sending node (20) that enters; And
(2) pass through bag for the described interface of locating to receive at described receiving node (22), from having the header fields acquired information of header compression channel information, and the deciphering of header compression of described interface being passed through bag.
19. the described method of claim 18, wherein, the described header fields with header compression channel information comprises: multiplexed identifier (MUX ID), header compression Format Type sign (FMT ID), main sequence number (MSN) and compression algorithm identifier (CAI).
CN2007800131468A 2006-04-12 2007-04-11 Data packet compressing and ciphering method, node and apparatus in remote communication network Active CN101421972B (en)

Applications Claiming Priority (13)

Application Number Priority Date Filing Date Title
US74472106P 2006-04-12 2006-04-12
US74472406P 2006-04-12 2006-04-12
US74471906P 2006-04-12 2006-04-12
US74471606P 2006-04-12 2006-04-12
US60/744,716 2006-04-12
US60/744,719 2006-04-12
US60/744,721 2006-04-12
US60/744,724 2006-04-12
US11/733,558 2007-04-10
US11/733,561 US20070242703A1 (en) 2006-04-12 2007-04-10 Binding/combining of plural telecommunications functions
US11/733,558 US8189586B2 (en) 2006-04-12 2007-04-10 Plural telecommunications functions having sharing transaction(s)
US11/733,561 2007-04-10
PCT/SE2007/050235 WO2007117217A2 (en) 2006-04-12 2007-04-11 Methods, nodes and apparatus for compression and encryption of data packets in a telecommunication network.

Publications (2)

Publication Number Publication Date
CN101421972A CN101421972A (en) 2009-04-29
CN101421972B true CN101421972B (en) 2011-06-08

Family

ID=40631551

Family Applications (2)

Application Number Title Priority Date Filing Date
CN2007800131468A Active CN101421972B (en) 2006-04-12 2007-04-11 Data packet compressing and ciphering method, node and apparatus in remote communication network
CN200780013166.5A Expired - Fee Related CN101421973B (en) 2006-04-12 2007-04-11 Method and device for plural telecommunications functions having sharing transaction(s)

Family Applications After (1)

Application Number Title Priority Date Filing Date
CN200780013166.5A Expired - Fee Related CN101421973B (en) 2006-04-12 2007-04-11 Method and device for plural telecommunications functions having sharing transaction(s)

Country Status (1)

Country Link
CN (2) CN101421972B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016183820A1 (en) * 2015-05-20 2016-11-24 华为技术有限公司 Method, device and base station for processing uplink data packet
CN109040117A (en) * 2018-08-21 2018-12-18 常熟市盛铭信息技术有限公司 A kind of agreement transportation system Internet-based and method
CN117768233B (en) * 2023-12-28 2024-07-23 四川赛狄信息技术股份公司 Telnet protocol-based server state query method and medium
CN118368144B (en) * 2024-06-18 2024-08-27 广东石油化工学院 Data transmission method, device, equipment and medium based on asymmetric encryption

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6154542A (en) * 1997-12-17 2000-11-28 Apple Computer, Inc. Method and apparatus for simultaneously encrypting and compressing data
US6959091B1 (en) * 2000-07-28 2005-10-25 Atmel Corporation Cryptography private key storage and recovery method and apparatus
US7266692B2 (en) * 2004-12-17 2007-09-04 Ntt Docomo, Inc. Use of modular roots to perform authentication including, but not limited to, authentication of validity of digital certificates

Also Published As

Publication number Publication date
CN101421973A (en) 2009-04-29
CN101421972A (en) 2009-04-29
CN101421973B (en) 2014-01-29

Similar Documents

Publication Publication Date Title
US20070242703A1 (en) Binding/combining of plural telecommunications functions
US8189586B2 (en) Plural telecommunications functions having sharing transaction(s)
US11323421B2 (en) Method and apparatus for encoding security status information
JP3751823B2 (en) Header compression in real-time services
EP1381011B1 (en) Data securing communication apparatus and method
CN103973645B (en) A kind of data transmission method and relevant apparatus
JP5392102B2 (en) Apparatus and method for reducing overhead in a wireless network
CN101513009A (en) Inclusion of quality of service indication in header compression channel
US20010052072A1 (en) Encryption of payload on narrow-band IP links
KR100703494B1 (en) Apparatus and Method for Transporting/receiving of Voice over Internet Protocol Packets with a User Datagram Protocol checksum in a mobile communication system
JP5598018B2 (en) System and method for reducing overhead in a wireless network
EP1405486B1 (en) Implicit packet type identification
CN101421972B (en) Data packet compressing and ciphering method, node and apparatus in remote communication network
WO2001056249A1 (en) Encryption of payload on narrow-band ip links
JP2009164695A (en) Wireless communication system and wireless communication apparatus
EP1926275A1 (en) Method for data communication between user end devices
EP2005640B1 (en) Plural telecommunications functions having sharing transaction(s)
US8300824B1 (en) System and method for encrypting data using a cipher text in a communications environment
JP2007201973A (en) Data transmission reception system, encrypted information sharing method, data transmission apparatus, and data reception apparatus
WO2007106548A2 (en) System and method of network cryptography

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant