A simple unpredictable pseudo random number generator
SIAM Journal on Computing
Random number generators: good ones are hard to find
Communications of the ACM
Software protection and simulation on oblivious RAMs
Journal of the ACM (JACM)
Contemporary Cryptology: The Science of Information Integrity
Contemporary Cryptology: The Science of Information Integrity
Shift Register Sequences
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
DES and Differential Power Analysis (The "Duplication" Method)
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Practical Cryptography
Tamper resistance: a cautionary note
WOEC'96 Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2
Predicting the shrinking generator with fixed connections
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
| Hi-index | 0.00 |
We discuss the following problem: how to guarantee privacy of a circuit if an adversary can eavesdrop on its wires, where the functionality of the circuit is assumed public and the adversary attempts to discover information regarding the computation, namely, input, intermediate results and output. We present a solution by introducing a private stateful circuit that securely (against probing attacks) computes the same function as the original circuit does. This is achieved with a reasonable increase in circuit size and depth.