Ciphers for MPC and FHE. / Albrecht, Martin; Rechberger, Christian; Schneider, Thomas; Tiessen, Tyge; Zohner, Michael.

Advances in Cryptology -- EUROCRYPT 2015. ed. / Elisabeth Oswald; Marc Fischlin. Springer, 2015. p. 430-454 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Published

Standard

Ciphers for MPC and FHE. / Albrecht, Martin; Rechberger, Christian; Schneider, Thomas; Tiessen, Tyge; Zohner, Michael.

Advances in Cryptology -- EUROCRYPT 2015. ed. / Elisabeth Oswald; Marc Fischlin. Springer, 2015. p. 430-454 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Harvard

Albrecht, M, Rechberger, C, Schneider, T, Tiessen, T & Zohner, M 2015, Ciphers for MPC and FHE. in E Oswald & M Fischlin (eds), Advances in Cryptology -- EUROCRYPT 2015. Lecture Notes in Computer Science, Springer, pp. 430-454. https://doi.org/10.1007/978-3-662-46800-5_17

APA

Albrecht, M., Rechberger, C., Schneider, T., Tiessen, T., & Zohner, M. (2015). Ciphers for MPC and FHE. In E. Oswald, & M. Fischlin (Eds.), Advances in Cryptology -- EUROCRYPT 2015 (pp. 430-454). (Lecture Notes in Computer Science). Springer. https://doi.org/10.1007/978-3-662-46800-5_17

Vancouver

Albrecht M, Rechberger C, Schneider T, Tiessen T, Zohner M. Ciphers for MPC and FHE. In Oswald E, Fischlin M, editors, Advances in Cryptology -- EUROCRYPT 2015. Springer. 2015. p. 430-454. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-662-46800-5_17

Author

Albrecht, Martin ; Rechberger, Christian ; Schneider, Thomas ; Tiessen, Tyge ; Zohner, Michael. / Ciphers for MPC and FHE. Advances in Cryptology -- EUROCRYPT 2015. editor / Elisabeth Oswald ; Marc Fischlin. Springer, 2015. pp. 430-454 (Lecture Notes in Computer Science).

BibTeX

@inproceedings{48b38474ea3d44f69a87ce34b6e9e4d9,
title = "Ciphers for MPC and FHE",
abstract = "Designing an efficient cipher was always a delicate balance between linear and non-linear operations. This goes back to the design of DES, and in fact all the way back to the seminal work of Shannon. Here we focus, for the first time, on an extreme corner of the design space and initiate a study of symmetric-key primitives that minimize the multiplicative size and depth of their descriptions. This is motivated by recent progress in practical instantiations of secure multi party computation (MPC), fully homomorphic encryption (FHE), and zero knowledge proofs (ZK) where linear computations are, compared to non-linear operations, essentially “free”. We focus on the case of a block cipher, and propose the family of block ciphers “LowMC”, beating all existing proposals with respect to these metrics by far. We sketch several applications for such ciphers and give implementation comparisons suggesting that when encrypting larger amounts of data the new design strategy translates into improvements in computation and communication complexity by up to a factor of 5 compared to AES-128, which incidentally is one of the most competitive classical designs. Furthermore, we identify cases where “free XORs” can no longer be regarded as such but represent a bottleneck, hence refuting this commonly held belief with a practical example.",
author = "Martin Albrecht and Christian Rechberger and Thomas Schneider and Tyge Tiessen and Michael Zohner",
year = "2015",
month = apr,
day = "14",
doi = "10.1007/978-3-662-46800-5_17",
language = "English",
isbn = "978-3-662-46799-2",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "430--454",
editor = "Oswald, {Elisabeth } and Fischlin, {Marc }",
booktitle = "Advances in Cryptology -- EUROCRYPT 2015",

}

RIS

TY - GEN

T1 - Ciphers for MPC and FHE

AU - Albrecht, Martin

AU - Rechberger, Christian

AU - Schneider, Thomas

AU - Tiessen, Tyge

AU - Zohner, Michael

PY - 2015/4/14

Y1 - 2015/4/14

N2 - Designing an efficient cipher was always a delicate balance between linear and non-linear operations. This goes back to the design of DES, and in fact all the way back to the seminal work of Shannon. Here we focus, for the first time, on an extreme corner of the design space and initiate a study of symmetric-key primitives that minimize the multiplicative size and depth of their descriptions. This is motivated by recent progress in practical instantiations of secure multi party computation (MPC), fully homomorphic encryption (FHE), and zero knowledge proofs (ZK) where linear computations are, compared to non-linear operations, essentially “free”. We focus on the case of a block cipher, and propose the family of block ciphers “LowMC”, beating all existing proposals with respect to these metrics by far. We sketch several applications for such ciphers and give implementation comparisons suggesting that when encrypting larger amounts of data the new design strategy translates into improvements in computation and communication complexity by up to a factor of 5 compared to AES-128, which incidentally is one of the most competitive classical designs. Furthermore, we identify cases where “free XORs” can no longer be regarded as such but represent a bottleneck, hence refuting this commonly held belief with a practical example.

AB - Designing an efficient cipher was always a delicate balance between linear and non-linear operations. This goes back to the design of DES, and in fact all the way back to the seminal work of Shannon. Here we focus, for the first time, on an extreme corner of the design space and initiate a study of symmetric-key primitives that minimize the multiplicative size and depth of their descriptions. This is motivated by recent progress in practical instantiations of secure multi party computation (MPC), fully homomorphic encryption (FHE), and zero knowledge proofs (ZK) where linear computations are, compared to non-linear operations, essentially “free”. We focus on the case of a block cipher, and propose the family of block ciphers “LowMC”, beating all existing proposals with respect to these metrics by far. We sketch several applications for such ciphers and give implementation comparisons suggesting that when encrypting larger amounts of data the new design strategy translates into improvements in computation and communication complexity by up to a factor of 5 compared to AES-128, which incidentally is one of the most competitive classical designs. Furthermore, we identify cases where “free XORs” can no longer be regarded as such but represent a bottleneck, hence refuting this commonly held belief with a practical example.

U2 - 10.1007/978-3-662-46800-5_17

DO - 10.1007/978-3-662-46800-5_17

M3 - Conference contribution

SN - 978-3-662-46799-2

T3 - Lecture Notes in Computer Science

SP - 430

EP - 454

BT - Advances in Cryptology -- EUROCRYPT 2015

A2 - Oswald, Elisabeth

A2 - Fischlin, Marc

PB - Springer

ER -