There is provided a method of generating a ciphertext. The method includes encrypting an input data to produce an encrypted data, and randomizing the encrypted data to produce the ciphertext. In particular, the randomizing process includes performing an exclusive-or (xor) operation on the encrypted data with a cipher pad, whereby the cipher pad is generated based on an xor-homomorphic function of a first key using a second key generated based on the encrypted data. There is also provided a corresponding system for generating a ciphertext, a corresponding method and system for decrypting a ciphertext, and a corresponding method and system for searching ciphertexts in a database, such as at an untrusted server.

Systems and methods for maintaining encryption keys are disclosed. An encrypted master key is determined by encrypting a master key based on an initial user password and discarding the master key. The encrypted master key is stored. A request for the master key including a present user password is received and verified based on comparison to the initial user password. Based on failure of verifying the present user password, a failed attempt counter that is maintained within a secure container is created. User password based access to the master key is locked out based on the failed attempt counter exceeding a defined value.

A control circuit causes a first cryptographic module to perform a dummy operation in a command processing period and a data processing period in which a second cryptographic module performs a normal operation while the first cryptographic module does not perform a normal operation.

Embodiments of the present disclosure relate to copy protection. A request to copy a file from a requestor with one or more privileges sufficient to access the file may be received. The file may be determined to be subject to copy protection. In response to determining that the file is subject to copy protection, a notification of the copy attempt may be transmitted. Copy protection may then be applied to the file.

A method for generating secure alternative representation for a numerical datum, being performed in a processing system comprising a processing unit coupled to a storage unit, is provide. The method comprises: receiving the numerical datum; providing a plurality of semi-finished conditions; associating each of the semi-finished conditions with one or more secret parameters to form a plurality of secret conditions; for each of the secret conditions: determining whether the numerical datum satisfies the secret condition; outputting a first character as a result element if the numerical datum satisfies the secret condition; and outputting a second character as the result element if the numerical datum does not satisfy the secret condition; and concatenating each result element being output corresponding to the secret conditions as an alternative representation for the numerical datum.

A system for computer data security via entropy and disinformation-based information dispersal. The system embodies deconstructing a data object into a superset of randomly sized shards and then, on a per shard basis, randomly choosing an encryption algorithm, randomly generating an encryption key, and initialization vector where appropriate, applying the randomly chosen encryption algorithm, generating an unique identifier to use for shard storage, placing at random offsets data distortion via randomly generated disinformation, and retrievably storing a superset of shards meta-data in a structured format.

The method comprising: a) receiving, by an encoding module computer device (103), from a user (100), a message (101) including a content to be encoded; b) generating, by the encoding module (103), a generated encoding (104) of the content of the provided message (101) using encoding information (112); c) sending, by the encoding module computer device (103), the generated encoding (104) to a reception module computer device (106) and verifying, by the reception module computer device (106), that the generated encoding (104) corresponds to the encoding of the content of the message (101) by using a generated verification information (105) and public information (107), wherein the at least one code (102) having a cryptographic relationship with the public information (107) and the message (101), and the public information (107) and the message (101) having a cryptographic or a public relationship.

Systems, devices, and methods are provided for generating and transmitting a stream of random numbers such that the transmitted stream of random numbers is based at least in part on two or more streams of received random numbers. A randomness beacon can include a processor, a transmitter, and a memory with instructions thereon to cause the beacon to receive the two or more streams of received random numbers, generate a new stream of random numbers based at least in part on the received streams, and transmit the new stream via the transmitter to a public network. A system can include the randomness beacon and two or more random number generators that are generating the two or more random number streams received by the beacon.

Some embodiments are directed to a dealer device for batch-wise provisioning of preprocessing information for a multiparty computation and an evaluator device for batch-wise distributed verification with one or more other evaluator devices of the preprocessing information. The preprocessing information comprises multiple random values and multiple message authentication codes for blinding and integrity checking respectively in the multi-party computation. The multiple random values and a set of proof values together define a checking polynomial. The dealer device computes proof values wherein the checking polynomial is identical to zero. The evaluator device obtains secret-shares of the random values, proof values, and message authentication codes. The evaluator device checks by a distributed computation with the one or more other evaluator devices that an evaluation of the checking polynomial in a random evaluation point is zero, thus verifying that multiple polynomial checking equations are satisfied on the multiple random values.

Described is a system for selective transparency in a public ledger. In operation, a first submission by a first entity is logged to the public ledger. The submission is a data entry with a message M and an identification number (ID). Separately, a linkage by a second entity is recorded. The linkage is an encryption and commitment linking the submission by the first entity to a second submission by the second entity. The linkage can be verified through a series of processes, such as by determining a value of linkage verification information. The value of the linkage verification information and corresponding block number is then transmitted to a third entity. The third entity reads the commitments from block N.sub.i and verifies that the commitments are commitments to the same ID using the linkage verification information.