H04L2209/08

Distributed private key recovery

A method performed by a user device is disclosed. The method comprising generating a secret and measuring a biometric template of a user operating the user device. The method then generates a plurality of secret shares of the secret and of the biometric template. The user device then transmits the secret shares of the secret and of the biometric template to a plurality of recovery devices. After, the user device may then initiate a recovery of the secret and measure a biometric measurement of the user. Data of the biometric measurement may be transmitted to the plurality of recovery devices, where the recovery devices perform a partial computation. The user device use the plurality of partial computations to determine a match between the biometric template and the biometric measurement. If the two biometrics match, the user device can reconstruct the secret using shares of the secret from the recovery devices.

SYSTEMS AND METHODS FOR AUTHENTICATION USING ANTENNA ARRAY GEOMETRIES
20240163111 · 2024-05-16 ·

In one embodiment, an authentication scheme (500) that combines chaotic antenna array geometries with pseudorandom pilot sequences and antenna array activation sequences is provided. A receiving device (110A) receives a pilot signal (130) from a transmitting device (110B) (501). The receiving device computes a unique signature (125) for the transmitting device that captures differences between the received signal and expected pilot signal (503). The differences may be due to a unique antenna array geometry of the transmitting device, a pseudorandom pilot sequence used by the transmitting device, and an antenna array activation sequence used by the transmitting device. Later, this computed unique signature may be used by other receiving devices to authenticate the transmitting device (505; 507).

Protection of cryptographic operations by intermediate randomization

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.

Software PUF based on RISC-V processor for IoT security

Disclosed is a software PUF based on an RISC-V processor for IoT security. A 32-bit RISC-V processor is used to generate abnormal information results in an abnormal operating state under a low voltage, and the abnormal information results are used to represent the features of the 32-bit RISC-V processor; 5-bit binary data obtained by comparing the abnormal information results with normal information results has high randomness and uniqueness and it is extremely difficult to directly extract internal abnormal information result from a hardware circuit of the 32-bit RISC-V processor, so modeling attacks based on the 5-bit binary data calculated according to the abnormal information results of the 32-bit RISC-V processor are almost impossible; in addition, when the 32-bit RISC-V processor is in an abnormal operating state, the operating frequency of the 32-bit RISC-V processor is dynamically adjusted through a frequency compensation method.

Method, system, and apparatus for monitoring network traffic and generating summary
20190253436 · 2019-08-15 ·

The present invention provides a method, a system, and a device for a hash generation and network traffic detection. It uses a method of storing intermediate calculation results to perform hash calculation for streaming data, and uses a matrix multiplication operation as a strong hash algorithm to reduce memory occupation. The present invention can generate hash in real time in the case of streaming data comprising defects, unordered, and overlapping, which is suitable for detecting files from network traffic, and is applicable to virus detection, intrusion detection, data anti-leakage, network content review, digital forensics, digital rights protection, and other fields.

BLOCKCHAIN DATA PROTECTION USING HOMOMORPHIC ENCRYPTION
20190253235 · 2019-08-15 · ·

Implementations of the present disclosure include receiving, by a consensus node from a first account, a digitally signed copy of a commitment value of a transaction amount, a second random number encrypted using a public key of the first account, a third random number encrypted using a public key of the second account, one or more range proofs, and a set of values generated based on one or more selected random numbers. The consensus node then verifies a digital signature corresponding to the digitally signed copy using a public key of the first account corresponding to a private key used to generate the digital signature. It also updates the balance of the first account and a balance of the second account based on the amount of the balance transfer if the first random number, the second random number, and the third random number are the same.

COMPRESSION AND MANIPULATION-RESISTANT FUZZY HASHING
20190245692 · 2019-08-08 ·

Systems and a method for compression and manipulation-resistant fuzzy hashing are provided. In one or more aspects, a system includes a network interface to receive an image object from a network, and a processor to process the image object. The processing includes generating pairs of random numbers using a hash of pixel data of the image object as a seed. The processing further includes identifying a number of coordinate pairs, within image pixels of the image object, such that coordinate values of each coordinate pair of the identified coordinate pairs approximately matches one pair of the random numbers. A number of first entropy values associated with first sub-areas corresponding to the identified coordinate pairs are determined. An anchor point within the image pixels is identified that has coordinate values corresponding to a sub-area that is associated with a highest entropy value among the determined first entropy values.

Method of protecting electronic circuit against eavesdropping by power analysis and electronic circuit using the same
10374791 · 2019-08-06 · ·

An electronic circuit with protection against eavesdropping by power analysis is provided. The electronic circuit includes: a storage element for storing a set of bits; a logic unit for processing the stored set of bits and providing a next state set of bits after two or more cycles, wherein in a first cycle, some of the stored set of bits are provided to the logic unit correctly and some are replaced by random values and in a last cycle, all of the stored set of bits are provided to the logic unit correctly; and a random bit generator that generates a random bit for each bit of the stored set of bits to determine which bits of the stored set of bits are to be provided correctly and which bits are to be replaced in each cycle.

Dynamic User Interfaces For Authentication
20190236258 · 2019-08-01 ·

Disclosed are systems and methods for dynamic user interfaces for authentication. A user interface comprising a plurality of user interface elements can be generated. The plurality of user interface elements can be generated according to a random placement. The each plurality of user interface elements can comprise a random plurality of attribute values.

VIRTUAL ENIGMA CIPHER
20190238313 · 2019-08-01 ·

A virtual enigma cipher system is described herein that allows for symmetric encryption and decryption of data. During encryption, a plurality of wheels representing sequences of data are used to encrypt a message. The plurality of wheels includes at least one dynamic wheel, which is generated based on a password, and a plurality of static wheels. During encryption, the unencrypted message is iterated from beginning to end. During each step of iteration, the encrypted payload value for a particular position is determined by performing an exclusive or (XOR) operation between the value of the unencrypted message at the position, and the values of the wheels at their respective wheel pointer positions. The particular position is then incremented, as are the wheel pointer positions, and iteration continues until the entire unencrypted message has been encrypted as part of the encrypted payload. Padding data and the message length are appended to the encrypted payload. During decryption, the steps are reversed.