The Johns Hopkins University

United Parcel Service of America, Inc.

David R Zaret

Russell Andrew Fink

Douglas Charles Schmidt

C Durward McDonell, Iii

Margaret F Lospinuso

Laura J Glendenning

David J Heine

Gary L Jackson, Ii

Hongsheng Zhong

Paul McNamee

Robert M Seng

Ryan W Gardner

Kiel R Gordon

Vivian Maloney

Prathibha S Rama

Charles C Schneider

Deanna T Hlavacek

Forest C Deal, Jr

Vina H Nguyen

Rachel B Stonehirsch

Samantha M Tyson

Yanni A Kouskoulas

A term-based encrypted retrieval privacy (TERP) data retrieval system performs data retrieval from a data repository server. The system includes a client processor included with a data requesting client and a server processor included with the data repository server. The client processor determines a vector forest that is shared with the data repository server, which includes forest vectors assigned with a respective vector ID, and generates a query including an encrypted ciphertext table that cross-references the vector IDs with a corresponding ciphertext entry. The server processor receives the query, and selects a given document from the data repository server that has assigned thereto at least one nearest neighbor vector among the forest vectors. The server processor compares a nearest neighbor vector ID of the nearest neighbor vector to the vector IDs included in the encrypted ciphertext table, and generates an encoded search result based on the encrypted ciphertext entries. The client processor decrypts the encoded search result to obtain results of the query.

Term-based encrypted retrieval privacy

Disclosed herein are system, method, and computer program product embodiments for performing a set of operations on one or more encrypted numbers to be an approximation of performing an algebraic operation on the one or more encrypted number. A server can receive from a client, a public key of a fully homomorphic encryption scheme and one or more encrypted numbers, and perform a set of operations comprising a square root function, a rectified linear activation function (ReLU), or a multiplicative inverse function on the one or more encrypted numbers to generate an encrypted operational result. The encrypted operational result generated by the set of operations can be an approximation of performing an algebraic operation on the one or more encrypted number. The server can further transmit to the client the encrypted operational result.

Approximate algebraic operations for homomorphic encryption

Apparatuses and methods for private information retrieval are provided. One example method may include receiving a query state machine that is an encoding of a search pattern. The query state machine may include a plurality of states and a transition function that defines a plurality of transitions based on the search pattern. The example method may also include performing a private query against a target query string of a target query record by applying the query state machine to the target query string to develop a private encoding. The method may further include transmitting query results based on the private encoding.

Apparatus and method for private information retrieval

A method executable via operation of configured processing circuitry to identify vulnerabilities in program code may include receiving a program and employing a disassembler to disassemble the program, generating a function call tree for the program based on disassembly of the program, receiving an indication of a post condition for which analysis of the program is desired, transforming program statements into logical equations, simplifying the logical equations, propagating post conditions backwards via Dijkstra's weakest precondition variant, analyzing aliases and processing loops to generate a precondition, and using an automated solver to determine whether the precondition is realizable and, if so, providing program inputs required to realize the precondition.

Method and apparatus for automated vulnerability detection

Route planning methods for use by a package delivery service provider are disclosed that satisfy a stochastic daily demand while taking advantage of drivers' route familiarity over time. A model for estimating the value of driver familiarity is disclosed along with both an empirical and a mathematical model for estimating the value of route consistency, along with a Core Area Route Design which involves the concepts of combinational optimization, meta-heuristic algorithms, tabu search heuristics, network formulation modeling, and multi-stage graph modeling. In one embodiment, a service territory is divided into unassigned cells associated with a grid segment involving prior driver delivery stops, and a driver from a pool of unassigned drivers is assigned to a route based on examining each driver's grid segment visiting frequency limit with respect to a minimum limit so as to optimize driver selection based on of each driver's familiarity with the route.

Core area territory planning for optimizing driver familiarity and route flexibility

Growing community of inventors

Columbia, MD, United States of America

David R Zaret