Protecting AES with Shamir's secret sharing scheme

DOI10.1007/978-3-642-23951-9_6zbMATH Open1401.94156OpenAlexW57414702WikidataQ27996667 ScholiaQ27996667MaRDI QIDQ3172966FDOQ3172966

Authors: Louis Goubin, Ange Martinelli 

Publication date: 7 October 2011

Published in: Cryptographic hardware and embedded systems -- CHES 2011. 13th international workshop, Nara, Japan, September 28--October 1, 2011. Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23951-9_6

Recommendations

• High-order masking by using coding theory and its application to AES
• Provably secure higher-order masking of AES
• Secure multiplicative masking of power functions
• Affine Masking against Higher-Order Side Channel Analysis
• Montgomery’s Trick and Fast Implementation of Masked AES

zbMATH Keywords

maskingmulti-party computationShamir's secret sharingSide Channel Analysis (SCA)AES implementation

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cited In (5)

• Combined fault and leakage resilience: composability, constructions and compiler
• Masking AES with \(d+1\) shares in hardware
• Polynomial Evaluation and Side Channel Analysis
• Title not available (Why is that?)
• Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version

This page was built for publication: Protecting AES with Shamir's secret sharing scheme

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172966)