Trusted Logic

France Telecom

Trusted Logic Mobility

Alexandre Frey

Renaud Marlet

Daniel Le Metayer

Axelle Apvrille

Arnaud Venet

Jean-Claude Pailles

Eric M Vetillard

Jean-Bernard Blanchet

Laurent Frerebeau

Cuihtlauac Alvarado

Matthieu Maupetit

Dominique Bolignano

Cédric Mesnil

Geoffroy Montel

Guillaume Bruyere

Fabien Venries

Gilles Peskine

Christophe Colas

The invention relates to a system and method for making data secure. The inventive system is characterized in that it comprises:&#x2014;a monotonic counter;&#x2014;a computational entity;&#x2014;a physical data medium comprising one or a plurality of data blocks, a first master block comprising the last value recovered from the monotonic counter, an identifier of the last data block written on said medium, a first authentication code guaranteeing the authenticity of the written data block or blocks, a second authentication code calculated from the last written data block, said data being fixed at a neutral value, and a third authentication code guaranteeing the authenticity of the first master block, and a second master block forming a replica of the first master block; and&#x2014;an authentication key. The invention is used, in particular, to make data secure against playback and sudden interruptions in service in embedded systems.

System and method for securing data

(EN)An electronic system () comprises a trusted processor (), a trusted cache memory () and a mass storage memory (). The data are stored in the mass storage memory (), where the memories are divided into blocks, each block is identified by an address and the data are addressed via a verification tree. The verification tree is a tree structure comprising nodes where descendent nodes are attached to a root node and each node stores the address of the block containing each of its child nodes and a digest value of each block. A method for the verification of the data of such an electronic system comprises access to searched data at the same time reporting the corruption of data if a calculated digest is different from the current digest value.

Data verification method

A method of securing a telecommunication terminal that is connected to a module used to identify a user of the terminal is described. The method includes a step including executing a procedure in which the terminal is matched to the identification module, consisting in: securely loading a first software program including a data matching key onto the identification module; securely loading a second software program which can operate in conjunction with the first software program onto the telecommunication terminal; transmitting a data matching key that corresponds to that of the first software program to the second software program; storing the transmitted data matching key in the secured storage zone of the telecommunication terminal; and conditionally submitting every response from the first software program to a request from the second software program upon verification at the true value of the valid possession of the data matching key by the second program.

Method for securing a telecommunications terminal which is connected to a terminal user identification module

According to the inventive method, the chip card, a counting function (FC), a counter (Cpt) and a private key (Cf) stored in the write-only part of the memory region are stored in a persistent memory, the counter and the private key (Cf) being accessible only by the counting function (FC). When the chip card receives a counter request emitted by an requesting entity (ER), the counting function (FC) performs a modification of the counter (Cpt) and a calculation of a signature, and sends a response to the applicant entity (ER). When the on-board system receives the response to the counter request, the signature contained in the response is checked.

Method for creating a secure counter on an on-board computer system comprising a chip card

The invention relates to a user interface-equipped computing device comprising means for implementing a series of applications, said means including two execution spaces. According to the invention, the applications of the second execution space (, P, P) have a level of security specifically higher than that of the applications of the first execution space (, P, P), said two execution spaces being hosted by a physical processing means which is designed such that it cannot be separated into two parts without destroying the physical processing means.

Telecommunication terminal comprising two execution spaces

A method for compressing an interpreted object code in a system using an interpreter, by identifying, in the interpreted object-coded program, similar non-contiguous groups of instructions, of arbitrarily complex structure, by replacing all or part of said groups in the interpreted object code of the program with newly-created specialized instructions and by instrumenting the interpreter and/or the interpreted object code of the program so as to render it capable of implementing the newly-created instructions.

Method for compression of object code interpreted by tree-structured expression factorization

The invention concerns a method for compressing program code for execution in a system with few physical resources. This method comprises a semantic analysis of the code as to identify the objects accessed at each program point and to replace in this program groups of instructions used to access the objects by more compact specialised instructions.

Semantic analysis based compression of interpreted code by replacing object instruction groups with special instruction specifying a register representing the object

An existing active base logic flow between a master transceiver and a slave transceiver, is selected as reference logic flow wherein is generated a set of concurrent logic flows. The concurrent logic flows are built with successive elementary packets segmenting pairs of command/response. An exchange of pairs of command/response is initialised and continued by the master transceiver on the basis of specific commands. The slave transceiver triggers a segmentation by transmitting specific responses on the reference logic flow.

PROTOCOL FOR TRANSMITTING A PLURALITY OF MULTIPLE EXCHANGE LOGIC FLOW OF COMMAND/RESPONSE PAIRS ON A SINGLE PHYSICAL EXCHANGE CHANNEL BETWEEN MASTER AND SLAVE AND CORRESPONDING SYSTEM FOR CONTROLLING AND MONITORING EXECUTION OF APPLETS

Growing community of inventors

Paris, France

Alexandre Frey