Continuous space-bounded non-malleable codes from stronger proofs-of-space
US11212103B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Aug 7, 2019 |
| Grant date | Dec 28, 2021 |
| Priority date | — |
| Expiry date | Aug 7, 2039 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L2209/34
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.