Article

Additively Homomorphic Ring-LWE Masking

Authors:

Sujoy Sinha Roy,

Frederik Vercauteren,

Ingrid VerbauwhedeAuthors Info & Claims

PQCrypto 2016: Proceedings of the 7th International Workshop on Post-Quantum Cryptography - Volume 9606

Pages 233 - 244

https://doi.org/10.1007/978-3-319-29360-8_15

Published: 24 February 2016 Publication History

Abstract

In this paper, we present a new masking scheme for ring-LWE decryption. Our scheme exploits the additively-homomorphic property of the existing ring-LWE encryption schemes and computes an additive-mask as an encryption of a random message. Our solution differs in several aspects from the recent masked ring-LWE implementation by Reparaz et al. presented at CHESï ź2015; most notably we do not require a masked decoder but work with a conventional, unmasked decoder. As such, we can secure a ring-LWE implementation using additive masking with minimal changes. Our masking scheme is also very generic in the sense that it can be applied to other additively-homomorphic encryption schemes.

References

[1]

Aysu, A., Patterson, C., Schaumont, P.: Low-cost and area-efficient FPGA implementations of lattice-based cryptography. In: 2013 IEEE International Symposium on Hardware-Oriented Security and Trust HOST, pp. 81---86 2013

[2]

Brier, E., Clavier, C., Olivier, F.: Correlation power analysis with a leakage model. In: Joye, M., Quisquater, J.-J. eds. CHES 2004. LNCS, vol. 3156, pp. 16---29. Springer, Heidelberg 2004

[3]

Bos, J.W., Lauter, K., Loftus, J., Naehrig, M.: Improved security for a ring-based fully homomorphic encryption scheme, Cryptology ePrint Archive, Report 2013/075 2013. http://eprint.iacr.org/

Digital Library

[4]

Boorghany, A., Sarmadi, S.B., Jalili, R.: On constrained implementation of lattice-based cryptographic primitives and schemes on smart cards. ACM Trans. Embed. Comput. Syst. 143, 42 2015

Digital Library

[5]

Chari, S., Jutla, C.S., Rao, J.R., Rohatgi, P.: Towards sound approaches to counteract power-analysis attacks. In: Wiener, M. ed. CRYPTO 1999. LNCS, vol. 1666, pp. 398---412. Springer, Heidelberg 1999

Digital Library

[6]

de Clercq, R., Roy, S.S., Vercauteren, F., Verbauwhede, I.: Efficient software implementation of ring-lwe encryption. In: Nebel, W., Atienza, D. ed. Proceedings of the 2015 Design, Automation & Test in Europe Conference & Exhibition, Grenoble, France, 9---13 March 2015, pp. 339---344. ACM 2015

Digital Library

[7]

Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption, Cryptology ePrint Archive, Report 2012/144 2012. http://www.eprint.iacr.org/

[8]

Göttert, N., Feller, T., Schneider, M., Buchmann, J., Huss, S.: On the design of hardware building blocks for modern lattice-based encryption schemes. In: Prouff, E., Schaumont, P. eds. CHES 2012. LNCS, vol. 7428, pp. 512---529. Springer, Heidelberg 2012

Digital Library

[9]

Güneysu, T., Oder, T., Pöppelmann, T., Schwabe, P.: Software speed records for lattice-based signatures. In: Gaborit, P. ed. PQCrypto 2013. LNCS, vol. 7932, pp. 67---82. Springer, Heidelberg 2013

[10]

Goubin, L., Patarin, J.: DES and differential power analysis. In: Koç, Ç.K., Paar, C. eds. CHES 1999. LNCS, vol. 1717, pp. 158---172. Springer, Heidelberg 1999

Digital Library

[11]

Golic, J.D., Tymen, T.: Multiplicative masking and power analysis of AES, cryptographic hardware and embedded systems - CHES 2002. In: Kaliski Jr, Burton S., Koç, Çetin Kaya, Paar, Christof eds. CHES 2002. LNCS, vol. 2523, pp. 198---212. Springer, Heidelberg 2002

Digital Library

[12]

Kocher, P.C., Jaffe, J., Jun, B.: Differential Power Analysis. In: Wiener, M. ed. CRYPTO 1999. LNCS, vol. 1666, pp. 388---397. Springer, Heidelberg 1999

Digital Library

[13]

Kocher, P.C.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In: Koblitz, N. ed. CRYPTO 1996. LNCS, vol. 1109, pp. 104---113. Springer, Heidelberg 1996

Digital Library

[14]

Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. ed. EUROCRYPT 2010. LNCS, vol. 6110, pp. 1---23. Springer, Heidelberg 2010

Digital Library

[15]

Liu, Z., Seo, H., Roy, S.S. Groβschädl, J., Kim, H., Verbauwhede, I.: Efficient ring-lwe encryption on 8-bit avr processors, Cryptology ePrint Archive, Report 2015/410 2015. http://eprint.iacr.org/

[16]

Cryptography today, Last Modified on 19, Aug 2015. https://www.nsa.gov/ia/programs/suiteb_cryptography/index.shtml

[17]

Pöppelmann, T., Ducas, L., Güneysu, T.: Enhanced lattice-based signatures on reconfigurable hardware. In: Batina, L., Robshaw, M. eds. CHES 2014. LNCS, vol. 8731, pp. 353---370. Springer, Heidelberg 2014

Digital Library

[18]

Pöppelmann, T., Güneysu, T.: Towards practical lattice-based public-key encryption on reconfigurable hardware. In: Lange, T., Lauter, K., Lisonĕk, P. eds. SAC 2013. LNCS, vol. 8282, pp. 68---86. Springer, Heidelberg 2014

[19]

Pöppelmann, T., Oder, T., Güneys, T.: High-performance ideal lattice-based cryptography on 8-bit atxmega microcontrollers, Cryptology ePrint Archive, Report 2015/382 2015. http://eprint.iacr.org/

Digital Library

[20]

Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the Thirty-seventh Annual ACM Symposium on Theory of Computing, New York, NY, USA, STOC 2005, pp. 84---93. ACM 2005

Digital Library

[21]

Reparaz, O., Roy, S.S., Vercauteren, F., Verbauwhede, I.: A masked ring-LWE implementation. In: Güneysu, T., Handschuh, H. eds. CHES 2015. LNCS, vol. 9293, pp. 683---702. Springer, Heidelberg 2015

[22]

Roy, S.S., Vercauteren, F., Mentens, N., Chen, D.D., Verbauwhede, I.: Compact ring-LWE cryptoprocessor. In: Batina, L., Robshaw, M. eds. CHES 2014. LNCS, vol. 8731, pp. 371---391. Springer, Heidelberg 2014

Digital Library

[23]

Roy, S.S., Vercauteren, F., Verbauwhede, I.: High precision discrete gaussian sampling on FPGAs. In: Lange, T., Lauter, K., Lisonĕk, P. eds. SAC 2013. LNCS, vol. 8282, pp. 383---401. Springer, Heidelberg 2014

[24]

Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Review. 41, 303---332 1999

Digital Library

Cited By

Bock EBanegas GBrzuska CChmielewski ŁPuniamurthy KŠorf M(2024)Breaking DPA-Protected Kyber via the Pair-Pointwise MultiplicationApplied Cryptography and Network Security10.1007/978-3-031-54773-7_5(101-130)Online publication date: 5-Mar-2024
https://dl.acm.org/doi/10.1007/978-3-031-54773-7_5
Dubey ACammarota RSuresh VAysu A(2022)Guarding Machine Learning Hardware Against Physical Side-channel AttacksACM Journal on Emerging Technologies in Computing Systems10.1145/346537718:3(1-31)Online publication date: 28-Apr-2022
https://dl.acm.org/doi/10.1145/3465377
Kazmi RLe DMinwalla C(2022)Privacy-Preserving Post-quantum Credentials for Digital PaymentsFinancial Cryptography and Data Security. FC 2022 International Workshops10.1007/978-3-031-32415-4_10(118-137)Online publication date: 6-May-2022
https://dl.acm.org/doi/10.1007/978-3-031-32415-4_10
Show More Cited By

Additively Homomorphic Ring-LWE Masking

Recommendations

Efficient Linear Homomorphic Encryption from LWE Over Rings

As the basis for secure public-key encryption under various cases, the learning with errors (LWE) problem has proved to be versatile for encryption schemes. Unfortunately, it tends not to be efficient enough for practical applications. For improving the ...
Efficient Homomorphic Conversion Between (Ring) LWE Ciphertexts
Applied Cryptography and Network Security
Abstract
In the past few years, significant progress on homomorphic encryption (HE) has been made toward both theory and practice. The most promising HE schemes are based on the hardness of the Learning With Errors (LWE) problem or its ring variant (RLWE). ...
Fully homomorphic encryption from ring-LWE and security for key dependent messages
CRYPTO'11: Proceedings of the 31st annual conference on Advances in cryptology

We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security (quantumly) reduces to the worst-case hardness of problems on ideal lattices. We then transform it into a fully homomorphic ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

PQCrypto 2016: Proceedings of the 7th International Workshop on Post-Quantum Cryptography - Volume 9606

February 2016

265 pages

ISBN:9783319293592

Editor:
Tsuyoshi Takagi
Kyushu University, Fukuoka, Japan

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 24 February 2016

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Bock EBanegas GBrzuska CChmielewski ŁPuniamurthy KŠorf M(2024)Breaking DPA-Protected Kyber via the Pair-Pointwise MultiplicationApplied Cryptography and Network Security10.1007/978-3-031-54773-7_5(101-130)Online publication date: 5-Mar-2024
https://dl.acm.org/doi/10.1007/978-3-031-54773-7_5
Dubey ACammarota RSuresh VAysu A(2022)Guarding Machine Learning Hardware Against Physical Side-channel AttacksACM Journal on Emerging Technologies in Computing Systems10.1145/346537718:3(1-31)Online publication date: 28-Apr-2022
https://dl.acm.org/doi/10.1145/3465377
Kazmi RLe DMinwalla C(2022)Privacy-Preserving Post-quantum Credentials for Digital PaymentsFinancial Cryptography and Data Security. FC 2022 International Workshops10.1007/978-3-031-32415-4_10(118-137)Online publication date: 6-May-2022
https://dl.acm.org/doi/10.1007/978-3-031-32415-4_10
Aydin FAysu ATiwari MGerstlauer AOrshansky M(2021)Horizontal Side-Channel Vulnerabilities of Post-Quantum Key Exchange and Encapsulation ProtocolsACM Transactions on Embedded Computing Systems10.1145/347679920:6(1-22)Online publication date: 18-Oct-2021
https://dl.acm.org/doi/10.1145/3476799
Ngo KDubrova EJohansson THong Chang CRührmair UKatzenbeisser SMukhopadhyay D(2021)Breaking Masked and Shuffled CCA Secure Saber KEM by Power AnalysisProceedings of the 5th Workshop on Attacks and Solutions in Hardware Security10.1145/3474376.3487277(51-61)Online publication date: 19-Nov-2021
https://dl.acm.org/doi/10.1145/3474376.3487277
Ravi PHowe JChattopadhyay ABhasin S(2021)Lattice-based Key-sharing SchemesACM Computing Surveys10.1145/342217854:1(1-39)Online publication date: 2-Jan-2021
https://dl.acm.org/doi/10.1145/3422178
Steffen HKogelheide LBartkewitz T(2021)In-depth Analysis of Side-Channel Countermeasures for CRYSTALS-Kyber Message Encoding on ARM Cortex-M4Smart Card Research and Advanced Applications10.1007/978-3-030-97348-3_10(169-188)Online publication date: 11-Nov-2021
https://dl.acm.org/doi/10.1007/978-3-030-97348-3_10
Greuet AMontoya SRenault G(2021)On Using RSA/ECC Coprocessor for Ideal Lattice-Based Key ExchangeConstructive Side-Channel Analysis and Secure Design10.1007/978-3-030-89915-8_10(205-227)Online publication date: 25-Oct-2021
https://dl.acm.org/doi/10.1007/978-3-030-89915-8_10
Pessl PPrimas R(2019)More Practical Single-Trace Attacks on the Number Theoretic TransformProgress in Cryptology – LATINCRYPT 201910.1007/978-3-030-30530-7_7(130-149)Online publication date: 2-Oct-2019
https://dl.acm.org/doi/10.1007/978-3-030-30530-7_7
Regazzoni FFowler APolian IMudge TPnevmatikatos D(2018)Quantum era challenges for classical computersProceedings of the 18th International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation10.1145/3229631.3264737(173-178)Online publication date: 15-Jul-2018
https://dl.acm.org/doi/10.1145/3229631.3264737
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Table of Contents