|
ABSTRACT
We present a model of adaptive side-channel attacks which we combine with information-theoretic metrics to quantify the information revealed to an attacker. This allows us to express an attacker's remaining uncertainty about a secret as a function of the number of side-channel measurements made. We present algorithms and approximation techniques for computing this measure. We also give examples of how they can be used to analyze the resistance of hardware implementations of cryptographic functions to both timing and power attacks.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
G. Barthe, T. Rezk, and M. Warnier. Preventing Timing Leaks Through Transactional Branching Instructions. In Proc. QAPL '05, ENTCS, pages 33--55. Elsevier.
|
| |
3
|
G. Basharin. On a Statistical Estimate for the Entropy of a Sequence of Independent Random Variables. Theory Probab. Appl., 47:333--336, 1959.
|
 |
4
|
Tuǧkan Batu , Sanjoy Dasgupta , Ravi Kumar , Ronitt Rubinfeld, The complexity of approximating entropy, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada
[doi> 10.1145/509907.510005]
|
| |
5
|
|
| |
6
|
|
| |
7
|
C. Cachin. Entropy Measures and Unconditional Security in Cryptography. PhD thesis, ETH Züurich, 1997.
|
| |
8
|
J. Cathalo, F. Koeune, and J.-J. Quisquater. A New Type of Timing Attack: Application to GPS. In Proc. CARDIS '03, LNCS 2779, pages 291--303. Springer.
|
| |
9
|
|
| |
10
|
|
| |
11
|
|
| |
12
|
|
| |
13
|
|
| |
14
|
|
| |
15
|
|
| |
16
|
J. W. Gray. Toward a Mathematical Foundation for Information Flow Security. JCS, 1(3-4):255--294, 1992.
|
| |
17
|
D. Hedin and D. Sands. Timing Aware Information Flow Security for a JavaCard-like Bytecode. In BYTECODE '05, ENTCS. Elsevier.
|
| |
18
|
|
| |
19
|
|
| |
20
|
B. Köpf and D. Basin. Timing-Sensitive Information Flow Analysis for Synchronous Systems. In Proc. ESORICS '06, LNCS 4189, pages 243--262. Springer.
|
| |
21
|
|
| |
22
|
J. L. Massey. Guessing and Entropy. In Proc. IEEE Int. Symp. on Info. Th. '94, page 204. IEEE.
|
| |
23
|
|
| |
24
|
|
| |
25
|
S. Micali and L. Reyzin. Physically Observable Cryptography (Extended Abstract). In Proc. TCC '04, LNCS 2951, pages 278--296. Springer.
|
| |
26
|
J. K. Millen. Covert Channel Capacity. In Proc. IEEE Symp. on Security and Privacy '87, pages 60--66. IEEE.
|
| |
27
|
|
| |
28
|
D. A. Osvik, A. Shamir, and E. Tromer. Cache Attacks and Countermeasures: the Case of AES. In Proc. CT-RSA '06, LNCS 3860, pages 1--20. Springer.
|
| |
29
|
|
| |
30
|
|
| |
31
|
|
| |
32
|
|
 |
33
|
|
| |
34
|
W. Schindler, K. Lemke, and C. Paar. A Stochastic Model for Differential Side-Channel Cryptanalysis. In Proc. CHES '05, LNCS 3659, pages 30--46. Springer.
|
| |
35
|
C. Shannon. A Mathematical Theory of Communication. Bell System Technical Journal, 27:379--423 and 623--656, July and October 1948.
|
 |
36
|
|
| |
37
|
F.-X. Standaert, E. Peeters, C. Archambeau, and J.-J. Quisquater. Towards Security Limits in Side-Channel Attacks. In Proc. CHES '06, LNCS 4249, pages 30--45. Springer.
|
| |
38
|
T. Tolstrup. Language-based Security for VHDL. PhD thesis, Technical University of Denmark, 2007.
|
| |
39
|
J. Wittbold and D. Johnson. Information flow in nondeterministic systems. In Proc. IEEE Symp. on Security and Privacy '90, pages 144--161. IEEE.
|
| |
40
|
|
CITED BY 2
|
|
Christophe Petit , François-Xavier Standaert , Olivier Pereira , Tal G. Malkin , Moti Yung, A block cipher based pseudo random number generator secure against side-channel key recovery, Proceedings of the 2008 ACM symposium on Information, computer and communications security, March 18-20, 2008, Tokyo, Japan
|
|
|
|
|