H04L2209/04

Magnetic Sensor Array Device Optimization
20210396821 · 2021-12-23 ·

A magnetic sensor array device is comprised of an array of magnetic sensors arranged on a common semiconductor substrate to measure the multi-axis magnetic field of an arbitrary sized region at high speed with high spatial resolution and high magnetic resolution. This invention further improves a multi-axis magnetic sensor array device fabricated on a common semiconductor substrate with additional optimizations to provide for variable spatial resolution, variable magnetic resolution, and a novel secret key derivation.

End-to-end secure operations from a natural language expression
11196540 · 2021-12-07 · ·

Systems and methods for an end-to-end secure operation from an expression in natural language. Exemplary methods include: receiving a set of queries from a natural language processor, the set of queries being produced by a method including: getting data schemas associated with a target data source; obtaining the expression in natural language; performing natural language processing on the expression to determine a desired operation; and generating the set of queries using at least one of matching and inference techniques over the desired operation with respect to the data schemas; encrypting the set of queries using a homomorphic encryption technique; providing the encrypted set of queries to a server, the server including the target data source; acquiring encrypted results, the encrypted results being responsive to the encrypted set of queries; and decrypting the encrypted results using a decryption key to produce desired results.

Data masking

Data masking is provided by, for at least one predetermined data item in data to be sent, applying a one-way function to that data item to produce a first value, producing a masked data item by encrypting the first value via a deterministic encryption scheme using a current encryption key for a current epoch, and replacing that data item by the masked data item. A data-provider computer sends the masked data to the data-user computer. On expiry of the current epoch, the data-provider computer generates a new encryption key for the encryption scheme in a new epoch, produces mask-update data, dependent on the current and new encryption keys, and sends the mask-update data to the data-user computer. The mask-update data permits updating, at the data-user computer, of masked data items produced with the current encryption key into masked data items produced with the new encryption key.

DEVICE FOR DIRECTLY TRANSMITTING ELECTRONIC COIN DATA RECORDS TO ANOTHER DEVICE, AND PAYMENT SYSTEM

A device for directly transmitting electronic coin data records to another device includes accessing data storage, such that an electronic coin data record is stored in the data storage; an interface at least for outputting the at least one electronic coin data record to the other device; and a computing unit configured to mask the electronic coin data record in the device by applying a homomorphic encryption function to the electronic coin data record to obtain a masked electronic coin data record for registering the masked electronic coin data record at a monitoring entity; and to output the electronic coin data record using the interface. A payment system has a monitoring layer including a database in which masked electronic coin data records are stored; and a direct transaction layer including at least two devices in which the method can be carried out.

Batch-wise distributed preprocessing information verification
11368311 · 2022-06-21 · ·

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.

Local encryption for single sign-on

The present disclosure describes techniques that allow for a client-side application, located on a first client device, to generate a random encryption key and encrypt locally-stored application data with the random encryption key. The random encryption key is used in lieu of a password-derived encryption key. In order to ensure that the client-device application is unable to decrypt the locally-stored encrypted application data prior to authenticating with an external authentication source (i.e., SSO, IdP), the random encryption key is encrypted with a key-encrypting key derived using a pseudorandom function (PRF). By using a PRF, the first device is able to authenticate to the first server and derive a secure key as part of the authentication process. Accordingly, the present disclosure describes techniques for securing data on a client device when credentials are managed by an external authentication system.

Distributed ledger based mass balancing via secret sharing
11367148 · 2022-06-21 · ·

A producer may supply amounts x.sub.i of a good to a plurality of consumers C.sub.i in a series of transactions and be subject to a mass balancing verification protocol after every K transactions. A producer platform may compute K random shares (r.sub.1 through r.sub.K) of a random value r, publish blinded amounts t.sub.i representing x.sub.i+r.sub.i to a secure, distributed transaction ledger, and transmit an encrypted r.sub.i to consumer C.sub.i using an asymmetric cryptosystem. A consumer platform may receive and decrypt r.sub.i (while the consumer Ci actually receives an amount {circumflex over (x)}.sub.i of the good from the producer), compute {circumflex over (x)}.sub.i+r.sub.i and generate a fraud alert signal if it differs from the published t.sub.i. The consumer platform may also transmit an encrypted rolling sum value to a next consumer C.sub.i+1. A verifier platform may, after K transactions, execute the mass balance verification protocol to determine a total amount of the good that the producer had collectively supplied to the consumers C.sub.i. The verifier platform may also generate a fraud alert signal when appropriate based on the total amount and a maximum allowed amount.

FUNCTIONS WITH A PRE-CHARGE OPERATION AND AN EVALUATION OPERATION
20220191004 · 2022-06-16 ·

An input data may be received. A portion of a cryptographic operation may be performed with the received input data at a first function component. During the performance of the cryptographic operation at the first function component, a pre-charge operation may be performed at a second function component. Furthermore, the second function component may be used to perform another portion of the cryptographic operation with a result of the portion of the cryptographic operation performed at the first function component.

Encryption device and decryption device
11349668 · 2022-05-31 · ·

An encryption device (10) is an encryption device in authentication encryption. A key generation unit (21) generates a key K of an encryption function E of a block cipher, in accordance with an initial parameter N. A hash calculation unit (22) calculates a hash value msk with an internal parameter ctr as an input. An encryption unit (23) generates a ciphertext c of the message m by using the encryption function E, with a key K generated by the key generation unit (21), a hash value msk calculated by the hash calculation unit (22), and a message m as inputs.

Method for the execution of a binary code of a secure function by a microprocessor

A method for executing a binary code includes for each item of data to be recorded: executing an algorithm for constructing a data line containing a cryptogram of this item of data constructed using an initialization vector iv.sub.j associated with an address @.sub.j of the main memory using a relationship iv.sub.j=F.sub.iv(@.sub.j), where the function F.sub.iv, is a pre-programmed function that associates a different initialization vector iv.sub.j with each different address @.sub.j of a main memory, and then recording this constructed data line in the main memory at the address @.sub.j, where each instruction line of a basic block is constructed by executing the same construction algorithm as the one executed to construct the data line and using the same function F.sub.iv, the item of data for this purpose being taken to be equal to the instruction masked using a mask associated with this basic block.