A method for providing encrypted information by an information entity to one or more operating entities, the information entity having a database for storing encrypted information and the one or more operating entities being configured to operate on the encrypted information, wherein the encrypted information is stored encrypted with an encryption key known to the one or more operating entities includes performing, by an operating entity, a request on the encrypted information, wherein plaintext information to be stored encrypted is provided in tuples, each having ID information, one or more fields with field information specifying the fields, and values, wherein at least the values are encrypted with non-deterministic order preserving encryption with at least one encryption key such that each plaintext value is encrypted into a set of encrypted values, and wherein the set of encrypted values is partitioned into a left set and a right set.

A method of operating a quantum key distribution (QKD) system including using a quantum random number generator (QRNG) to generate a random number string (RNS), and storing the RNS; providing the RNS to a first cryptographically secure pseudo-random number generator (CSPRNG) which uses random numbers of the RNS as seeds to generate respective first strings of pseudo-random numbers; using the first strings of pseudo-random numbers to encode photons or pulses transmitted by a transmitter of the QKD system; after a predetermined delay, providing the stored RNS to a second CSPRNG which uses random numbers of the RNS as seeds to generate respective second strings of pseudo-random numbers, the second CSPRNG identically configured to the first CSPRNG; using the second strings of pseudo-random numbers, together with information regarding encoded photons or pulses received by a receiver of the QKD system, to agree secure keys between the transmitter and the receiver.

Systems and methods for generating min-increment counting bloom filters to determine count and frequency of device identifiers and attributes in a networking environment are disclosed. The system can maintain a set of data records including device identifiers and attributes associated with device in a network. The system can generate a vector comprising coordinates corresponding to counter registers. The system can identify hash functions to update a counting bloom filter. The system can hash the data records to extract index values pointing to a set of counter registers. The system can increment the positions in the min-increment counting bloom filter corresponding to the minimum values of the counter registers. The system can obtain an aggregated public key comprising a public key. The system can encrypt the counter registers using the aggregated shared key to generate an encrypted vector. The system can transmit the encrypted vector to a networked worker computing device.

Embodiments are disclosed for a method. The method includes validating training data that is provided for training a machine learning model using ordinary differential equations. The method further includes generating pre-processed training data from the validated training data by generating encrypted training data from the validated training data using homomorphic encryption and generating random noise based on the validated training data. The method also includes training the machine learning model adversarially with the pre-processed training data.

Various embodiments relate to a data processing system comprising instructions embodied in a non-transitory computer readable medium, the instructions for an elliptic curve cryptography authentication method based on an elliptic curve in a processor, the instructions, comprising: generating, by a verifier, a random challenge r; multiplying, by the verifier, the random challenge r by a basepoint G to produce R; sending an x coordinate of R to a prover; receiving an x-coordinate of a first point P.sub.1 and a second point P.sub.2 from the prover, wherein P.sub.1 is based on a random share q.sub.1 of the private key q of the prover and R, and wherein P.sub.2 is based on a random share q.sub.2 of the private key q and R; where q=q.sub.1?q.sub.2; finding a point P.sub.1 on the elliptic curve having an x-coordinate of the first point P.sub.1; finding a point P.sub.2 on the elliptic curve having an x-coordinate of the second point P.sub.2; and authenticating the prover when an x-coordinate of one of (P.sub.1+P.sub.2) and (P.sub.1?P.sub.2) matches an x-coordinate of r.Math.Q, wherein Q is a public key of the prover.

The present invention provides an improved system and method for using cryptography to secure computer-implemented choice mechanisms. In several preferred embodiments, a process is provided for securing participants' submissions while simultaneously providing the capability of validating their submissions. This is referred to as a random permutation. In several other preferred embodiments, a process is provided for securing participants' advance instructions while simultaneously providing the capability of validating their advance instructions. This is referred to as a secure advance instruction. Applications include voting mechanisms, school choice mechanisms, and auction mechanisms.

A computer processing system that includes an elliptic curve computational unit in a computer processing device operably configured to perform an elliptic curve arithmetic operation with a sequence of field operations, receive an elliptic curve numerical input that includes at least one elliptic curve coefficient of an elliptic curve that is operably utilized in the elliptic curve arithmetic operation, receive an elliptic curve coefficient randomization numerical input that is operably configured for use in the elliptic curve arithmetic operation, compute a new and substantially equivalent elliptic curve representation for the elliptic curve coefficient of the elliptic curve by performing a field operation with the elliptic curve numerical input and the elliptic curve coefficient randomization numerical input, and utilize the new and substantially equivalent elliptic curve representation in the sequence of field operations, and having an arithmetic output port operably configured to output a numerical result therefrom.

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.