Alcatel Lucent

Alcatel-Lucent USA Inc.

Vladimir Y Kolesnikov

Hubert Rae McLellan, Jr

Young Jin Kim

Ranjit Kumaresan

Gordon Thomas Wilfong

Juan A Garay

Sape Jurrien Mullender

Marina Thottan

Thomas Schneider

Virendra Kumar

Karl Georg Hampel

Howard C Huang

Peter Bosch

Vijay Kumar Gurbani

Abdullatif Shikfa

Philippe Guillaume Dobbelaere

Wonsuck Lee

Hendrikus Gp Bosch

Jim McKie

Gilles Baechler

Bart Antoon Rika Theeten

Koen Daenen

Bart Theeten

Sriram Nandha Premnath

William S Kennedy

Abishek Kumarasubramanian

Rae Mclellan

Sape Mullender

Peter Bosh

An authentication request message is sent from a first computing device to a second computing device, wherein the first computing device and the second computing device communicate via a machine-to-machine communication protocol, and wherein the authentication request comprises a token issued by the second computing device and stored in a key obfuscation block of the first computing device. A challenge message is received at the first computing device from the second computing device. In response to the challenge message, a session key is computed at the key obfuscation block of the first computing device, wherein the session key is computed based on a secret shared between the first computing device and the second computing device. Upon generating the session key, the first computing device extracts a value from the challenge message and generates an authentication delegate based on the extracted value. The authentication delegate is sent from the first computing device to a third computing device for verification to allow the first computing device access to the third computing device.

Tamper-resistant and scalable mutual authentication for machine-to-machine devices

A first circuit representation of a given function is obtained at a first processing device. The given function comprises at least two computer programming switch statement clauses. A second circuit representation is generated at the first processing device from the first circuit representation wherein the at least two computer programming switch statement clauses are respectively represented by at least two tree circuits that are embedded in the second circuit representation such that the second circuit representation is characterized by a given cost (e.g., a minimum cost). The second circuit representation is encrypted at the first processing device, and sent to a second processing device for secure evaluation of the given function by the second processing device.

Secure function evaluation of tree circuits

Secure private database querying on a database for a query having a formula evaluation on at least two keywords A and B comprises: a server receiving a Bloom filter tree comprised of encrypted Bloom filters of encrypted keywords from the database, wherein each Bloom filter in the Bloom filter tree is separately masked by a random mask pad P; receiving an encrypted version of the keywords A and B from the client; and obtaining masked Bloom filter indices for the keywords A and B. The client and server participate in secure function evaluation (SFE) with the client. The server has an input comprising the masked Bloom filter indices for the keywords A and B and the client has an input comprising the random mask pad P. The secure function evaluation comprises: removing the random mask pad P from the masked Bloom filter indices input by the server; determining if there is a matching Bloom filter for each of the keywords A and B; and applying the formula evaluation to determine if the formula is satisfied.

Secure private database querying system with content hiding bloom filters

A message and an identifying parameter associated with the message are obtained. The message comprises a plurality of units. A plurality of one-unit message authentication codes is generated, wherein each one-unit message authentication code corresponds to a respective unit of the plurality of units of the message, and wherein each one-unit message authentication code is generated based on the identifying parameter associated with the message, a given one of the plurality of units, and the position of the given unit in the message. Verification of each unit of the message may then be efficiently performed inside a method of secure computation such as, by way of example only, a garbled circuit.

Protecting against malicious modification in cryptographic operations

Method of producing an aggregated message authentication code (MAC). The method comprises generating or receiving, in a computer processor, a first message and its first MAC tag (m, t) and computing, in the computer processor, a first hashed message-tag pair H(m, t), where H is a cryptographic hash function. The method comprises generating or receiving, in the computer processor, a second message and its second MAC tag (m, t) and computing, in the computer processor, a second hashed message-tag pair H(m, t). The method comprises computing, in the computer processor, an aggregated MAC (At) by an addition operation, as follows: At=(H(m, t)+H(m, t)) modulo N, where N is a natural number equal to two or greater.

Robust MAC aggregation with short MAC tags

A garbled circuit is generated for a client in a leakage-resilient manner with a reduced memory requirement. The garbled circuit is used for secure function evaluation between the client and a server. The garbled circuit is generated with a reduced storage requirement by obtaining a token from the server; querying the token gate-by-gate, wherein for each gate of the garbled circuit, the token generates new wire garblings and stores them with the client using a Stream Cipher and interacts with the leakage-protected area to generate a garbled table for the gate; and receiving the garbled circuit from the token. The token comprises a leakage-protected area. The Stream Cipher is leakage-resilient and can be a symmetric-key cryptographic primitive that has a secret key as an input and generates an unbounded stream of pseudorandom bits as an output. The number of evaluations of the Stream Cipher is kept to a substantial minimum. For example, the Stream Cipher can execute with a same key only twice, such as only once for an encryption and only once for a decryption.

Leakage resilient garbled circuit generation using reduced memory hardware token

A capability for secure communication of data from a source device to a destination device is presented. The source device has a device identifier associated therewith. The source device stores an encrypted version of the device identifier that is encrypted based on a master key of the destination device. The source device stores an encryption key. The source device communicates data to the destination device in a secure manner by encrypting the data using the encryption key and propagating the encrypted version of the device identifier and the encrypted data to the destination device. The destination device recovers the data sent by the source device by decrypting the encrypted version of the device identifier based on the master key to determine the device identifier, determining a decryption key based on the device identifier, and decrypting the encrypted data based on the decryption key to recover the data sent by the source device.

Secure communication of data between devices

Techniques are provided for anonymizing streamed data. In various embodiments, data are anonymized by receiving a data element of a data stream including a plurality of said data elements (p, s), where pcomprises an identifying portion and scomprises an associated sensitive information portion; obtaining a partitioned space S including t regions; assigning the identifying portion, p, to a selected region; encrypting the associated sensitive information sas e(s); and storing the encrypted associated sensitive information e(s) in a list associated with the selected region but not storing the associated identifying portion, p, in the list. The regions have corresponding center points, and a nearest center to pis optionally determined. The encrypted associated sensitive information e(s) may be stored in a list associated with the nearest center.

Anonymization of streaming data

A MAC aggregation technique utilizing a large field addition operation is disclosed. The large field addition operation defines the addition of two or more MACs mod p, where the two or MACs may comprise constituent MACs or aggregate MACs, and where p is a prime number that is large relative to the size of the MACs. The disclosed MAC aggregation technique yields an aggregate MAC much shorter than the concatenation of constituent MACs while achieving security even in the case where constituent MACs may be aggregated in duplicate.

MAC aggregation with message multiplicity for use in a multi-node data network

Server-assisted secure function evaluation (SFE) is performed with input consistency verification for two parties that want to evaluate a function. The server computes a garbled circuit corresponding to the function. A predefined bit of the 0-secret of wire i in the garbled circuit is set to a random bit band a predefined bit of the 1-secret of wire i in the garbled circuit is set tob. The server communicates with each party using an Oblivious Transfer (OT) to provide encrypted versions of the respective inputs of each party. Each party receives the encrypted wire secret of the other party and the garbled circuit for computation of a respective output and stores the predefined bit of a wire of interest of the other party. A given party can verify input consistency by the other party over at least two executions by comparing the values stored by the given party for the at least two executions with corresponding values obtained from the server.

Input consistency verification for server assisted secure function evaluation

An efficient encryption system for improving the computation speed of a garbled circuit is set forth. The garbled circuit includes a number of garbled Boolean gates having first and second garbled Boolean gate input wires. The system includes a first key ki on a first garbled gate input wire. A second key kj is also provided on a second garbled gate input wire. A programmable function is provided for combining the first key ki and the second key kj to obtain an encrypted output key. A method for expediting encryption and decryption of a garbled circuit having a number of encryptions for a garbled table of a garbled gate is also set forth. The method includes the steps of: forming the garbled table with a number of secret keys by applying a function to the secret keys to produce less than twice the number of secret keys as the number of encryptions for the garbled table, and evaluating the garbled table to decrypt an output key of the garbled table.

Computation of garbled tables in garbled circuit

A system for providing cost effective, secure key exchange from at least one first device to at least one second device through at least one proxy server is provided. The system includes a first key exchange message from the at least one first device to the at least one second device via the at least one proxy server. A second key exchange message from the at least one second device to the at least one first device via a media stream of the Internet is required to complete the computation of the session key. A method of securing a communication system is also set forth. The method includes the steps of providing a routing device for identifying a subscriber, and providing a master key exchange session, the master key exchange session including a key k to find a subscriber and a nonce r to answer a query to the subscriber, wherein the master key exchange session includes both the key k and the nonce r.

Efficient key management system and method

To address the security requirements for cyber-physical systems, embodiments of the present invention include a resilient end-to-end message protection framework, termed Resilient End-to End Message Protection or REMP, exploiting the notion of the long-term key that is given on per node basis. This long term key is assigned during the node authentication phase and is subsequently used to derive encryption keys from a random number per-message sent. Compared with conventional schemes, REMP improves privacy, message authentication, and key exposure, and without compromising scalability and end-to-end security. The tradeoff is a slight increase in computation time for message decryption and message authentication.

Method and apparatus for resilient end-to-end message protection for large-scale cyber-physical system communications

Methods and apparatus are provided for secure function evaluation for a covert client and a semi-honest server using string selection oblivious transfer. An information-theoretic version of a garbled circuit C is sliced into a sequence of shallow circuits C, . . . C, that are evaluated. Consider any wire wof C that is an output wire of C, and is an input wire of C. When a slice Cis evaluated, C's 1-bit wire key for wis computed by the evaluator, and then used, via string selection oblivious transfer (SOT), to obtain the wire key for the corresponding input wire of C. This process repeats until C's output wire keys are computed by the evaluator. The 1-bit wire keys of the output wires of the slice are randomly assigned to wire values.

Secure function evaluation for a covert client and a semi-honest server using string selection oblivious transfer

Methods and apparatus are provided for secure function evaluation between a semi-honest client and a semi-honest server using an information-theoretic version of garbled circuits (GC). An information-theoretic version of a garbled circuit C is sliced into a sequence of shallow circuits C, . . . C, that are evaluated. Consider any wire wof C that is an output wire of C, and is an input wire of C. When a slice Cis evaluated, C's 1-bit wire key for wis computed by the evaluator, and then used, via oblivious transfer (OT), to obtain the wire key for the corresponding input wire of C. This process repeats until C's output wire keys are computed by the evaluator. The 1-bit wire keys of the output wires of the slice are randomly assigned to wire values.

Growing community of inventors

Jersey City, NJ, United States of America

Vladimir Y Kolesnikov