Ironcore Labs, Inc.

Oracle International Corporation

Advanced Hardware Architectures, Inc.

Bydatel Corporation

Robert Lyle Wall

Patrick Joseph Walsh

Paul W Bolton

Phillip Louis Amicucci

David Harris

Mitchell William Koury

Charles Glen Swenson

William J Moody

Kel D Winters

Cherice Jobmann

Jennifer Pinczes

Colt Frederickson

Bruce D Scoles

Jay W Bernasek

Byron J Botts

Cheryl L White

Russell Tempero

John J Schneider, Jr

Gary A Stornelli

Search management systems and methods that cryptographically-secure search indices, search queries, and associated document records while in-use by cloud-based search software without requiring modification to the cloud-based search core software. The search proxy resides between a cloud-based vendor application and the cloud-based search software. The search proxy uses key-based deterministic cryptographic tokenization to irreversibly cryptographically-secure plaintext words from document records for indexing and plaintext keywords from search queries for search and retrieval. The search proxy separately uses key-based encryption on the document record's pre-tokenized plaintext words, adding the encrypted data as a separate field to the document record. This encrypted field is stored as part of the document by the search service. A search query retrieves the encrypted field and the other parts of the document record from the search software, and the search proxy decrypts the field to reproduce the original document record.

Secured search for ready-made search software

Disclosed is an orthogonal access control system based on cryptographic operations provided by multi-hop proxy re-encryption (PRE) that strictly enforces only authorized access to data by groups of users, scalable to large numbers of users. Scalable delegation of decryption authority can be shared with a plurality of members of a group whether those members be users or devices, and members of a group can further create sub groups and delegate decryption authority to those members, whether users or devices. Members are granted access via generation of transform keys, and membership or access can be revoked merely be deleting the transform key—no elimination of the encrypted data, regardless of its storage location, is needed.

Orthogonal access control for groups via multi-hop transform encryption

Disclosed is an orthogonal access control system based on cryptographic operations provided by multi-hop proxy re-encryption (PRE) that strictly enforces only authorized access to data by groups of users, scalable to large numbers of users. Scalable delegation of decryption authority can be shared with a plurality of members of a group whether those members be users or devices, and members of a group can further create sub groups and delegate decryption authority to those members, whether users or devices. Members are granted access via generation of transform keys, and membership or access can be revoked merely be deleting the transform key&#x2014;no elimination of the encrypted data, regardless of its storage location, is needed.

Techniques are disclosed for automatic data translation in computing systems. Certain techniques are disclosed herein that enable applications to utilize data in optimal formats specific to each application in an effectively transparent manner, removing the burden to perform data format or type checking, conversions, etc. An automatic data translation module (ADTM) is implemented that automatically translates data as it passes between certain applications. In some embodiments, the ADTM receives a first particular format of data from a first application and automatically/transparently converts the first particular format of data into another representation of the same data, but in a second format utilized by a recipient application. The ADTM may be configured as part of a database application programming interface (API), and can translate textual versions of IP addresses into binary representations for efficient database storage, and translate returned binary representations back into textual representations for convenience and enhanced trace functionalities.

Efficient storage using automatic data translation

A method and device implementing a downloadable operatively connected to a plurality of gaming machines either by a direct communications link or through the use of one or more site controllers or PCs. Each gaming machine and site controller or PC contains two executable spaces, one of which typically contains the software image currently being implemented by the device. The other executable space is designated to receive from the central system a new software image that will be utilized by the device. The central system transfers a new image to be executed, via packet encrypted communications, to a networked device which stores the image in an executable space, while continuing to run the currently designated image. Upon instruction from the central system, the device switches over to the new image, allowing one or more machines to implement a software upgrade on a continuous basis.

Method and device for implementing a downloadable software delivery system

A single clock cycle adaptive data compressor/decompressor with a string reversal mechanism is described which can perform data compression and decompression at the rate of one uncompressed symbol per clock cycle. The LZW data compression algorithm has been improved for use in this data compressor. The compressor builds a string table as the data is received. Each string within the table is made up of the address within the table of the longest previously seen matching string and the one character that makes this string different. This data compressor/decompressor utilizes a content addressable memory to store the string table. This content addressable memory allows the compressor to store the current symbol string in a table while that same string table is simultaneously searched for the current string. During decompression the characters within a symbol string are output in reverse of the order in which they were input. In order for the data to be restored to its original format the characters within a string must be reversed before they are output. Two dual-ported random-access memories are used as circular queues to perform this string reversal. These dual-ported random-access memories have the capability to output the characters within a string from the string reversal mechanism in the order that they were input. The first dual-ported random access memory is used to store the strings of symbols to be reversed and the second dual-ported random access memory is used to store the addresses of the first and last symbol of each string that is stored in the first dual-ported random-access memory.

Single clock cycle data compressor/decompressor with a string reversal

A method for transmitting data in packet switching networks provides a Collision-Eliminating Multiple Access protocol in which nodes desiring to transmit over the network channel transmit reservation requests during a plurality of contention slots, the number of contention slots being dynamically controlled according to network load. A node designated to next obtain control of the channel receives the identifiers of nodes transmitting reservation requests and, prior to transmitting application data, transmits network control data consisting of the identifiers of nodes from whom successful reservation requests were successfully received. The transmitted identifiers are received and stored by each node in an identical queue, whereby subsequent control of the channel is rotated based on the order of node identifiers appearing in an identical queue on each node. The transmitted network control data includes reservation requests received during a previous contention slot period, queue correction information, and the identifiers of nodes from which the controlling node expects to receive data.

Method for transmitting data in multiple access data communications

Growing community of inventors

Bozeman, MT, United States of America

Robert Lyle Wall