Telcordia Technologies, Inc.

Tti Inventions C LLC

Vencore Labs, Inc.

Tt Government Solutions, Inc.

Giovanni Di Crescenzo

Tao Zhang

Stanley Pietrowicz

Faramak Vakil

Robert G White

Eric Van Den Berg

Hyong Shim

Rafail Ostrovsky

Richard J Lipton

Vijay K Varma

Raquel Morera Sempere

Richard Ferrer

Sheldon Walfish

Andrew Burnette

Sivaramakris Rajagopalan

Hyong Sop Shim

The inventive system for providing strong security for UDP communications in networks comprises a server, a client, and a secure communication protocol wherein authentication of client and server, either unilaterally or mutually, is performed using identity based encryption, the secure communication protocol preserves privacy of the client, achieves significant bandwidth savings, and eliminates overheads associated with certificate management. VDTLS also enables session mobility across multiple IP domains through its session resumption capability.

Method and system for secure session establishment using identity-based encryption (VDTLS)

A server receives from a client at least one interest pseudonym produced by a double application of a pseudo random function to at least one interest of the client. The server encrypts an item. The server computes at least one intermediate topic pseudonym for at least one topic associated with the item by applying the function to each of the at least one topic associated with the item. The server transmits the at least one intermediate topic pseudonym, the at least one interest pseudonym, and the encrypted item to a third party. The third party may apply the function to the at least one intermediate topic pseudonym to produce at least one topic pseudonym associated with the item and transmit the encrypted item to the client for decryption when one of the at least one masked topic pseudonym is equal to one of the at least one interest pseudonym of the client.

Privacy-preserving publish-subscribe protocol in a cloud-assisted model

A method and system for providing privacy in a publish-subscribe protocol is provided. A server receives from a third party a topic-based key associated with a tree structure having a pseudonym of a topic as a root and at least one client as a leaf. The server encrypts a key associated with a conditional oblivious transfer protocol using the topic-based key. The server encrypts an item with the key associated with the conditional oblivious transfer protocol. The server transmits the encrypted key and the encrypted item to a plurality of clients. The encrypted item is decryptable by the at least one client with the key associated with the conditional oblivious transfer protocol when the key associated with the conditional oblivious transfer protocol is decryptable with an interest-based key associated with a tree structure having a pseudonym of an interest as a root and the at least one client as a leaf.

Privacy-preserving publish-subscribe protocol in a cloud-assisted broadcast model

An inventive scheme for detecting parties responsible for repeated malicious activities in secure and anonymous communication is presented. The scheme comprises generating a pool of keys, distributing to and associating with each party a small number of keys chosen randomly from the pool, revoking a key when it is detected as used in a malicious activity, creating a set of parties associated with the revoked key, revoking additional keys randomly chosen among the keys not currently revoked, selecting new keys, and when a party requests an updated key, sending the updated key selected from among the new keys to the requesting party, wherein if an other malicious activity is detected, creating another set of the parties associated with the other malicious activity and identifying the parties in both sets. The steps of the inventive scheme are repeated until only one party is in the intersection set.

Method for a public-key infrastructure providing communication integrity and anonymity while detecting malicious communication

A Secure Virtual Point of Service (SVPOS) that coordinates the authentication, authorization, and identity, settlement, arbitration and non-repudiation for an electronic commercial transaction. For each commercial transaction, both the buyer and merchant authenticate itself to the SVPOS and create two unique transaction encryption keys, one for the buyer and one for the merchant. The merchant uses both encryption keys to encrypt a package that include at least product identification. The merchant and buyer calculate a hash of the package and transmit the calculated hash to the SVPOS for comparison to prevent repudiation. If the calculated hash is identical the buyer receives the merchants encryption key and decrypts the package. Payment is released by the SVPOS if the buyer is satisfied with the package via a Parlay system. If the buyer is not satisfied, said SVPOS performs arbitration between the buyer and merchant to determine if the package is correct.

Method and apparatus to conduct a commercial transaction over wireless networks

A method and system for public key infrastructure key and certificate management provides anonymity to certificate holders and protects the privacy of certificate holders from the compromise of a certificate authority. Functional separation is provided in the authorization of a certificate request and the assignment of certificates and key pairs. The authorizing certificate authority approves or denies each certificate request from a requestor whose identity is not made available to the assigning certificate authority. The assigning certificate authority, upon approval from the authorizing certificate authority, issues one or more certificates and optionally generates and provides the associated key pairs to the requester without disclosing these certificates and key pairs to the authorizing certificate authority. In another aspect, a distributed method is disclosed that allows individual nodes and/or units in a network to select certificates for broadcasting messages to a community of interest with a non-unique key.

Method and system to authorize and assign digital certificates without loss of privacy, and/or to enhance privacy key selection

Methods for using integrity checking techniques to identify and locate computer viruses are provided. A method for virus localization for each of three types of virus infections is provided, including the steps of computing a sequence of file blocks, calculating hashes for the sequences of file blocks from a host file and calculating hashes for the same or related sequences of file blocks from an infected file, and comparing the hashes from host file to the hashes from the infected file from the same or related sequences of file blocks such that when some of said first hashes and said second hashes do not match, a location of a virus is output. Methods for computing the sequence of file blocks depending on the type of virus infection, and for calculating the hashes using a collision resistant hash function, a digital signature scheme, a message authentication code, or a pseudo-random function.

Virus localization using cryptographic hashing

Efficient secure password protocols are constructed that remain secure against offline dictionary attacks even when a large, but bounded, part of the storage of a server responsible for password verification is retrieved by an adversary through a remote or local connection. A registration algorithm and a verification algorithm accomplish the goal of defeating a dictionary attack. A password protocol where a server, on input of a login and a password, carefully selects several locations from the password files, properly combines their content according to some special function, and stores the result of this function as a tag that can be associated with this password and used in a verification phase to verify access by users. Two main instantiations of our method are given; in one, a combination of mathematical tools, called dispersers and pairwise-independent hash functions is used to achieve security against adaptive intrusions (dispersers make sure that the password of each user depends on randomly chosen locations in a large password file, and pairwise-independent hash functions help in making this dependency sufficiently random); in a second one, a combination of mathematical tools, called k-wise independent hash functions and locally-computable and strong extractors (k-wise independent hash functions make sure that the locations chosen in the large password file from each password are sufficiently random, and locally-computable and strong extractors are used to combine the contents of these locations to generate a single long random value, which makes verification harder for the adversary to foil).

Method and system for password protocols in the bounded retrieval mode with security dictionary attacks and intrusions

A system and method is provided for authenticating a first device to a second device. This involves providing images to the second device, receiving an indication of selected ones of the images as authenticating images, and identifying an authenticating code associated with the second device. This also involves receiving a transaction request from the second device, the first device providing a display page to the second device, the display page including the authenticating images at locations identified by the authenticating code.

Systems and methods for authenticating a server by combining image recognition with codes

The present invention advantageously provides techniques to solve problems with combinatorial anonymous certificate management by addressing critical issues concerning its feasibility, scalability, and performance. Methods and procedures to manage IEEE 1609.2 anonymous and identifying cryptographic keys and certificates in the Vehicle Infrastructure Integration (VII) system are presented, along with methods for management of identifying and anonymous certificates in a partitioned Certificate Authority architecture designed to enhance vehicle privacy. Novel methods for vehicles to dynamically change an anonymous certificate for use while maintaining vehicle privacy are given. Refinements to basic combinatorial schemes are presented including probabilistic key replacement, rekey counter decrement, dynamic rekey threshold, geographic attack isolation and proofs of geographic position.

Vehicle segment certificate management using shared certificate schemes

Methods for using integrity checking techniques to identify and locate computer viruses are provided. A method for virus localization for each of three types of virus infections is provided, including the steps of computing a sequence of file blocks, calculating hashes for the sequences of file blocks from a host file and calculating hashes for the same or related sequences of file blocks from an infected file, and comparing the hashes from host file to the hashes from the infected file from the same or related sequences of file blocks such that when some of said first hashes and said second hashes do not match, a location of a virus is output. Methods are provided for computing the sequence of file blocks depending on the type of virus infection, and for calculating the hashes using a collision resistant hash function, a digital signature scheme, a message authentication code, or a pseudo-random function.

The present invention advantageously provides a system and method for management of cryptographic keys and certificates for a plurality of vehicles. Each vehicle of the plurality of vehicles generates public/private key pairs, requests multiple time-distributed certificates, creates an encrypted identity, and surrenders expired certificates. An assigning authority receives the public/private key pairs, the request for multiple time-distributed certificates, the encrypted identity, and the expired certificates from said vehicle. The assigning authority authorizes the vehicle with an authorizing authority, validates the expired certificates, proves ownership, and distributes the requested time-distributed certificates to said vehicle. Validation can comprise checking expired certificates against misused, compromised and/or previously surrendered certificates. Time-distributed certificates can have lifetimes adjustable based on certificate misuse detection system algorithms, amount of malicious activity detected, and/or certificate authority capacity.

Vehicle segment certificate management using short-lived, unlinked certificate schemes

A method and system are provided for timed-release cryptography. A sender encrypts data in a timed-release fashion such that a receiver based on information exchanged with a server decrypts the encrypted data at or after a release time without revealing to the server any information about the sender, the data, and the release time. In one embodiment, the sender encrypts a key and a release time based on a public key of the receiver and encrypts the data based on the encrypted key. The server determines a condition, which is a function of the encrypted key, the encrypted release time, and a current time. The server then sends the condition to the receiver using a conditional oblivious transfer method. If the current time as determined by the server is greater than or equal to the release time, the receiver determines the encrypted key based on the condition. The receiver then uses the encrypted key to decrypt the encrypted data. However, if the current time is less than the release time, the receiver fails to determine the encrypted key based on the condition, and thus, fails to decrypt the encrypted data.

Growing community of inventors

Madison, NJ, United States of America

Giovanni Di Crescenzo