The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
An information-theoretic model for adaptive side-channel attacks
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Kocher, P., Jaffe, J., & Jun, B. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_25 · Cited by 7,407
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
Kocher, P. C. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_9 · Cited by 4,387
Cache Attacks and Countermeasures: The Case of AES
Osvik, D. A., Shamir, A., & Tromer, E. (2006) · Lecture Notes in Computer Science · doi:10.1007/11605805_1 · Cited by 1,352
Chari, S. T., Rao, J. R., & Rohatgi, P. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36400-5_3 · Cited by 1,313
Electromagnetic Analysis: Concrete Results
Gandolfi, K., Mourtel, C., & Olivier, F. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44709-1_21 · Cited by 1,311
Towards Sound Approaches to Counteract Power-Analysis Attacks
Chari, S. T., Jutla, C. S., Rao, J. R., & Rohatgi, P. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48405-1_26 · Cited by 1,126
ElectroMagnetic Analysis (EMA): Measures and Counter-measures for Smart Cards
Quisquater, J.-J., & Samyde, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45418-7_17 · Cited by 1,077
Remote timing attacks are practical
Brumley, D., & Boneh, D. (2005) · Computer Networks · doi:10.1016/j.comnet.2005.01.010 · Cited by 871
Introduction to functional programming
Bird, R. S. (1988) · Cited by 693
Massey, J. L. (2002) · Proceedings of 1994 IEEE International Symposium on Information Theory · doi:10.1109/isit.1994.394764 · Cited by 463
Introduction to Functional Programming using Haskell
Bird, R. S. (1998) · Medical Entomology and Zoology · Cited by 412
Secure information flow in a multi-threaded imperative language
Smith, G., & Volpano, D. (1998) · Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98 · doi:10.1145/268946.268975 · Cited by 406
Agat, J. (2000) · Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/325694.325702 · Cited by 340
Power Analysis Attacks of Modular Exponentiation in Smartcards
Messerges, T. S., Dabbish, E. A., & Sloan, R. H. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48059-5_14 · Cited by 330
Probabilistic noninterference for multi-threaded programs
Sabelfeld, A., & Sands, D. (2002) · Proceedings 13th IEEE Computer Security Foundations Workshop. CSFW-13 · doi:10.1109/csfw.2000.856937 · Cited by 304
On a Statistical Estimate for the Entropy of a Sequence of Independent Random Variables
Basharin, G. P. (1959) · Theory of Probability & Its Applications · doi:10.1137/1104033 · Cited by 263
Entropy measures and unconditional security in cryptography
Cachin, C. (1997) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-001806220 · Cited by 246
Lowe, G. (2003) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2002.1021804 · Cited by 142
Quantitative Information Flow, Relations and Polymorphic Types
Clark, D. (2005) · Journal of Logic and Computation · doi:10.1093/logcom/exi009 · Cited by 140
Pierro, A. D., Hankin, C., & Wiklicky, H. (2003) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2002.1021803 · Cited by 113
On the Incomparability of Entropy and Marginal Guesswork in Brute-Force Attacks
Pliam, J. O. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44495-5_7 · Cited by 77
Timing Aware Information Flow Security for a JavaCard-like Bytecode
Hedin, D. S., & Sands, D. (2005) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2005.02.031 · Cited by 69
Preventing Timing Leaks Through Transactional Branching Instructions
Barthe, G., Rezk, T., & Warnier, M. (2006) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2005.10.031 · Cited by 68
Timing-Sensitive Information Flow Analysis for Synchronous Systems
Köpf, B., & Basin, D. (2006) · Lecture notes in computer science · doi:10.1007/11863908_16 · Cited by 18
Self-citationLanguage-based Security for VHDL
Tolstrup, T. K., Nielson, H. R., & Nielson, F. (2006) · Cited by 6
Cited by
A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
Standaert, F.-X., Malkin, T. G., & Yung, M. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01001-9_26 · Cited by 925
A Primer on Hardware Security: Models, Methods, and Metrics
Rostami, M., Koushanfar, F., & Karri, R. (2014) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2335155 · Cited by 658
Introduction to differential power analysis
Kocher, P., Jaffe, J., Jun, B., & Rohatgi, P. (2011) · Journal of Cryptographic Engineering · doi:10.1007/s13389-011-0006-y · Cited by 632
On the Foundations of Quantitative Information Flow
Smith, G. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00596-1_21 · Cited by 570
Introduction to Side-Channel Attacks
Standaert, F.-X. (2010) · Integrated Circuits and Systems · doi:10.1007/978-0-387-71829-3_2 · Cited by 319
Metadata
- Authors
- Köpf, B., & Basin, D.
- Venue
- Proceedings of the 14th ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 2007-10-28
- Pages
- 286-296
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2119966192
- Cited by
- 365
- References
- 28
- FWCI
- 9.32
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.