# US 2014/0153718 A1 · Trusted Communications Between Untrusting Parties

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2014/0153718 A1
- Document ID: US20140153718A1
- Status: Published application
- Kind: A1
- Application number: 14/172,232
- Filed: 2014-02-04
- Published: 2014-06-05
- Earliest claimed: 1999-07-16
- Assignees: Dennis Dupray
- Inventors: Dennis J. Dupray; Sheldon F. Goldberg
- Web page: https://patentgrep.com/patent/US20140153718A1

## CPC

- H04L 63/0428: {wherein the data content is protected, e.g. by encrypting or encapsulating the payload}
- G06F 21/6272: {by registering files or documents with a third party}
- G06Q 30/08: Auctions
- H04L 9/0833: {involving conference or group key (network architectures or network communication protocols for key management in group communication in a packet data network H04L63/065)}
- H04L 63/045: {wherein the sending and receiving network entities apply hybrid encryption, i.e. combination of symmetric and asymmetric encryption (cryptographic mechanisms or cryptographic arrangements using a plurality of keys or algorithms H04L9/14)}
- H04L 63/061: {for key exchange, e.g. in peer-to-peer networks (cryptographic mechanisms or cryptographic arrangements for key agreement H04L9/0838)}
- H04L 63/062: {for key distribution, e.g. centrally by trusted party (cryptographic mechanisms or cryptographic arrangements for key distribution involving a central third party H04L9/0819)}
- G06F 2221/2107: File encryption
- G06F 2221/2109: Game systems
- H04L 2209/56: Financial cryptography, e.g. electronic payment or e-cash
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

A system and method is disclosed for assuring that networked communications between parties playing a game on a network (e.g., the Internet) are not tampered with by either of the parties for illicitly gaining an advantage over the other party. An initial sequence of tokens (e.g., card representations) for playing the game are doubly encrypted using an encryption key from each of the parties. Accordingly, during play of the game neither party can modify the initial sequence of game tokens during the game. At termination of the game, at least one of the parties can fully decrypt the initial sequence of tokens, and thereby, if desired, compare the played token sequence with the corresponding the initial token sequence.

## Claims

### Claim at position 1

1-17. (canceled)

### Claim 18

A method for verifying network communications between first and second parties participating in an activity, comprising performing the following steps by computational equipment:
providing to the first party, a first version of data, wherein the data identifies values for use in accordance with one or more predetermined constraints related to performing the activity via communications on the network;
transmitting, during an activation of the activity and via the communications network, one or more portions of a second version of the data to the second party from a transmitting party being one of the first party and a third party prior to a termination of the activity, wherein the first and second versions are each encrypted;
wherein at least one of the first and second parties receives a network transmission of, a respective first decoding information and second decoding information for obtaining a respective decoded form of the respective one of the first and second versions, wherein a content of the decoded form of the respective at least one of the first and second versions provides the respective one of the first and second parties with information for identifying whether the data was changed during a processing of the activity by the computational equipment;
wherein the first decoding information for the first version is not used to decode the second version, and the second decoding information for the second version: (i) is not used to decode the first version, and (ii) cannot entirely decode the second version for obtaining the data without additional decoding information not available to the transmitting party.

### Claim 19 (depends on 18)

The method as claimed in claim 18, wherein the activity allows participants to enter the activity and obtain an entry identification, and wherein said activity associates one or more entry identifications with an outcome from the activity.

### Claim 20 (depends on 18)

The method as claimed in claim 18, wherein the first and second versions include information encrypted using a key from a public/private encryption key pair.

### Claim 21 (depends on 18)

The method as claimed in claim 18, wherein the first and second versions include information encrypted using a secret key.

### Claim 22 (depends on 18)

The method as claimed in claim 18, further including a step of transmitting said first version of data from the second party to the first party via the communications network.

### Claim 23 (depends on 18)

The method as claimed in claim 18, further including transmitting to the second party a decryption key for decoding the second version.

### Claim 24 (depends on 18)

The method as claimed in claim 18, further including a step of providing at least one of the first and second parties with information for comparing said data with a decoded copy of one of said first and second versions.

### Claim 25 (depends on 18)

The method of claim 18, wherein one of said first and second versions are each encrypted using one of an Rivest-Shamir-Adelman (RSA) encryption technique, a Data Encryption Standard (DES) encryption technique, and a hashing technique.

### Claim 26 (depends on 18)

The method of claim 18, wherein a decoder for decoding one of said first and second versions is obtained from a node of the network.