EP2860984B1 - Methode zur Verarbeitung von Kontrolldaten, und Sicherheitsmodul für die Umsetzung dieser Methode - Google Patents

Methode zur Verarbeitung von Kontrolldaten, und Sicherheitsmodul für die Umsetzung dieser Methode Download PDF

Info

Publication number
EP2860984B1
EP2860984B1 EP14172364.3A EP14172364A EP2860984B1 EP 2860984 B1 EP2860984 B1 EP 2860984B1 EP 14172364 A EP14172364 A EP 14172364A EP 2860984 B1 EP2860984 B1 EP 2860984B1
Authority
EP
European Patent Office
Prior art keywords
messages
message
priority level
standard
priority
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
EP14172364.3A
Other languages
English (en)
French (fr)
Other versions
EP2860984A1 (de
Inventor
Jean Keomany
Daniel Golaz
Philippe Mazeau
Jean-Luc Bussy
Sébastien Erard
William Beals
John D Hamrick
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.)
Nagrastar LLC
Original Assignee
Nagrastar LLC
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
Application filed by Nagrastar LLC filed Critical Nagrastar LLC
Priority to EP14172364.3A priority Critical patent/EP2860984B1/de
Priority to US14/501,262 priority patent/US9307276B2/en
Publication of EP2860984A1 publication Critical patent/EP2860984A1/de
Priority to CN201510324164.4A priority patent/CN105282615B/zh
Priority to TW104119169A priority patent/TWI775721B/zh
Priority to US15/810,465 priority patent/USRE49394E1/en
Application granted granted Critical
Publication of EP2860984B1 publication Critical patent/EP2860984B1/de
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/25—Management operations performed by the server for facilitating the content distribution or administrating data related to end-users or client devices, e.g. end-user or client device authentication, learning user preferences for recommending movies
    • H04N21/254—Management at additional data server, e.g. shopping server, rights management server
    • H04N21/2541—Rights Management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/48—Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806—Task transfer initiation or dispatching
    • G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/54—Interprogram communication
    • G06F9/546—Message passing systems or structures, e.g. queues
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/41—Structure of client; Structure of client peripherals
    • H04N21/418—External card to be used in combination with the client device, e.g. for conditional access
    • H04N21/4181—External card to be used in combination with the client device, e.g. for conditional access for conditional access
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/45—Management operations performed by the client for facilitating the reception of or the interaction with the content or administrating data related to the end-user or to the client device itself, e.g. learning user preferences for recommending movies, resolving scheduling conflicts
    • H04N21/462—Content or additional data management, e.g. creating a master electronic program guide from data received from the Internet and a Head-end, controlling the complexity of a video stream by scaling the resolution or bit-rate based on the client capabilities
    • H04N21/4623—Processing of entitlement messages, e.g. ECM [Entitlement Control Message] or EMM [Entitlement Management Message]

Definitions

  • the present invention relates to a method for processing messages intended to allow access to content with conditional access.
  • this method concerns priority management when several messages are received in a short period of time and must be processed in a certain order to allow access to content.
  • This method is particularly suited to the context of pay television.
  • the present invention also relates to a security module intended to implement this method.
  • encrypted data or content with conditional access is well known in the field of pay television, where encrypted content is generally broadcast by terrestrial transmitters, by satellite or by a cable network to a certain number of subscribers, each subscriber having a multimedia unit associated with, or containing a security module making it possible to decrypt the encrypted content for viewing.
  • the security module is in charge of security operations and is associated with the multimedia unit or a receiver.
  • a security module comprises on the one hand a conditional access module known by the acronym CAK (Conditional Access Kernel) and on the other hand, a processing module.
  • the conditional access module is in charge of managing the priorities of the messages that will be processed by the processing module.
  • This module of Processing performs the verification and / or authentication steps, and also deals with processing the messages transmitted to it and returning the result of the processing.
  • Such a processing module can be produced in particular according to four distinct forms. One of them is a microprocessor card, a smart card, or more generally an electronic module (having the form of a key, badge, etc.).
  • Such a module is generally removable and connectable to the receiver.
  • the form with electrical contacts is the most used, but does not exclude a contactless connection, for example of the ISO 14443 type.
  • a second known form is that of an integrated circuit box placed, generally permanently and irremovable, in the receiver box.
  • a variant consists of a circuit mounted on a base or connector such as a SIM module connector.
  • the processing module is integrated in an integrated circuit box also having another function, for example in a descrambling module of the decoder or the microprocessor of the decoder.
  • the processing module is not produced in hardware form, but its function is implemented in software only form.
  • the processing module has means for executing a program (CPU) stored in its memory.
  • the collaboration between the conditional access module (CAK) and the processing module allows the security module to perform security operations, verify rights, perform decryption or activate a decryption module etc.
  • scrambled or encrypted content can be descrambled or decrypted using a control word.
  • the control word is generally changed according to an interval, called cryptoperiod, relatively short, for example ten seconds. Every 10 seconds, or for each cryptoperiod, each subscriber receives, in an ECM control message (Entitlement Control Message), the control word necessary for decrypting the encrypted content in order to allow viewing or access to the data transmitted.
  • ECM control message Entitlement Control Message
  • the same control message or control messages containing the same control words are sent at regular intervals, for example every 50 ms. This repetition of messages allows a user arriving on a determined channel to access the control words which are necessary for him to decrypt the content of the determined channel without having to wait until the end of the cryptoperiod.
  • the control word itself is encrypted by a transmission key and is transmitted in encrypted form in the ECM control message.
  • the encrypted content and the encrypted control word are received by a multimedia unit which, if the subscriber is up to date with his subscription or more generally, if he has the corresponding access rights, has access to the use key. stored in a security module.
  • the encrypted control word is decrypted by the security module by means of the transmission key.
  • the security module transmits the control word to the decoder.
  • the encrypted content is decrypted by the decoder by means of the control word.
  • the transmission key is changed regularly, for example every month.
  • An EMM Entitlement Management Message is received monthly by the decoder and is transmitted to the security module.
  • the management message contains the transmission key in encrypted form.
  • a key assigned to the security module allows it to decrypt the encrypted transmission key.
  • the security modules currently used to process control messages have mainly a limited processing capacity.
  • the processing module can only process one message at a time, which implies storing and sequential processing of the messages when several messages are received by a multimedia unit in an interval of short time.
  • the manufacturers of decoders intended for pay television or conditional access have introduced broadband tuners which are capable of receiving a large number of content and message streams, for example 8, 16, 32 or even more streams. .
  • This can be a problem. Indeed, if an excessive number of messages is received simultaneously or for a relatively short duration, it is possible that the security module is not able to process all the messages received. This creates the risk that some of the content cannot be decrypted and that the user is in front of a black screen. This can in particular be the case if the management of the processing order of the messages is not well done.
  • this problem is addressed by assigning a priority to messages, this priority being defined according to the actual or possible use of the messages by a user. For example, the message flow corresponding to content being viewed by a user receives the highest priority, in order to avoid that a control message cannot be decrypted and that the user has a black screen.
  • the stream corresponding to content being recorded also has a high priority level, otherwise part of the recording may not be able to be made.
  • the predictive stream (s) have a lower priority. These predictive flows correspond to the channels for which the probability of viewing by the user is the highest. These channels can be channels with a channel number immediately adjacent to the channel currently being viewed. They can also be defined according to the user's profile.
  • the security module when the security module must process both a flow corresponding to the content viewed, a flow for content being recorded and predictive flows, the security module is highly stressed and the management of other flows becomes problematic. .
  • the content forming this mosaic comes from a specific channel. Indeed, in current systems, for example, it is not possible to decrypt enough messages to display a mosaic based on actual content. For this reason, it is essential to use a specific channel.
  • the priority for this kind of channels can be relatively low, which can cause problems such as the inability to display the mosaic.
  • the priorities are fixed. Thus, in certain situations, the user may find himself in front of a black screen. This could in particular be the case when the user zaps often and the security module is not able to process all the control messages which it receives.
  • US 2006/085828 A1 describes a method and apparatus for reducing a channel change delay on a television set.
  • F. Cottet, J. Delacroix, C. Kaiser and Z. Mammeri: "Real-time scheduling", December 31, 2000 describes the problem linked to centralized scheduling in the context of real-time applications.
  • the present invention proposes to solve the problems of the prior art by implementing a method for processing control messages which makes it possible to manage these messages in a more flexible and efficient manner. This problem is solved by the subject of the main claims presented below. Additional aspects are set out in the dependent claims.
  • the processing of the control messages is done in a flexible and efficient manner so that the user does not suffer any inconvenience.
  • This method is implemented in a security module comprising at least one processing unit and cooperating with at least one memory.
  • This memory can be integrated into the security module or be placed in another device.
  • the security module cooperates with a multimedia unit or is part of this multimedia unit.
  • the multimedia unit is formed by a decoder receiver and a security module cooperating with this decoder receiver.
  • the method for processing control messages makes it possible to ensure optimal processing which takes account of the limitations imposed by the processing capacities of the security module.
  • the messages are not treated according to a fixed and pre-established priority, but the management of the messages is made in a flexible way, according to the circumstances.
  • the order of processing messages depends on when the multimedia unit will actually need the content of the message to be processed.
  • the first control message (ECM) received for each channel is associated with a high priority level, that the following control messages for these same channels are in a level of priority lower than the high level, that control messages for predictive channels are classified in an even lower priority level category and that EMM management messages are associated with an even lower priority.
  • This invention defines "basic" management, whereby messages are processed starting with the messages with the highest priority, and then continuing processing with messages of lower and lower priority.
  • This "basic" management may not be respected when certain conditions are met, these conditions generally implying a risk that a message corresponding to a content being viewed or being recorded may not be deciphered in time to ensure a complete deciphering of the event.
  • the inversion of priority remains valid as long as the conditions of this inversion are fulfilled. When these conditions are no longer met, the processing order corresponding to basic management is again respected.
  • the present invention relates to a method of processing messages intended for pay-TV, in particular control messages containing at least one control word (CW Control Word) allowing the decryption of encrypted content and therefore, the viewing of content at conditional access.
  • the method of the invention also allows the processing of other types of messages such as management messages (EMM; Entitlement Management Messages), impulsive management messages (IEMM, Impulsive Entitlement Management Messages) used in particular during purchases. of products, or other types of messages.
  • ECM Entitlement Management Messages
  • IEMM Impulsive Entitlement Management Messages
  • This processing method is implemented in a security module formed by a conditional access module and a processing module, this security module being part of a multimedia unit.
  • the multimedia unit or its receiving part receives an encrypted content stream.
  • the security module receives from the receiver, a stream of ECM control messages.
  • This security module is in particular in charge of processing the control messages which it receives, the processing signifying in particular the verification of the access rights, then, if the access rights are present and valid, the decryption of the message of so as to extract the control word or words.
  • a control word is decrypted, it is transmitted to a decoder descrambling module which uses this control word to decrypt the content and to display it so that it can be viewed.
  • the Figures 1 to 6 schematically illustrate, a security module SC comprising at least one memory and a processing unit.
  • the memory can be unique and include several zones each corresponding to different memorized data. It is also possible to provide several memories, each of them storing different data. A combination of these two variants is also possible.
  • the security module includes a single memory, shared in several zones.
  • the functions of the security module can be carried out by an application.
  • the security module cooperates with a memory which is not part of this security module.
  • a fourth memory area corresponds to a counter whose function is explained in detail below.
  • the security module is in charge of processing messages corresponding to several channels denoted A, B, C, D, E, G and H.
  • Three priority levels are associated with control messages. These levels are noted 1st for the highest priority level, 2nd for the intermediate priority level and Std for the lowest priority level.
  • the lowest priority level is called the standard level.
  • the priority level noted 1st corresponds to a high priority and the priority level noted 2nd corresponds to a medium priority.
  • the priority levels different from the standard level, that is to say in the example considered, the high and medium levels, receive only first control messages for a determined channel.
  • a first message is the first message that arrives when conditions have just changed. Such a first message arrives in particular when the user has changed channels.
  • a first message will be sent for the channel on which the user has just connected, as well as on the predictive channels linked to this new channel viewed by the user.
  • These first messages are all stored in memories associated with high security levels (1st) or medium (2nd). More specifically, the first message corresponding to the channel on which the user has just zapped is generally stored in the memory area associated with the high priority level and the first messages corresponding to the predictive channels are generally stored in the memory area associated with the priority level way.
  • the security module receives subsequent messages for these channels, these messages, different from the first messages, are stored in a memory zone corresponding to a standard priority level. In the embodiments illustrated by figures 1 to 4 , the messages are stored in chronological order, the most recent messages being illustrated in the right part of the figures and the oldest messages in the left part.
  • the reference SC corresponds to the security module and more precisely to the processing module which is in charge of processing the control messages.
  • the letter which appears under the reference SC corresponds to the channel for which a message is being processed.
  • the horizontal lines correspond to a priority level, a determined priority level being able to be associated with a memory zone in which the messages are memorized before their processing. These messages are processed, for each horizontal line, according to the First In First Out principle, the first stored message, that is to say the one shown on the left in the figures, being processed first.
  • the processing module processes the message corresponding to a channel denoted A.
  • the standard priority level memory Std of the security module contains a message B corresponding to a first channel, a message corresponding to a second channel denoted C, a message corresponding to a third channel denoted D and a message corresponding to a fourth channel denoted E.
  • the messages placed in this memory zone and corresponding to the standard priority level are not first messages.
  • the channel B message counter value is 2, this value being defined as follows.
  • a message (A) has been processed since the reception of message B by the security module. The number of messages processed is therefore 1.
  • the rank of message B in the memory corresponding to the standard level is 1 since it is the first message in the queue corresponding to this priority level.
  • the message of channel C is associated with the value 3 which corresponds to the sum of 1 (number of messages processed since the reception of message C) and 2 (rank of message C in the standard level memory).
  • the message of channel D is associated with the value 4 and the message E of channel E is associated with the value 5.
  • a counter threshold value is also set. It is for example equal to 5 in the example used. This value is known to the security module and / or to the processing module.
  • the user zaps from channel D to channel G.
  • the first message from channel G is placed in the memory corresponding to the high priority. Since the H channel is a predictive channel (on which the user is likely to zap), the first message for this channel is stored in the memory corresponding to the average priority level.
  • the messages denoted D, which corresponded to the channel previously viewed by the user, as well as E which was a predictive channel, being no longer useful, the corresponding messages are eliminated. This is represented by the figure 1b .
  • the message G corresponding to the highest priority is processed by the processing module.
  • the value of the counter is modified according to a pre-established rule, In the examples of figures 1 to 4 , this pre-established rule consists in incrementing the value of the counter by one unit for each message processed.
  • the counter value associated with the messages of standard priority level is incremented by 1, to go to 3 for message B corresponding to channel B and to 4 for message C of channel C.
  • the message of channel H is processed in the processing module.
  • the counter value for message B of channel B is incremented by 1 to go to 4.
  • the value for channel C goes to 5.
  • the first message of the standard level memory Std that is to say B, is processed and the processing of the messages continues in a conventional manner.
  • the initial situation is identical to what is represented by the figure 1 .
  • the user zaps from channel D to channel E, which was a predictive channel.
  • F becomes a new predictive channel and the first message of channel F is stored in the memory corresponding to the average priority level (2nd).
  • the user then zaps on channel F, channel G becoming a predictive channel.
  • the first message of channel G is stored in the memory corresponding to the average priority level 2nd while the processing module processes the message of channel F.
  • the counter value associated with messages of standard level Std is incremented by the fact that the message F was treated. This value becomes 3 for B, 4 for C and 5 for E. This is illustrated by the figure 2c .
  • Message I is stored in the memory corresponding to the medium priority level 2nd and the counter values are incremented to go to 5 for B and 6 for C.
  • the threshold value being 5 and the counter value for C being greater than this threshold value, the first message of the memory corresponding to the standard level Std is processed, before the message I corresponding to a higher priority level than the standard level.
  • Message B will therefore be processed in the processing module.
  • the counter value for message C will remain above the threshold value. Therefore, the message C will be processed in the processing module, before the message I corresponding to the average security level. This is illustrated by the figures 2e and 2f .
  • the standard level no longer contains a message associated with a counter value greater than the threshold value.
  • the highest security level message in this case I, can then be processed in the processing module.
  • a message of standard priority level has a value greater than the threshold value has the effect of triggering the processing of a message of standard priority level, before the processing of a message of higher priority level . It should be noted that it is not necessarily the message that triggered the change of priority that is processed, but the first message in the queue or in the memory area corresponding to the standard level.
  • the fact that the counter value associated with a message C is greater than the threshold value has the effect of modifying the order of priorities.
  • the next message that is processed is message B, associated with a value equal to the threshold value and not message C, associated with a higher value and having triggered the change of priority.
  • two users share the same security module.
  • the second user zips from channel D to channel G while the first user zaps from channel A to channel K.
  • the first message from channel G is stored in the memory corresponding to the high level while the message corresponding to the predictive channel H is stored in the memory corresponding to the average level.
  • the message of channel K is then memorized in the memory corresponding to the high level while the message G is processed by the processing module. This corresponds to the figure 3c .
  • the counter value for message C is incremented and messages with the highest priority level are processed. These messages are in order K, H and L. This corresponds to the 3d and 3rd figures .
  • the counter value for C is equal to 6, which is higher than the threshold value.
  • the first message having a standard priority level here the message C
  • the user unit receives messages allowing a mosaic to be produced. These messages correspond to channels K, L and M.
  • messages K, L and M are processed before the counter value for standard level messages exceeds the threshold value. This threshold value is exceeded after the processing of the message M illustrated in the figure 4e .
  • the security module When the security module receives a new message N, of medium priority level, it is put on hold to allow the prior processing of messages C and D corresponding to the standard priority level. This is due to the fact that the counter value has exceeded the threshold value by one of the messages of the standard priority level.
  • the processing of the message N is carried out after the messages of standard priority level have been processed.
  • the configuration of the security module is slightly different from that of the modules of the previous embodiments.
  • the memory contains two priority levels, one of them corresponding to a high level, denoted 1st and the other corresponding to a lower level, denoted Std. and called standard level.
  • the average priority level present in the embodiments of the figures 1 to 4 is therefore absent in this example.
  • the counter contains durations and the incrementation of the counter is not done by steps of one unit, but depends on how long messages are processed, as explained below.
  • the security module contains means for determining a duration. These means can be a clock and means for determining the instant between the start and the end of the processing of a message.
  • These means for determining a duration may also include a clock external to the security module, this clock communicating times or durations to the security module.
  • One way to determine a duration is by affixing a time stamp (Time Stamp) to each message.
  • Time Stamp time stamp
  • messages with a standard priority level are no longer associated with an integer depending on their place in a queue, as in the previous examples, but rather with a duration.
  • each message is associated with the duration of storage in the memory, or in other words, with the duration between the moment when this message was memorized in the memory of the security module and the present moment, this present moment. corresponding to the time at which the security module checks which is the next message to be processed. This duration is determined immediately after completing the processing of a message.
  • the threshold value is no longer a "small" linked whole number, as in the embodiments illustrated by the figures 1 to 4 , the number of priority messages that can be processed before a standard level message, without causing a problem.
  • the threshold value is linked to a duration. In the examples described, this duration is measured in milliseconds. It could be measured in another unit, for example in seconds or even in an arbitrary unit of time. The duration could also be measured in a value which depends on a duration, for example a number of pulses, provided that these pulses are delivered at a regular interval.
  • standard priority level messages are all associated with the same VS threshold value that has been fixed at 3000 ms.
  • This threshold value depends on the cryptoperiod and the number of channels for which messages can be sent during this cryptoperiod.
  • the corresponding cell of the line marked TAE indicates the time value associated with this message. This time value, corresponds to the actual waiting time or in other words, to the time that the message has spent in memory.
  • the message B1 is for example associated with the value 2800 ms, which means that this message was memorized 2800 ms ago.
  • Message C1 is associated with the value 2000 ms and message B2 has the value of 500 ms.
  • the message C2 is associated with the value 0, which means that it has just been memorized by the memory of the security module.
  • the value associated with the messages stored in the memory of the security module is compared with the threshold value.
  • the messages are stored in the form of a queue in an order corresponding to a decreasing effective waiting time TAE. It is therefore sufficient to compare the TAE value of the first message in the queue with the threshold value.
  • the highest value associated with a message is 2800 ms for message B1. This value is lower than the threshold value which is 3000 ms.
  • messages are processed according to their priority level.
  • the message with the highest and oldest priority level stored in the memory of the security module is the message G.
  • the figure 5b illustrates the state of the memory after the processing of message G, assuming that the processing of this message lasted 220 ms.
  • the value associated with each standard priority level message is modified according to a predefined rule, the rule consisting in the present case, of adding the effective processing time of the previous message, which amounts to measuring the effective wait time TAE of every message. According to this example, a 220 ms duration is therefore added to each TAE value associated with the various standard priority level messages.
  • the value assigned to message C1 is 2220 ms; it is 720 ms for message B2 and 220 ms for message C2.
  • the highest value here 3020 ms, is compared to the threshold value, which has been set at 3000 ms.
  • This threshold value being exceeded the message B1 is treated as a priority, before the processing of the message H which has a higher degree of priority.
  • the processing of this message B1 is illustrated by the figure 5c .
  • this processing lasted 200 ms.
  • a value of 200 ms is then added to the value associated with each standard priority level message.
  • the new values associated with standard priority level messages are then 2420 for C1, 920 for B2 and 420 for C2. Since none of these values exceeds the threshold value, the "normal" priority is respected, which means that the oldest message, with the highest priority level, is processed.
  • This message is the message noted H in the example illustrated by the figure 5d .
  • This example has the advantage of taking into account the effective time that each standard level message has spent in the memory of the security module.
  • the threshold value was common to all the messages having the standard priority level.
  • a different threshold value can be assigned to different messages. This allows in particular to manage messages for channels whose cryptoperiods are different.
  • the memory of the security modules includes different memory zones.
  • the security module comprises, as in the example illustrated by the figure 5 , a memory area for receiving messages of high priority level (1st) and a memory area for storing the effective wait time TAE. In addition to this, it has a incremental counter arranged to memorize the position of each message in the queue. This counter is designated by Rg in the figure 6 .
  • the security module further comprises a memory zone intended for storing an expected waiting time TAP, another memory zone for memorizing the threshold value and finally a memory for memorizing the remaining time TR, this remaining time being defined as the difference between the threshold value VS and the effective waiting time TAE.
  • some messages (E2, E3, E4) have a first threshold value which is 3000 ms in this example, while message F2 has another threshold value, here 2000 ms. This threshold value is stored with each message.
  • the parameters linked to the same message are represented in the same column on the Figures 6a and 6b .
  • the threshold value is contained in the ECM message itself, preferably in a clear part of this message.
  • each message is associated with an effective waiting time TAE, a threshold value VS and a predictable waiting time.
  • This foreseeable waiting time depends on the effective waiting time TAE and on a rank of the message in the queue, this rank being given by the value of the incremental counter for this message. It also depends on a theoretical processing time P '. According to a first embodiment, this theoretical processing time is the maximum time necessary to process a control message. According to a second embodiment, the theoretical processing time is an average of the effective processing times on a certain number of messages, for example the last 16 messages. In the example of the figure 6 , this maximum processing time is 250 ms.
  • the expected wait time TAP is equal to the effective wait time TAE for the first message in the priority level message queue standard. For each subsequent message in this queue, a duration corresponding to the theoretical processing time is added.
  • messages of a given priority level are processed according to the FIFO (First In First Out) principle.
  • a message of a given priority level received by the security module is stored at the end of the message queue for this priority level.
  • the messages of the standard security level are classified according to an increasing order of the remaining times TR. So, in the example illustrated by the figure 6b , message F2 has a threshold value of 2000 ms.
  • the remaining time is equal to the threshold value, ie 2000 ms. This remaining time is less than the remaining time for messages E3 and E4.
  • the message F2 is introduced between the message E2 and the message E3, so as to be processed after the message E2, but before the message E3. This way of doing things allows us to take into account, at best, the imperatives of processing each individual message. In particular, this makes it possible to take into account the fact that the messages can be associated with cryptoperiods having different durations.
  • the values of the various parameters of the messages of standard priority level are recalculated.
  • the minimum remaining time is sought. If no higher priority message than the standard level is pending processing, the message with the shortest remaining time is processed. If the minimum remaining time for a message is less than the threshold value, for example zero, the message associated with this negative remaining time is treated as a priority, that is to say before any message of higher priority level. If the minimum remaining time is positive or zero and if at least one message with a higher priority level than the standard level is awaiting processing, the normal priority is respected, i.e. the oldest message among the messages with the highest priority level is processed first.
  • the remaining time TR is calculated as the difference between the threshold value VS and the effective waiting time TAE in the example of figures 6 .
  • TR VS - TAP.
  • the present invention makes it possible to ensure that standard messages, that is to say those which are not first messages for a given channel, are processed early enough so that the user has access to the content with conditional access without interruption. . It also allows you to manage messages from sources using different cryptoperiods.
  • the present invention has been described essentially with examples using two or three priority levels and using ECM control messages. It is possible to provide for a much higher number of priority levels, for example up to 256 and to process, according to the same method, a mixture of control messages, management messages and other messages.

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Security & Cryptography (AREA)
  • Storage Device Security (AREA)
  • Debugging And Monitoring (AREA)

Claims (15)

  1. Verfahren zur Verarbeitung von Nachrichten, die dazu bestimmt sind, einen Zugriff auf Inhalte mit bedingtem Zugriff zu erlauben, umfassend folgende Schritte:
    Empfang einer Vielzahl von Nachrichten durch ein Sicherheitsmodul, das mindestens ein Modul für bedingten Zugriff, CAK, und ein Verarbeitungsmodul umfasst, wobei die Nachrichten in mindestens zwei verschiedene Kategorien eingeteilt werden;
    Zuweisung einer unterschiedlichen Prioritätsstufe an die Nachrichten jeder verschiedenen Kategorie, wobei eine der genannten Prioritätsstufen als hoch und eine andere Prioritätsstufe, die niedriger als die hohe Prioritätsstufe ist, als Standard-Prioritätsstufe definiert ist;
    dadurch gekennzeichnet, dass es ferner folgende Schritte umfasst:
    Zuordnung eines bestimmten Werts an jede gegebene Nachricht, der die Standard-Prioritätsstufe zugewiesen wurde, wobei dieser Wert einer Anzahl von seit dem Empfang der gegebenen Nachricht verarbeiteten Nachrichten entspricht, die zum Rang der gegebenen Nachricht in der Standard-Prioritätsstufe addiert wird;
    Zuweisung mindestens eines Schwellenwertes für den Wert, der den Nachrichten mit einer Standard-Prioritätsstufe zugeordnet ist;
    Vergleich zwischen dem Schwellenwert für eine bestimmte Nachricht und dem dieser Nachricht zugeordneten Wert;
    solange kein den Nachrichten mit Standard-Prioritätsstufe zugeordneter Wert den entsprechenden Schwellenwert überschreitet, Verarbeitung der Nachrichten entsprechend ihrer Prioritätsstufe, wobei eine Nachricht, der die hohe Prioritätsstufe zugewiesen wurde, vor einer Nachricht verarbeitet wird, der eine niedrigere Prioritätsstufe zugewiesen wurde, und Inkrementierung des jeder Nachricht der Standard-Prioritätsstufe zugeordneten Wertes um eine Einheit pro verarbeitete Nachricht; und
    wenn der einer der genannten Nachrichten mit Standard-Prioritätsstufe zugeordnete Wert den Schwellenwert für die entsprechende Nachricht überschreitet, Verarbeitung der Nachricht mit Standardstufe mit Rang 1 vor der Verarbeitung einer Nachricht mit einer höheren Prioritätsstufe.
  2. Verfahren nach Anspruch 1, wobei das Modul für bedingten Zugriff so konfiguriert ist, dass es die Prioritäten der Vielzahl von Nachrichten verwaltet, und das Verarbeitungsmodul so konfiguriert ist, dass es die Vielzahl von Nachrichten prüft.
  3. Verfahren nach Anspruch 1, wobei das Sicherheitsmodul einen ersten Speicherbereich zum Speichern von Nachrichten mit hoher Priorität und einen zweiten Speicherbereich zum Speichern von Nachrichten mit Standardpriorität umfasst.
  4. Verfahren nach Anspruch 3, wobei der erste Speicherbereich Nachrichten speichert, die prädiktiven Strömen entsprechen, wobei die prädiktiven Ströme Datenströmen entsprechen, die die höchste Wahrscheinlichkeit haben, von einem Benutzer betrachtet zu werden.
  5. Verfahren nach Anspruch 3, wobei das Sicherheitsmodul ferner einen dritten Speicherbereich zum Speichern von Nachrichten mittlerer Priorität und einen vierten Speicherbereich zum Speichern von Zählerwerten für die Vielzahl von Nachrichten aufweist.
  6. Verfahren nach Anspruch 3, wobei der erste Speicherbereich Nachrichten speichert, die einem von einem Benutzer betrachteten Kanal entsprechen, und der dritte Speicherbereich Nachrichten speichert, die prädiktiven Strömen entsprechen.
  7. Verfahren nach Anspruch 3, wobei die Vielzahl der empfangenen Nachrichten in chronologischer Reihenfolge in mindestens einem der ersten und zweiten Speicherbereiche gespeichert werden.
  8. Sicherheitsmodul, das mindestens ein Modul für bedingtem Zugriff, CAK, Mittel zum Empfang von in mindestens zwei verschiedenen Kategorien eingeteilten Nachrichten und ein Modul zur Verarbeitung dieser Nachrichten, SC, umfasst, wobei den Nachrichten jeder verschiedenen Kategorie eine verschiedene Prioritätsstufe zugewiesen wird, wobei eine der genannten Prioritätsstufen als hoch und eine andere der Prioritätsstufen, die niedriger als die hohe Prioritätsstufe ist, als Standard-Prioritätsstufe definiert ist; wobei jeder Nachricht, der die Standard-Prioritätsstufe zugewiesen wurde, ein bestimmter Wert zugeordnet wird, wobei dieser Wert einer Anzahl von seit dem Empfang der gegebenen Nachricht verarbeiteten Nachrichten entspricht, die zum Rang der gegebenen Nachricht in der Standard-Prioritätsstufe addiert wird; wobei dem Wert, der den Nachrichten mit Standardprioritätsstufe zugeordnet ist, ein Schwellenwert zugewiesen wird, wobei dieses Sicherheitsmodul dadurch gekennzeichnet ist, dass es außerdem Mittel zum Vergleich des Schwellenwertes für eine gegebene Nachricht mit dem der gegebenen Nachricht zugeordneten Wert sowie Mittel zur Verarbeitung der Nachrichten gemäß ihrer Prioritätsstufe umfasst, wobei:
    solange kein den genannten Nachrichten mit Standard-Prioritätsstufe zugeordneter Wert den entsprechenden Schwellenwert überschreitet, die Nachrichten entsprechend ihrer Prioritätsstufe verarbeitet werden, wobei eine Nachricht, der die hohe Prioritätsstufe zugewiesen wurde, vor einer Nachricht verarbeitet wird, der eine niedrigere Prioritätsstufe zugewiesen wurde, und der jeder Nachricht der Standard-Prioritätsstufe zugeordnete Wert um eine Einheit pro verarbeitete Nachricht inkrementiert wird; und
    wenn der einer der genannten Nachrichten mit Standard-Prioritätsstufen zugeordnete Wert den Schwellenwert für die entsprechende Nachricht überschreitet, die Nachricht mit Standardstufe mit Rang 1 vor einer Meldung mit einer höheren Prioritätsstufe verarbeitet wird.
  9. Sicherheitsmodul nach Anspruch 8, dadurch gekennzeichnet, dass es mit einem Speicher zusammenarbeitet, in dem die Nachrichten gespeichert sind.
  10. Sicherheitsmodul nach Anspruch 9, dadurch gekennzeichnet, dass der genannte Speicher in diesem Sicherheitsmodul enthalten ist.
  11. Sicherheitsmodul nach Anspruch 8, dadurch gekennzeichnet, dass es einen Zähler umfasst.
  12. Sicherheitsmodul nach Anspruch 8, wobei das Modul für bedingten Zugriff so konfiguriert ist, dass es die Prioritäten der Vielzahl von Nachrichten verwaltet, und das Verarbeitungsmodul so konfiguriert ist, dass es die Vielzahl von Nachrichten prüft.
  13. Sicherheitsmodul nach Anspruch 8, das ferner einen ersten Speicherbereich zum Speichern von Nachrichten hoher Priorität und einen zweiten Speicherbereich zum Speichern von Nachrichten mit Standardpriorität umfasst.
  14. Sicherheitsmodul nach Anspruch 8, wobei der erste Speicherbereich Nachrichten speichert, die prädiktiven Strömen entsprechen, wobei die prädiktiven Ströme Datenströmen entsprechen, die die höchste Wahrscheinlichkeit haben, von einem Benutzer betrachtet zu werden.
  15. Sicherheitsmodul nach Anspruch 8, das ferner einen dritten Speicherbereich zum Speichern von Nachrichten mittlerer Priorität und einen vierten Speicherbereich zum Speichern von Zählerwerten für die Vielzahl von Nachrichten umfasst.
EP14172364.3A 2013-10-10 2014-06-13 Methode zur Verarbeitung von Kontrolldaten, und Sicherheitsmodul für die Umsetzung dieser Methode Active EP2860984B1 (de)

Priority Applications (5)

Application Number Priority Date Filing Date Title
EP14172364.3A EP2860984B1 (de) 2013-10-10 2014-06-13 Methode zur Verarbeitung von Kontrolldaten, und Sicherheitsmodul für die Umsetzung dieser Methode
US14/501,262 US9307276B2 (en) 2013-10-10 2014-09-30 Processing method for control messages and security module to carry out said method
CN201510324164.4A CN105282615B (zh) 2014-06-13 2015-06-12 用于控制消息的处理方法及系统
TW104119169A TWI775721B (zh) 2013-10-10 2015-06-12 用以控制訊息之處理方法及實施該方法之安全模組
US15/810,465 USRE49394E1 (en) 2013-10-10 2017-11-13 Processing method for control messages and security module to carry out said method

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
EP13188117 2013-10-10
EP14172364.3A EP2860984B1 (de) 2013-10-10 2014-06-13 Methode zur Verarbeitung von Kontrolldaten, und Sicherheitsmodul für die Umsetzung dieser Methode

Publications (2)

Publication Number Publication Date
EP2860984A1 EP2860984A1 (de) 2015-04-15
EP2860984B1 true EP2860984B1 (de) 2020-03-25

Family

ID=49356239

Family Applications (1)

Application Number Title Priority Date Filing Date
EP14172364.3A Active EP2860984B1 (de) 2013-10-10 2014-06-13 Methode zur Verarbeitung von Kontrolldaten, und Sicherheitsmodul für die Umsetzung dieser Methode

Country Status (3)

Country Link
US (2) US9307276B2 (de)
EP (1) EP2860984B1 (de)
TW (1) TWI775721B (de)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2860984B1 (de) 2013-10-10 2020-03-25 Nagrastar L.L.C. Methode zur Verarbeitung von Kontrolldaten, und Sicherheitsmodul für die Umsetzung dieser Methode
US11082486B1 (en) * 2020-01-31 2021-08-03 Slack Technologies, Inc. Group-based communication apparatus configured to implement operational sequence sets and render workflow interface objects within a group-based communication system

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070234395A1 (en) * 2004-10-15 2007-10-04 Vincent Dureau Speeding up channel change
JP2008517536A (ja) * 2004-10-15 2008-05-22 オープンティーヴィー，インク． チャンネル間変更の高速化
EP1705915A1 (de) * 2005-03-22 2006-09-27 Nagravision S.A. Verfahren zur Verwaltung des Zugriffs an Daten mit bedingtem Zugriff für ein schnelles Zapping
US20090313665A1 (en) 2008-06-17 2009-12-17 Tandberg Television Inc. Digital rights management licensing over third party networks
US8380965B2 (en) * 2009-06-16 2013-02-19 International Business Machines Corporation Channel-based runtime engine for stream processing
US20110177775A1 (en) 2010-01-13 2011-07-21 Qualcomm Incorporated Signaling mechanisms, templates and systems for creation and delivery of interactivity events on mobile devices in a mobile broadcast communication system
CN101996099A (zh) * 2010-11-17 2011-03-30 山东中创软件工程股份有限公司 一种消息处理方法及系统
WO2012169132A1 (ja) * 2011-06-10 2012-12-13 三菱電機株式会社 無線通信装置
EP2860984B1 (de) 2013-10-10 2020-03-25 Nagrastar L.L.C. Methode zur Verarbeitung von Kontrolldaten, und Sicherheitsmodul für die Umsetzung dieser Methode

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
None *

Also Published As

Publication number Publication date
TW201611593A (zh) 2016-03-16
EP2860984A1 (de) 2015-04-15
US20150106834A1 (en) 2015-04-16
US9307276B2 (en) 2016-04-05
TWI775721B (zh) 2022-09-01
USRE49394E1 (en) 2023-01-24

Similar Documents

Publication Publication Date Title
EP2055102B1 (de) Verfahren zur übertragung eines zusätzlichen datum zu einem empfangsendgerät
EP1900211B1 (de) Verfahren und einrichtung zur kontrolle des zugangs zu verschlüsselten daten
EP1827019A1 (de) Zugangskontroll-verfahren zu verschlüsselten Daten
EP1890493A1 (de) Verfahren zum Widerrufen von Sicherheitsmodulen zur Sicherung Rundfunknachrichten
EP2740031B1 (de) Verfahren zum glätten der arbeitsbelastung eines servers
FR2833446A1 (fr) Protocole de controle du mode d'acces a des donnees transmises en mode point a point ou point multi-point
EP2860984B1 (de) Methode zur Verarbeitung von Kontrolldaten, und Sicherheitsmodul für die Umsetzung dieser Methode
WO2015007549A1 (fr) Methode pour la protection de cles de dechiffrement dans un decodeur et decodeur pour la mise en oeuvre de cette methode
EP1705915A1 (de) Verfahren zur Verwaltung des Zugriffs an Daten mit bedingtem Zugriff für ein schnelles Zapping
EP3248379B1 (de) Verfahren zur ausstrahlung von geschützten multimediainhalten
EP1595399B1 (de) Pay-fernsehen, verfahren zum entziehen von rechten in einem solchen system, assoziierter decoder und chipkarte und an einen solchen decoder übertragene nachricht
WO2004051390A2 (fr) Dispositif susceptible d'utiliser un logiciel sécurisé interne ou externe et procédé d'utilisation correspondant
EP2633677A1 (de) Verfahren für den empfang von mithilfe von steuerwörtern und eines sicherheitscodes verschlüsselten multimedia-inhalten
EP1452026B1 (de) Verfahren zum verteilen verwürfelter digital-datenentschlüsselungsschlüssel
WO2008096066A2 (fr) Procede de gestion du nombre de visualisations, processeur de securite et terminal pour ce procede
EP2304944A1 (de) Verfahren für den schutz von über ein sendegerät an ein empfangsgerät üebrtragenen sicherheitsdaten
EP1723790B1 (de) Verfahren zum sichern von durch einen ausstrahler ausgestrahltem verschlüsseltem inhalt
FR3069996B1 (fr) Procede de lecture d'un flux multimedia chiffre avec acces rapide au contenu en clair et dispositif d'utilisation
CN105282615B (zh) 用于控制消息的处理方法及系统
EP2326035B1 (de) Verarbeitungsverfahren durch ein Nachrichtensicherheitsmodul mit Zugriffskontrolle auf einen Inhalt, und damit verbundenes Sicherheitsmodul
EP1492346A1 (de) System zur gleichzeitigem Verarbeitung von mindestens 2 Kanälen mit bedingtem Zugriff
EP2061243A1 (de) Verfahren zum Zugriff auf Daten mit bedingtem Zugriff
WO2010001022A1 (fr) Mise a jour de droits d'acces a un contenu audiovisuel protege
EP2334007A1 (de) Verfahren zur Datenentschlüsselung durch eine Benutzereinrichtung bestehend aus einem Endgerät und einem Sicherheitsmodul

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20140613

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

RIN1 Information on inventor provided before grant (corrected)

Inventor name: GOLAZ, DANIEL

Inventor name: MAZEAU, PHILIPPE

Inventor name: BUSSY, JEAN-LUC

Inventor name: HAMRICK, JOHN D

Inventor name: ERARD, SEBASTIEN

Inventor name: BEALS, WILLIAM

Inventor name: KEOMANY, JEAN

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: NAGRASTAR L.L.C.

R17P Request for examination filed (corrected)

Effective date: 20151012

RBV Designated contracting states (corrected)

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

RIN1 Information on inventor provided before grant (corrected)

Inventor name: HAMRICK, JOHN D

Inventor name: GOLAZ, DANIEL

Inventor name: BUSSY, JEAN-LUC

Inventor name: MAZEAU, PHILIPPE

Inventor name: ERARD, SEBASTIEN

Inventor name: KEOMANY, JEAN

Inventor name: BEALS, WILLIAM

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

17Q First examination report despatched

Effective date: 20180504

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

INTG Intention to grant announced

Effective date: 20191203

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

Free format text: NOT ENGLISH

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 1249967

Country of ref document: AT

Kind code of ref document: T

Effective date: 20200415

Ref country code: IE

Ref legal event code: FG4D

Free format text: LANGUAGE OF EP DOCUMENT: FRENCH

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602014062749

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200625

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200625

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200626

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20200325

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200818

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200725

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1249967

Country of ref document: AT

Kind code of ref document: T

Effective date: 20200325

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602014062749

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

26N No opposition filed

Effective date: 20210112

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20200613

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20200630

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20200613

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20200630

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20200630

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20200630

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20230509

Year of fee payment: 10

Ref country code: DE

Payment date: 20230509

Year of fee payment: 10

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20230510

Year of fee payment: 10