Methods and system for embedding digital watermark information into textual data arranged in a table of cells are provided. A first subset of cells are selected and for each primary cell key and cell partition number are determined. A portion of a digital watermark ID code is embedded at an embedding position determined based on the partition number. Methods and systems for extracting digital watermark information from the textual data are also provided. A cell is fetched from the table and the presence of portion of the digital watermark ID code is determined. A primary cell key and cell partition number are determined. A portion of the digital watermark ID code is extracted at the embedding position within the cell, the embedding position determined based on the cell partition number. The digital watermarking systems and methods provide tracking for unauthorized copying of the data while modifying only a subset of the data.

A computer-implemented method comprises: committing a transaction amount of a transaction with a commitment scheme to obtain a transaction commitment value, the commitment scheme comprising at least a transaction blinding factor; generating a first key of a symmetric key pair; encrypting a combination of the transaction blinding factor and the transaction amount t with the first key; and transmitting the transaction commitment value T and the encrypted combination to a recipient node associated with a recipient of the transaction for the recipient node to verify the transaction. The first key is a symmetrical key generated with Diffie-Hellman (DH) key exchange protocol that can be used to encrypt/decrypt the random numbers and the plaintext balances, thus providing convenient management. The method provides a robust privacy protection for transaction amounts, asset values, and blinding factors in commitment schemes.

A method is provided for a device participating in a data aggregation service. The device receives, from at least one requesting server, a participant homomorphic encryption key, and a request for data to perform a computation. The device encrypts requested data, including a location identifier, with the participant homomorphic encryption key, and sends, to an aggregation service, the encrypted requested data.

Aspects of the present disclosure involve a method and a system to support execution of the method to perform a cryptographic operation involving a first vector and a second vector, by projectively scaling the first vector, performing a first operation involving the scaled first vector and the second vector to obtain a third vector, generating a random number, storing the third vector in a first location, responsive to the random number having a first value, or in a second location, responsive to the random number having a second value, and performing a second operation involving a first input and a second input, wherein, based on the random number having the first value or the second value, the first input is the third vector stored in the first location or the second location and the second input is a fourth vector stored in the second location or the first location.

A non-transitory computer-readable storage medium storing a program that causes a processor included in a business operator's terminal to execute a process, the process includes conversion processing and confirmation request processing. The conversion processing that converts user information acquired from an user into a management format and obtains converted user information. The confirmation request processing that calculates a first hash value obtained by hashing the converted user information with a first hash function, transmits a confirmation request including the first hash value, the first hash function, and conversion content of the conversion to the user, and requests the user to confirm validity of the user information managed.

A pairing apparatus according to an exemplary embodiment of the present invention includes: a noise filtering part for filtering a noise on a power line; and a processor for pairing with a pairing target device and performing an authentication by generating a secret key using the filtered noise and by using the generated secret key.

In a post-quantum asymmetric key generation method and system, a processing unit generates, based on a prime and an arithmetic function or a classical string, a prime vector which has an infinite number of components; generates a prime array based on the prime vector; generates an associated matrix based on the prime array; obtains, based on the associated matrix and a first reference prime, a first reference inverse prime array that serves as a private key; and obtains a public key that is paired with the private key based on a second reference inverse prime array. The second reference inverse prime array is obtained based on the associated matrix, the first reference prime, a second reference prime, and a randomization array.

Systems and methods may be used for providing more secure authentication attempts by implementing authentication systems with credentials that include interspersed noise symbols in positions selected, for example by a user. These systems and methods secure against eavesdroppers such as shoulder-surfers or man-in-the middle attacks as it is difficult for an eavesdropper to separate the noise symbols from legitimate credential symbols. Some systems and methods may use a subset of a credential with the interspersed noise symbols.

The present disclosure involves systems, software, and computer implemented methods for a efficient distributed secret shuffle protocol for encrypted database entries using dependent shufflers. Each of multiple clients provides an encrypted client-specific secret input value. A subset of clients are shuffling clients who participate with a service provider in a secret shuffling of the encrypted client-specific secret input values. The protocol includes generation and exchange of random numbers, random permutations and different blinding values. A last protocol step includes using homomorphism, for each client, to perform computations on intermediate encrypted data to homomorphically remove a first blinding value and a second blinding value, to generate a client-specific rerandomized encrypted secret input value. As a result, the client-specific rerandomized encrypted secret input values are generated in an order that is unmapped to an order of receipt, at the service provider, of the encrypted secret input values.

The present invention relates to a method to securely load set of sensitive data hardware registers with sensitive data on a chip supporting hardware cryptography operations, said method comprising the following steps monitored by software instructions, at each run of a software: select a set of available hardware registers listed in a predefined list listing, in the chip architecture, the unused hardware registers and other relevant hardware registers not handling sensitive data and not disrupting chip functionality when loaded, establish an indexible register list of the address of the sensitive data hardware registers and of the hardware registers in the set of available hardware registers, in a loop, write each hardware register in this register list with random data, a random number of times, in random order except the last writing in each of the sensitive data hardware registers where a part of the sensitive data is written.