[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
rapid-communication

On robust strong‐non‐interferent low‐latency multiplications

Published: 24 November 2021 Publication History

Abstract

The overarching goal of this work is to present new theoretical and practical tools to implement robust−t−probing security. In this work, a low‐latency multiplication gadget that is secure against probing attacks that exploit logic glitches in the circuit is presented. The gadget is the first of its kind to present a 1‐cycle input‐to‐output latency while belonging to the class of probing security by optimized composition gadgets [6]. In particular, the authors show that it is possible to construct robust‐t‐strong‐non‐interferent gadgets without compromising on latency with a moderate increase in area. The authors provide a theoretical proof for the robustness of the gadget and show that, for t≤4, the amount of randomness required can even be reduced without compromising on robustness.

References

[1]
Chari, S., et al.: Towards sound approaches to counteract power‐analysis attacks. In: Wiener, M. (ed.) Advances in Cryptology — CRYPTO ’99. Lecture Notes in Computer Science, pp. 398–412. Springer, Berlin (1999)
[2]
Ishai, Y., Sahai, A., Wagner, D.: Private circuits: securing hardware against probing attacks. In: Boneh, D. (ed.) Advances in Cryptology — CRYPTO 2003. Lecture Notes in Computer Science, pp. 463–481. Springer, Berlin (2003)
[3]
Faust, S., et al.: Composable masking schemes in the presence of physical defaults: the robust probing model. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2018(3), 89–120 (2018)
[4]
Meyer, L.D., Bilgin, B., Reparaz, O.: Consolidating security notions in hardware masking. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2019(3), 119–147 (2019)
[5]
Coron, J.S.: Higher order masking of look‐up tables. In: Nguyen, P.Q., Oswald, E. (eds.) Advances in Cryptology — EUROCRYPT 2014. Lecture Notes in Computer Science, pp. 441–458. Springer, Berlin (2014)
[6]
Cassiers, G., et al.: Hardware private circuits: from trivial composition to full verification. IEEE Trans. Comput. (2020). https://doi.org/10.1109/TC.2020.3022979
[7]
Barthe, G., et al.: Strong non‐interference and type‐directed higher‐order masking. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. CCS ’16, pp. 116–129. ACM, New York (2016)
[8]
Bloem, R., et al.: Formal verification of masked hardware implementations in the presence of glitches. In: Nielsen, J.B., Rijmen, V. (eds.) Advances in Cryptology — EUROCRYPT 2018. Lecture Notes in Computer Science, pp. 321–353. Springer International Publishing (2018)
[9]
Belaïd, S., Goudarzi, D., Rivain, M.: Tight private circuits: achieving probing security with the least refreshing. In: Peyrin, T., Galbraith, S., (eds.) ASIACRYPT (2). vol. 11273 of Lecture Notes in Computer Science, pp. 343–372. Springer, Switzerland (2018)
[10]
Moos, T., et al.: Glitch‐resistant masking revisited: or why proofs in the robust probing model are needed. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2019(2), 256–292 (2019)
[11]
Nikova, S., Rijmen, V., Schläffer, M.: Secure hardware implementation of nonlinear functions in the presence of glitches. J. Cryptol. 24(2), 292–321 (2011)
[12]
Cassiers, G., Standaert, F.X.: Trivially and efficiently composing masked gadgets with probe isolating non‐interference. IEEE Trans. Inf. Forensics Secur. 15, 2542–2555 (2020)
[13]
Barthe, G., et al.: maskVerif: automated verification of higher‐order masking in presence of physical defaults. In: Sako, K., Schneider, S., Ryan, P.Y.A. (eds.) ESORICS (1). vol. 11735 of Lecture Notes in Computer Science, pp. 300–318. Springer, Switzerland (2019)
[14]
Bertoni, G., Martinoli, M., Molteni, M.C.: A methodology for the characterisation of leakages in combinatorial logic. J. Hardw. Syst. Secur. 1(3), 269–281 (2017)
[15]
Reparaz, O., et al.: Consolidating masking schemes. In: Gennaro, R., Robshaw, M. (eds.) Advances in Cryptology — CRYPTO 2015, vol. 9215, pp. 764–783. Springer, Berlin (2015)
[16]
Gross, H., Mangard, S., Korak, T.: An efficient side‐channel protected aes implementation with arbitrary protection order. In: Handschuh, H. (ed.) Topics in Cryptology – CT‐RSA 2017. Lecture Notes in Computer Science, pp. 95–112. Springer International Publishing, Switzerland (2017)
[17]
Gross, H., Mangard, S.: A unified masking approach. J. Cryptogr. Eng. 8(2), 109–124 (2018)
[18]
Belaïd, S., et al.: Randomness complexity of private circuits for multiplication. In: FischlinJean, M., Coron, J.S., (eds.) EUROCRYPT (2). vol. 9666 of Lecture Notes in Computer Science, pp. 616–648. Springer, Switzerland (2016)
[19]
Molteni, M.C., Zaccaria, V.: On the spectral features of robust probing security. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2020, 24–48 (2020)
[20]
Groß, H., Mangard, S., Korak, T.: Domain‐oriented masking: compact masked hardware implementations with arbitrary protection order. In: Bilgin, B., Nikova, S., Rijmen, V. (eds.) Proceedings of the ACM Workshop on Theory of Implementation Security, TIS@CCS 2016, p. 3. ACM, Vienna, October 2016

Cited By

View all
  • (2022)Low-Latency Hardware Private CircuitsProceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security10.1145/3548606.3559362(1799-1812)Online publication date: 7-Nov-2022

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IET Information Security
IET Information Security  Volume 16, Issue 2
March 2022
69 pages
EISSN:1751-8717
DOI:10.1049/ise2.v16.2
Issue’s Table of Contents
This is an open access article under the terms of the Creative Commons Attribution‐NonCommercial‐NoDerivs License, which permits use and distribution in any medium, provided the original work is properly cited, the use is non‐commercial and no modifications or adaptations are made.

Publisher

John Wiley & Sons, Inc.

United States

Publication History

Published: 24 November 2021

Author Tags

  1. cryptography
  2. security

Qualifiers

  • Rapid-communication

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 03 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2022)Low-Latency Hardware Private CircuitsProceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security10.1145/3548606.3559362(1799-1812)Online publication date: 7-Nov-2022

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media