Abstract: A back-end server computer comprises a processor and computer-readable medium that comprises code executable by the processor for implementing the following method. The back-end server computer obtains a message comprising content to provide to an application installed on a user device. The back-end server computer encrypts the message with a master secret key or a key derived from the master secret key to obtain an encrypted message. The back-end server computer provides the encrypted message to the user device. The user device, using a secure element, signs the encrypted message, cryptographically recovers, using a whitebox in the application, a secure element public key from a certified key using a back-end server computer public key, cryptographically recovers, using the whitebox, the encrypted message from the signed encrypted message, and decrypts, using the whitebox, the encrypted message using the master secret key or the key derived therefrom to obtain the message.

Abstract: A method is disclosed. The method includes receiving, by a user device, an encrypted message from a server computer. The encrypted message is a message encrypted with a master secret key or a key derived from the master secret key. The user device signs the encrypted message with a secure element private key. The user device, using a whitebox, cryptographically recovers a secure element public key from a certified key using a server computer public key. The certified key is certified by the server computer and based on at least the secure element public key. The user device, using the whitebox, cryptographically recovers the encrypted message from the signed encrypted message using the secure element public key. The user device, using the whitebox, decrypts the encrypted message using the master secret key or the key derived from the master secret key in the whitebox to obtain the message.

Abstract: Improvements to post-quantum lattice-based digital signature schemes are disclosed. By sampling cryptographic material, including cryptographic key matrices and masking vectors from a uniform distribution, embodiments eliminate the need for a security check during generation of a digital signature vector. As a result, digital signatures can be generated faster and at a lower failure rate. A generating device can generate a verification matrix A and a secret matrix S from a uniform distribution, and an error matrix E from a special distribution (such as a Gaussian). The generating device can combine the three matrices to generate a public matrix Y. The first and the fourth matrices (A, Y) can be used as a public key used to verify digital signatures. The second and the third matrices (S, E) can be used as a private key used to generate digital signatures.

Abstract: Systems, methods, and apparatuses for protecting a secret on a device with limited memory, while still providing tamper resistance, are described. To achieve security, an encoding computer can apply a memory-hard function MHF to a secret S and determine a result Y, then determine a proof ? for the result Y. Then, the encoding computer can send a codeword C comprising the secret S and the proof ? to a decoding computer. The decoding computer can retrieve the codeword C from persistent memory and parse the secret S and the proof ?. The decoding device can use transient memory to decode the codeword C by verifying the proof ? was generated with the secret S and the result Y. When the correctness of the result Y is verified, the decoding device can apply a cryptographic function to input data using the secret S then reset the transient memory.

Abstract: A non-antibody binding peptide or its analogs is provided, wherein the non-antibody binding peptide includes a backbone and at least one side chain linked to the backbone, wherein an amino acid sequence of the side chain is SEQ ID NO: 3, and an amino acid sequence of the backbone is at least one of SEQ ID NO: 1, SEQ ID NO: 2 or SEQ ID NO: 7. Also provided is a polynucleotide encoding the non-antibody binding peptide, a recombinant vector, and a host cell. Further provided is a preparation, including the non-antibody binding peptide or its analogs, wherein the preparation is a drug or a cell marker reagent. Further provided is a use of the non-antibody binding peptide or its analogs in preparation of a tumor diagnosis reagent, an immunoregulation drug or an anti-tumor drug.

Abstract: Embodiments are directed to methods and systems for crypto-agile encryption and decryption. A computer system can possess a protocol file that identifies one or more cryptographic software modules. Using these cryptographic software modules, the computer system can generate a plurality of shared secrets and a session key, then use the session key to encrypt a message. The message can be sent to a server computer that can subsequently decrypt the message. At a later time, the protocol file can be updated to identify a different set of cryptographic software modules, which can be used to encrypt messages. Further, the server computer can transmit additional cryptographic software modules to the computer system, enabling the computer system to use those cryptographic software modules to generate cryptographic keys. As such, the cryptographic protocol file can be changed in response to changes in the cryptographic needs of the computer system.

Abstract: Improvements to post-quantum lattice-based digital signature schemes are disclosed. By sampling cryptographic material, including cryptographic key matrices and masking vectors from a uniform distribution, embodiments eliminate the need for a security check during generation of a digital signature vector. As a result, digital signatures can be generated faster and at a lower failure rate. A generating device can generate a verification matrix A and a secret matrix S from a uniform distribution, and an error matrix E from a special distribution (such as a Gaussian). The generating device can combine the three matrices to generate a public matrix Y. The first and the fourth matrices (A, Y) can be used as a public key used to verify digital signatures. The second and the third matrices (S, E) can be used as a private key used to generate digital signatures.

Abstract: A silicon-based negative electrode material is provided. The material includes a silicon-based core, a carbon layer coating the silicon-based core, and a phenyl-compound layer coating the carbon layer. A phenyl compound in the phenyl-compound layer has a structural formula illustrated in formula (I): where R1 has a carbon-carbon double bond or a carbon-carbon triple bond, and at least one of R2, R3, R4, R5, or R6 has an organic acid group; or R1 is an organic acid group having a carbon-carbon double bond or a carbon-carbon triple bond. The silicon based negative electrode material has a stable performance and high cycle efficiency, which is beneficial to widespread application thereof. A method for preparing a silicon-based negative electrode material and a battery are further provided.

Abstract: Improvements to post-quantum lattice-based digital signature schemes are disclosed. By sampling cryptographic material, including cryptographic key matrices and masking vectors from a uniform distribution, embodiments eliminate the need for a security check during generation of a digital signature vector. As a result, digital signatures can be generated faster and at a lower failure rate. A generating device can generate a verification matrix A and a secret matrix S from a uniform distribution, and an error matrix E from a special distribution (such as a Gaussian). The generating device can combine the three matrices to generate a public matrix Y. The first and the fourth matrices (A, Y) can be used as a public key used to verify digital signatures. The second and the third matrices (S, E) can be used as a private key used to generate digital signatures.

Abstract: Techniques of generating a lattice-based verification matrix and signature vector are disclosed. The method enables a generating device to sample a gadget matrix and then generate a reduced gadget matrix. The generating device may then sample a trapdoor matrix and use the trapdoor matrix and the reduced gadget matrix to generate a verification matrix. A sending device may receive the trapdoor matrix and the verification matrix from the generating device, in addition to receiving a message. The sending device may then use the trapdoor matrix and the verification matrix to generate a signature vector for the message. A verification device can receive the verification matrix, the message, and the signature vector. The verification device may use the verification matrix and the signature vector to verify the message.

Abstract: A method is disclosed. The method includes receiving, by a user device, an encrypted message from a server computer. The encrypted message is a message encrypted with a master secret key or a key derived from the master secret key. The user device signs the encrypted message with a secure element private key. The user device, using a whitebox, cryptographically recovers a secure element public key from a certified key using a server computer public key. The certified key is certified by the server computer and based on at least the secure element public key. The user device, using the whitebox, cryptographically recovers the encrypted message from the signed encrypted message using the secure element public key. The user device, using the whitebox, decrypts the encrypted message using the master secret key or the key derived from the master secret key in the whitebox to obtain the message.

Abstract: Techniques of generating a lattice-based verification matrix and signature vector are disclosed. The method enables a generating device to sample a gadget matrix and then generate a reduced gadget matrix. The generating device may then sample a trapdoor matrix and use the trapdoor matrix and the reduced gadget matrix to generate a verification matrix. A sending device may receive the trapdoor matrix and the verification matrix from the generating device, in addition to receiving a message. The sending device may then use the trapdoor matrix and the verification matrix to generate a signature vector for the message. A verification device can receive the verification matrix, the message, and the signature vector. The verification device may use the verification matrix and the signature vector to verify the message.

Abstract: Improvements to post-quantum lattice-based digital signature schemes are disclosed. By sampling cryptographic material, including cryptographic key matrices and masking vectors from a uniform distribution, embodiments eliminate the need for a security check during generation of a digital signature vector. As a result, digital signatures can be generated faster and at a lower failure rate. A generating device can generate a verification matrix A and a secret matrix S from a uniform distribution, and an error matrix E from a special distribution (such as a Gaussian). The generating device can combine the three matrices to generate a public matrix Y. The first and the fourth matrices (A, Y) can be used as a public key used to verify digital signatures. The second and the third matrices (S, E) can be used as a private key used to generate digital signatures.

Abstract: Systems, methods, and apparatuses for protecting a secret on a device with limited memory, while still providing tamper resistance, are described. To achieve security, an encoding computer can apply a memory-hard function MHF to a secret S and determine a result Y, then determine a proof ? for the result Y. Then, the encoding computer can send a codeword C comprising the secret S and the proof ? to a decoding computer. The decoding computer can retrieve the codeword C from persistent memory and parse the secret S and the proof ?. The decoding device can use transient memory to decode the codeword C by verifying the proof ? was generated with the secret S and the result Y. When the correctness of the result Y is verified, the decoding device can apply a cryptographic function to input data using the secret S then reset the transient memory.

Abstract: The invention discloses a sleep quality monitoring system for the middle-aged and the elderly. The sleep quality monitoring system for the middle-aged and the elderly detects the sleep quality of the middle-aged and the elderly by a power socket A, an adapter A, a mobile phone APP, a cloud server, a bedside lamp, a power socket B, an adapter B, a transceiver controller, a humidity sensor, a temperature sensor, a pressure sensor, a heating pad, a signal collecting unit, a processor transmitting signal unit, a humidity sensing unit, a temperature sensing unit, an alarm unit, a preheating unit, a heating unit and a signal receiving processing unit.

Abstract: Techniques of generating a lattice-based verification matrix and signature vector are disclosed. The method enables generating device to sample a gadget matrix and then generate a reduced gadget matrix. The generating device may then sample a trapdoor matrix and use the trapdoor matrix and the reduced gadget matrix to generate a verification matrix. A sending device may receive the trapdoor matrix and the verification matrix from the generating device, in addition to receiving a message. The sending device may then use the trapdoor matrix and the verification matrix to generate a signature vector for the message. A verification device can receive the verification matrix, the message, and the signature vector. The verification device may use the verification matrix and the signature vector to verify the message.

Abstract: Systems, methods, and apparatuses for protecting a secret on a device with limited memory, while still providing tamper resistance, are described. To achieve security, an encoding computer can apply a memory-hard function MHF to a secret S and determine a result Y, then determine a proof ? for the result Y. Then, the encoding computer can send a codeword C comprising the secret S and the proof ? to a decoding computer. The decoding computer can retrieve the codeword C from persistent memory and parse the secret S and the proof ?. The decoding device can use transient memory decode the codeword C by verifying the proof ? was generated with the secret S and the result Y. When the correctness of the result Y is verified, the decoding device can apply a cryptographic function to input data using the secret S then reset the transient memory.

Abstract: A reference-level gear helix artifact for transferring gear helix value. The invention provides a reference-level gear helix artifact with a global symmetrical structure that can be easily obtained by generating method. The centroid point of the artifact passes through the geometric center of the artifact mandrel. The cylinder of the reference-level gear helix artifact is provided with the straight tooth groove, the left-hand tooth groove and the right-hand tooth groove, axial reference torus and radial reference cylinder, fine tooth threads and center holes. Among them, the straight tooth groove includes a pair of involute cylindrical surfaces with opposite 0° helix angle, the left-handed tooth groove includes a involute helicoidal surface with 15° and a involute helicoidal surface with 30°, and the right-hand tooth groove includes a involute helicoidal surface with 15° and a involute helicoidal surface with 30°.

Abstract: A mutual-lapping device and mutual-lapping method for improving processing precision based on the principle of error averaging is proposed. The device including driving friction wheel, driving belt pulley, transmission belt A, connecting rod A, rotation shaft segment A, multi-ball sleeve, mutual-lapping gear A, tension spring, driven friction wheel, pendulum bar of the driven friction wheel, driven belt pulley, transmission belt B, connecting rod B, pressure spring of tensioning pulley, tensioner mechanism, rotation shaft segment B and mutual-lapping gear B. By mutual lapping the high-precision gears, not only the pitch deviation, tooth profile deviation, helix deviation and runout can be reduced synchronously, but also the machining cost is low. Meanwhile, the effect of improving pitch accuracy, profile accuracy, helix accuracy and runout accuracy and reducing surface roughness is remarkable.

Abstract: A mutual-lapping device and mutual-lapping method for improving processing precision based on the principle of error averaging is proposed. The device including driving friction wheel, driving belt pulley, transmission belt A, connecting rod A, rotation shaft segment A, multi-ball sleeve, mutual-lapping gear A, tension spring, driven friction wheel, pendulum bar of the driven friction wheel, driven belt pulley, transmission belt B, connecting rod B, pressure spring of tensioning pulley, tensioner mechanism, rotation shaft segment B and mutual-lapping gear B. By mutual lapping the high-precision gears, not only the pitch deviation, tooth profile deviation, helix deviation and runout can be reduced synchronously, but also the machining cost is low. Meanwhile, the effect of improving pitch accuracy, profile accuracy, helix accuracy and runout accuracy and reducing surface roughness is remarkable.