The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Masking against Side-Channel Attacks: A Formal Security Proof
Open accessOverview
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756 · cited 1×
“A more practical and traditionally used approach to secure implementations against side-channel attacks is secret sharing [1, 37] also called masking in this context.”
BackgroundKocher, 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
Safeguarding cryptographic keys
BLAKLEY, G. R. (1979) · 1979 International Workshop on Managing Requirements Knowledge (MARK) · doi:10.1109/mark.1979.8817296 · Cited by 3,499
(1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1 · Cited by 2,619
(2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45473-x · Cited by 1,422
Polynomial Reconstruction Based Cryptography
Kiayias, A., & Yung, M. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45537-x_10 · Cited by 1,361
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
Private Circuits: Securing Hardware against Probing Attacks
Ishai, Y., Sahai, A., & Wagner, D. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_27 · Cited by 1,073
Advances in Cryptology - CRYPTO 2003
(2003) · Lecture notes in computer science · doi:10.1007/b11817 · Cited by 942
(1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5 · Cited by 783
(2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36400-5 · Cited by 671
A Logic Level Design Methodology for a Secure DPA Resistant ASIC or FPGA Implementation
Tiri, K., & Verbauwhede, I. M. R. (2004) · Cited by 596
DES and Differential Power Analysis The “Duplication” Method
Goubin, L., & Patarin, J. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48059-5_15 · Cited by 593
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
Provably Secure Higher-Order Masking of AES
Rivain, M., & Prouff, E. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15031-9_28 · Cited by 526
Self-citation(2004) · Lecture notes in computer science · doi:10.1007/b99451 · Cited by 523
Leakage-Resilient Cryptography
Dziembowski, S., & Pietrzak, K. (2008) · 2008 49th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2008.56 · Cited by 504
(2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5 · Cited by 500
(2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74735-2 · Cited by 418
A New Randomness Extraction Paradigm for Hybrid Encryption
Kiltz, E., Pietrzak, K., Stam, M., & Yung, M. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01001-9_34 · Cited by 384
Physically Observable Cryptography
Micali, S., & Reyzin, L. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24638-1_16 · Cited by 378
Advances in Cryptology – CRYPTO 2010
(2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7 · Cited by 370
Cryptographic Hardware and Embedded Systems — CHES 2001
Koç, Ã. K., Paar, C., & Naccache, D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44709-1 · Cited by 370
More Efficient Constant-Round Multi-party Computation from BMR and SHE
Lindell, Y., Smart, N. P., & Soria-Vazquez, E. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53641-4_21 · Cited by 360
The World Is Not Enough: Another Look on Second-Order DPA
Standaert, F., Veyrat-Charvillon, N., Oswald, E., Gierlichs, B., Medwed, M., Kasper, M., & Mangard, S. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-17373-8_7 · Cited by 356
Provably Secure Masking of AES
Blömer, J., Guajardo, J., & Krummel, V. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30564-4_5 · Cited by 276
Cryptographic Hardware and Embedded Systems — CHES 2000
Koç, Ã. K., & Paar, C. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44499-8 · Cited by 271
A Leakage-Resilient Mode of Operation
Pietrzak, K. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01001-9_27 · Cited by 261
An AES Smart Card Implementation Resistant to Power Analysis Attacks
Herbst, C., Oswald, E., & Mangard, S. (2006) · Lecture notes in computer science · doi:10.1007/11767480_16 · Cited by 261
Standaert, F.-X., & Archambeau, C. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85053-3_26 · Cited by 219
Cryptographic Hardware and Embedded Systems Ches 2008
Oswald, E., & Rohatgi, P. (2009) · Cited by 204
Power and electromagnetic analysis: Improved model, consequences and comparisons
Peeters, E., Standaert, F.-X., & Quisquater, J.-J. (2007) · Integration · doi:10.1016/j.vlsi.2005.12.013 · Cited by 190
Coron, J.-S., Kocher, P., & Naccache, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45472-1_12 · Cited by 158
Perfectly Secure Password Protocols in the Bounded Retrieval Model
Crescenzo, G. D., Lipton, R., & Walfish, S. (2006) · Lecture notes in computer science · doi:10.1007/11681878_12 · Cited by 151
Faust, S., Kiltz, E., Pietrzak, K., & Rothblum, G. N. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-11799-2_21 · Cited by 144
Higher-Order Glitches Free Implementation of the AES Using Secure Multi-party Computation Protocols
Prouff, E., & Roche, T. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23951-9_5 · Cited by 127
Self-citationProtecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
Faust, S., Rabin, T., Reyzin, L., Tromer, E., & Vaikuntanathan, V. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13190-5_7 · Cited by 125
Analysis and Improvement of the Random Delay Countermeasure of CHES 2009
Coron, J.-S., & Kizhvatov, I. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15031-9_7 · Cited by 124
Higher-Order Masking Schemes for S-Boxes
Carlet, C., Goubin, L., Prouff, E., Quisquater, M., & Rivain, M. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34047-5_21 · Cited by 120
Self-citationLeakage Resilient ElGamal Encryption
Kiltz, E., & Pietrzak, K. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-17373-8_34 · Cited by 109
Coron, J.-S., Naccache, D., & Kocher, P. C. (2004) · ACM Transactions on Embedded Computing Systems · doi:10.1145/1015047.1015050 · Cited by 107
Practical leakage-resilient pseudorandom generators
Yu, Y., Standaert, F., Pereira, O., & Yung, M. M. (2010) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1866307.1866324 · Cited by 101
Securing Computation against Continuous Leakage
Goldwasser, S., & Rothblum, G. N. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14623-7_4 · Cited by 87
Thwarting Higher-Order Side Channel Analysis with Additive and Multiplicative Maskings
Genelle, L., Prouff, E., & Quisquater, M. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23951-9_16 · Cited by 74
Self-citationHow to Compute in the Presence of Leakage
Goldwasser, S., & Rothblum, G. N. (2012) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2012.34 · Cited by 72
Standaert, F., Örs, B., & Preneel, B. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28632-5_3 · Cited by 49
How to Compute under $${\mathcal {\varvec{AC}}}^\mathbf{0}$$ Leakage without Secure Hardware
Rothblum, G. N. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32009-5_32 · Cited by 41
Rao, J. R., & Sunar, B. (2005) · Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)) · doi:10.1007/11545262 · Cited by 5
Cited by
Federated learning for secure IoMT-applications in smart healthcare systems: A comprehensive review
Rani, S., Kataria, A., Kumar, S., & Tiwari, P. (2023) · Knowledge-Based Systems · doi:10.1016/j.knosys.2023.110658 · Cited by 228
Metadata
- Authors
- Prouff, E., & Rivain, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2013
- Pages
- 142-159
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W191000419
- Cited by
- 383
- References
- 51
- FWCI
- 16.70
- 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.