Natural input encryption and method of use
OwnerSilvio Micaliinventor
Life of this patent
Estimating the term…
Abstract
Secure devices (e.g., a cryptophone, a cryptofax, a computer or other such electronic device) have an encryptor and a digitizer, the digitizer for receiving an input and generating an output supplied to the encryptor. According to the invention, the encryptor and the digitizer are coupled either physically, logically or through non-tamperable software to guarantee that a given ciphertext is the encryption, generated by the encryptor, of an output generated by the digitizer.
Claims19
In a secure device having an encryptor and a digitizer, the digitizer for receiving an input i and generating an output supplied to the encryptor, the improvement comprising:
- coupling the encryptor to the digitizer in such a manner as to guarantee that a given ciphertext is the encryption, generated by the encryptor, of an output i', generated by the digitizer.
A method to guarantee that a given ciphertext is the encryption generated by a given encryptor of an output i' generated by a given digitizer, comprising the steps of:
- locating the encryptor within a tamper-proof area of a secure device;
- having the digitizer send output i' to the encryptor located within the tamper-proof area after checking that a given input i to the digitizer satisfies some given properties.
A method to guarantee that a given output is generated by a given algorithm A comprising the steps of:
- choosing an algorithm S capable of generating digital guarantees;
- writing a single program P that, given any input i, outputs A(i), the output of A on input i, together with S(A(i)), a guarantee generated by S that A(i) is an output of A;
- and
- embedding into P one or more artificial complexities that make it harder for an enemy to recover S from P.
A method to guarantee that a given output is generated by a given algorithm A, comprising the steps of:
- combining A and a digital-guarantee algorithm S to produce a public algorithm P such that, on any input x, public algorithm P outputs y, a correct output of algorithm A on input x, together with a string s guaranteeing that y is the output of algorithm A on input x;
- and
- embedding into P one or more artificial complexities that makes it hard for an enemy to compute an output pair (y,s) of P.
Dependencies are inferred from the claim text.