A Comprehensive Evaluation of Mutual Information Analysis Using a Fair Evaluation Framework
Open accessThe DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
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
Advances in neural information processing systems 7
Cios, K., & Shields, M. (1997) · Neurocomputing · doi:10.1016/s0925-2312(97)90018-7 · Cited by 22,059
Advances in Neural Information Processing Systems 14: Proceedings of the 2001 Conference
(2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.001.0001 · Cited by 8,890
Kocher, P., Jaffe, J., & Jun, B. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_25 · Cited by 7,407
Correlation Power Analysis with a Leakage Model
Brier, E., Clavier, C., & Olivier, F. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28632-5_2 · Cited by 2,544
(2007) · doi:10.1007/978-0-387-38162-6 · Cited by 1,562
Estimation of entropy and mutual information
Paninski, L. (2003) · Neural Computation · doi:10.1162/089976603321780272 · Cited by 1,442 · cited 3×
“Unfortunately, estimators for MI do not ‘behave nicely’ as do other statistics (such as the correlation coefficient—see below); in fact, there are no universal rates of convergence [14], so that whatever estimator we pick, we can always find a distribution for which the error vanishes arbitrarily slowly.”
BackgroundA 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
Stochastic resonance in climatic change
BENZI, R., PARISI, G., SUTERA, A., & VULPIANI, A. (1982) · Tellus · doi:10.1111/j.2153-3490.1982.tb01787.x · Cited by 830
Gierlichs, B., Batina, L., Tuyls, P., & Preneel, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85053-3_27 · Cited by 626
Power Analysis Attacks: Revealing the Secrets of Smart Cards (Advances in Information Security)
Mangard, S., Oswald, E., & Popp, T. (2007) · Springer eBooks · Cited by 582
Self-citationThe Upward Bias in Measures of Information Derived from Limited Data Samples
Treves, A., & Panzeri, S. (1995) · Neural Computation · doi:10.1162/neco.1995.7.2.399 · Cited by 358
Mutual Information Analysis A Generic Side-Channel Distinguisher
Gierlichs, B., Batina, L., Tuyls, P., & Preneel, B. (2008) · Lecture notes in computer science · Cited by 241
Mutual Information Analysis: How, When and Why?
Veyrat-Charvillon, N., & Standaert, F. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04138-9_30 · Cited by 201
One for all – all for one: unifying standard differential power analysis attacks
Mangard, S., Oswald, E., & Standaert, F. (2011) · IET Information Security · doi:10.1049/iet-ifs.2010.0096 · Cited by 175
Self-citationPower Analysis, What Is Now Possible...
Akkar, M.-L., Bevan, R., Dischamp, P., & Moyart, D. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44448-3_38 · Cited by 174
Prouff, E. (2005) · Lecture Notes in Computer Science · doi:10.1007/11502760_29 · Cited by 164
Mutual Information Analysis: How, When and Why?
Veyrat-Charvillon, N., & Standaert, F. (2009) · Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)) · Cited by 115
Differential Power Analysis Model and Some Results
Guilley, S., Hoogvorst, P., & Pacalet, R. (2004) · IFIP International Federation for Information Processing/IFIP · doi:10.1007/1-4020-8147-2_9 · Cited by 106
Entropy estimates of small data sets
Bonachela, J. A., Haye Hinrichsen, B., & Muñoz, M. A. (2008) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/41/20/202001 · Cited by 106
Theoretical and Practical Aspects of Mutual Information Based Side Channel Analysis
Prouff, E., & Rivain, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01957-9_31 · Cited by 98
Theoretical and practical aspects of mutual information-based side channel analysis
Prouff, E., & Rivain, M. (2010) · International Journal of Applied Cryptography · doi:10.1504/ijact.2010.038306 · Cited by 69
Distribution of Mutual Information
Hütter, M. (2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.003.0056 · Cited by 61
An optimal entropy estimator for discrete random variables
Shiga, M., & Yokota, Y. (2006) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2005.1556038 · Cited by 4
Cited by
Multiparty Computation from Somewhat Homomorphic Encryption
Damgård, I., Pastro, V., Smart, N., & Zakarias, S. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_38 · Cited by 1,331
Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
Brakerski, Z. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_50 · Cited by 1,252
Homomorphic Evaluation of the AES Circuit
Gentry, C., Halevi, S., & Smart, N. P. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_49 · Cited by 796
BKZ 2.0: Better Lattice Security Estimates
Chen, Y., & Nguyen, P. Q. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_1 · Cited by 598
ML Confidential: Machine Learning on Encrypted Data
Graepel, T., Lauter, K., & Naehrig, M. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-37682-5_1 · Cited by 423
Metadata
- Authors
- Whitnall, C., & Oswald, E.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2011
- Pages
- 316-334
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1527450129
- Cited by
- 283
- References
- 23
- FWCI
- 57.79
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.