Patent classifications
H04L2209/26
Methods and devices for secure secret key generation
There is provided a cryptographic key determination device for determining one or more cryptographic keys in a cryptographic device, the cryptographic device being configured to execute one or more test programs, the cryptographic device comprising one or more components (11-i), each component (11-i) being configured to generate static and dynamic data, the dynamic data being generated in response to the execution of the one or more test programs, wherein the cryptographic key determination device comprises: a data extraction unit configured to extract at least one part of the static data and at least one part of the dynamic data generated by the one or more components (11-i), and a key generator configured to combine the at least one part of static data and the at least one part of dynamic data, and to determine the one or more cryptographic keys by applying a cryptographic function to the combined data.
MULTI-DEVICE REMOTE ATTESTATION
Systems and methods for attesting an enclave in a network. A method includes receiving, by a first device, proof information from an application provider entity that the enclave is secure, wherein the proof information includes a public part, Ga, of information used by the enclave to derive a Diffie-Hellman key in a key generation process with the application provider entity, processing, by the first device, the proof information to verify that the enclave is secure and ensuring that Ga is authentic and/or valid, deriving, by the first device, a new Diffie-Hellman key, based on Ga and x, wherein x is a private part of information used by the first device to derive the new Diffie-Hellman key, and sending, by the first device, a message including Ga and a public part, Gx, of the information used by the first device to derive the new Diffie-Hellman key to the enclave.
Secure access control processes
A process of linking a key to a component is disclosed herein. In various aspects, the key may be a password, hash, key, encryption key, decryption key, seed value, unlock code, or other alphanumeric identifier, and the component includes a computer in networked communication, and may further include a specific user of the computer. The process may include the step of identifying a component using environmental variables associated with the component, and the process step of forming a representation of the key unique to the component. The representation is tested to determine that the identified component is the source of the representation, in various aspects. Accordingly, the process may include the step of testing the representation against previous representations thereby determining the representation is not statistically duplicative of previous representations, and the process may include the step of testing the representation against possible representations from the component where the possible representations are unique to the component.
Homomorphic Encryption-Based Testing Computing System
A homomorphic encryption-based testing computing system provides a risk-based, automated, one-directional push of production data through a homomorphic encryption tool and distributes the encrypted data to use in testing of applications. Data elements and test requirements are considered when automatically selecting a homomorphic encryption algorithm. A decisioning component selects an algorithm to use to homomorphically encrypt the data set and a push mechanism performs one or both of the homomorphic encryption and distribution of the encrypted data set to at least one intended host. Once delivered, the testing software and/or testing procedures proceed using the encrypted data set, where results of the testing may be stored in a data store. A validation mechanism may validate the test data against production data and communicates whether testing was successful.
Blockchain-based data verification method, apparatus, and electronic device
The present application provides blockchain-based anti-counterfeiting methods, apparatuses, and systems. One method includes: obtaining an anti-counterfeiting verification request submitted by a user for a product; initiating anti-counterfeiting verification of the product in response to the anti-counterfeiting verification request, wherein the anti-counterfeiting verification comprises integrity verification of anti-counterfeiting information generated by a plurality of anti-counterfeiting participants on a blockchain, wherein the anti-counterfeiting information comprises a plurality of types of anti-counterfeiting identification information corresponding to the product; and returning an anti-counterfeiting verification result for the product to the user.
SIMULATION DEVICE AND METHOD FOR HOMOMORPHIC CRYPTOSYSTEM
An electronic device is disclosed. The electronic device comprises: a memory for storing at least one instruction; and a processor for executing at least one instruction, wherein the processor executes the at least one instruction so as to, when an operation command for a homomorphic ciphertext is input, obtain an operation result by using a plaintext operation corresponding to the operation command and a plaintext corresponding to the homomorphic ciphertext, and output the obtained operation result in a manner corresponding to the operation command.
Vulnerability scanning of attack surfaces
A method includes: identifying, by a runtime instrumentation agent of a web server, a plurality of attack surfaces of a web application executed on the web server; generating, by the runtime instrumentation agent, a plurality of hash values, where each hash value is generated based on one of the plurality of attack surfaces; and transmitting, by the runtime instrumentation agent, the plurality of hash values to an attack server external to the web server, where the attack server is to determine whether to scan each attack surface based on the plurality of hash values.
Multi-device remote attestation
Systems and methods for attesting an enclave in a network. A method includes receiving, by a first device, proof information from an application provider entity that the enclave is secure, wherein the proof information includes a public part, Ga, of information used by the enclave to derive a Diffie-Hellman key in a key generation process with the application provider entity, processing, by the first device, the proof information to verify that the enclave is secure and ensuring that Ga is authentic and/or valid, deriving, by the first device, a new Diffie-Hellman key, based on Ga and x, wherein x is a private part of information used by the first device to derive the new Diffie-Hellman key, and sending, by the first device, a message including Ga and a public part, Gx, of the information used by the first device to derive the new Diffie-Hellman key to the enclave.
RANKED HASH VALIDATION FOR NEW SOFTWARE UPDATE FILE
In one aspect, a device may include a processor and storage with instructions executable to identify a ranking of different chunks of a new update file, with the different ranks associated with different hashing algorithms. The instructions may also be executable to determine whether a respective newly-received hash for a respective chunk of the new update file is different from a respective prior hash of a prior software version for the same respective chunk. Responsive to the respective newly-received hash being different from the respective prior hash for the same chunk, the instructions may be executable to attempt to validate the respective chunk using the respective hashing algorithm associated with the respective rank for the respective chunk. Responsive to the respective newly-received hash being the same as the respective prior hash for the same respective chunk, the instructions may be executable to decline to attempt to validate the respective chunk.
Efficient estimator of min-entropy
Disclosed herein is an apparatus for estimating randomness of a random number generator. The apparatus is configured to divide output data (302), generated by the random number generator (704), into blocks (310) of a length (L), estimate a Shannon entropy of a second sub-set (404) of the blocks (310), using a first sub-set (402) of the blocks (310) to initialize the estimating, solve an estimate function, that relates an argument parameter (θ) to the Shannon entropy estimate, to determine a value for the argument parameter (θ) that is indicative of a probability of a most probable block being generated by the random number generator (704) as a new block, and use the length (L) to tune an estimate of randomness of the random number generator (704) calculated based on the value for the argument parameter (θ).