Efficient Information-Theoretic Secure Multiparty Computation over Z/p^k Z via Galois Rings

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

Standard

Efficient Information-Theoretic Secure Multiparty Computation over Z/p^k Z via Galois Rings. / Abspoel, Mark; Cramer, Ronald; Damgård, Ivan Bjerre; Escudero Ospina, Daniel Esteban; Yuan, Chen.

Theory of Cryptography: Proceedings. ed. / Dennis Hofheinz; Alon Rosen. Vol. Part 1 Cham : Springer, 2019. p. 471-501 (Lecture Notes in Computer Science, Vol. 11891).

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

Harvard

Abspoel, M, Cramer, R, Damgård, IB, Escudero Ospina, DE & Yuan, C 2019, Efficient Information-Theoretic Secure Multiparty Computation over Z/p^k Z via Galois Rings. in D Hofheinz & A Rosen (eds), Theory of Cryptography: Proceedings. vol. Part 1, Springer, Cham, Lecture Notes in Computer Science, vol. 11891, pp. 471-501, Theory of Cryptography Conference, 17th International Conference, Nurnberg, Germany, 01/12/2019. https://doi.org/10.1007/978-3-030-36030-6_19

APA

Abspoel, M., Cramer, R., Damgård, I. B., Escudero Ospina, D. E., & Yuan, C. (2019). Efficient Information-Theoretic Secure Multiparty Computation over Z/p^k Z via Galois Rings. In D. Hofheinz, & A. Rosen (Eds.), Theory of Cryptography: Proceedings (Vol. Part 1, pp. 471-501). Springer. Lecture Notes in Computer Science Vol. 11891 https://doi.org/10.1007/978-3-030-36030-6_19

CBE

Abspoel M, Cramer R, Damgård IB, Escudero Ospina DE, Yuan C. 2019. Efficient Information-Theoretic Secure Multiparty Computation over Z/p^k Z via Galois Rings. Hofheinz D, Rosen A, editors. In Theory of Cryptography: Proceedings. Cham: Springer. pp. 471-501. (Lecture Notes in Computer Science, Vol. 11891). https://doi.org/10.1007/978-3-030-36030-6_19

MLA

Abspoel, Mark et al. "Efficient Information-Theoretic Secure Multiparty Computation over Z/p^k Z via Galois Rings". and Hofheinz, Dennis Rosen, Alon (editors). Theory of Cryptography: Proceedings. Cham: Springer. (Lecture Notes in Computer Science, Vol. 11891). 2019, 471-501. https://doi.org/10.1007/978-3-030-36030-6_19

Vancouver

Abspoel M, Cramer R, Damgård IB, Escudero Ospina DE, Yuan C. Efficient Information-Theoretic Secure Multiparty Computation over Z/p^k Z via Galois Rings. In Hofheinz D, Rosen A, editors, Theory of Cryptography: Proceedings. Vol. Part 1. Cham: Springer. 2019. p. 471-501. (Lecture Notes in Computer Science, Vol. 11891). https://doi.org/10.1007/978-3-030-36030-6_19

Author

Abspoel, Mark ; Cramer, Ronald ; Damgård, Ivan Bjerre ; Escudero Ospina, Daniel Esteban ; Yuan, Chen. / Efficient Information-Theoretic Secure Multiparty Computation over Z/p^k Z via Galois Rings. Theory of Cryptography: Proceedings. editor / Dennis Hofheinz ; Alon Rosen. Vol. Part 1 Cham : Springer, 2019. pp. 471-501 (Lecture Notes in Computer Science, Vol. 11891).

Bibtex

@inproceedings{75cca9351043429291c081eb95fa569b,
title = "Efficient Information-Theoretic Secure Multiparty Computation over Z/p^k Z via Galois Rings",
abstract = "At CRYPTO 2018, Cramer et al. introduced a secret-sharing based protocol called SPDZ2k that allows for secure multiparty computation (MPC) in the dishonest majority setting over the ring of integers modulo 2^k, thus solving a long-standing open question in MPC about secure computation over rings in this setting.In this paper we study this problem in the information-theoretic scenario.More specifically, we ask the following question: Can we obtain information-theoretic MPC protocols that work over rings with comparable efficiency to corresponding protocols over fields?We answer this question in the affirmative by presenting an efficient protocol for robust Secure Multiparty Computation over Z/p^k Z (for any prime p and positive integer k) that is perfectly secure against active adversaries corrupting a fraction of at most 1/3 players, and a robust protocol that is statistically secure against an active adversary corrupting a fraction of at most 1/2 players.",
author = "Mark Abspoel and Ronald Cramer and Damg{\aa}rd, {Ivan Bjerre} and {Escudero Ospina}, {Daniel Esteban} and Chen Yuan",
year = "2019",
doi = "10.1007/978-3-030-36030-6_19",
language = "English",
isbn = "978-3-030-36029-0",
volume = "Part 1",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "471--501",
editor = "Dennis Hofheinz and Alon Rosen",
booktitle = "Theory of Cryptography",
note = "Theory of Cryptography Conference, 17th International Conference : TCC 2019 ; Conference date: 01-12-2019 Through 05-12-2019",

}

RIS

TY - GEN

T1 - Efficient Information-Theoretic Secure Multiparty Computation over Z/p^k Z via Galois Rings

AU - Abspoel, Mark

AU - Cramer, Ronald

AU - Damgård, Ivan Bjerre

AU - Escudero Ospina, Daniel Esteban

AU - Yuan, Chen

N1 - Conference code: 17

PY - 2019

Y1 - 2019

N2 - At CRYPTO 2018, Cramer et al. introduced a secret-sharing based protocol called SPDZ2k that allows for secure multiparty computation (MPC) in the dishonest majority setting over the ring of integers modulo 2^k, thus solving a long-standing open question in MPC about secure computation over rings in this setting.In this paper we study this problem in the information-theoretic scenario.More specifically, we ask the following question: Can we obtain information-theoretic MPC protocols that work over rings with comparable efficiency to corresponding protocols over fields?We answer this question in the affirmative by presenting an efficient protocol for robust Secure Multiparty Computation over Z/p^k Z (for any prime p and positive integer k) that is perfectly secure against active adversaries corrupting a fraction of at most 1/3 players, and a robust protocol that is statistically secure against an active adversary corrupting a fraction of at most 1/2 players.

AB - At CRYPTO 2018, Cramer et al. introduced a secret-sharing based protocol called SPDZ2k that allows for secure multiparty computation (MPC) in the dishonest majority setting over the ring of integers modulo 2^k, thus solving a long-standing open question in MPC about secure computation over rings in this setting.In this paper we study this problem in the information-theoretic scenario.More specifically, we ask the following question: Can we obtain information-theoretic MPC protocols that work over rings with comparable efficiency to corresponding protocols over fields?We answer this question in the affirmative by presenting an efficient protocol for robust Secure Multiparty Computation over Z/p^k Z (for any prime p and positive integer k) that is perfectly secure against active adversaries corrupting a fraction of at most 1/3 players, and a robust protocol that is statistically secure against an active adversary corrupting a fraction of at most 1/2 players.

U2 - 10.1007/978-3-030-36030-6_19

DO - 10.1007/978-3-030-36030-6_19

M3 - Article in proceedings

SN - 978-3-030-36029-0

VL - Part 1

T3 - Lecture Notes in Computer Science

SP - 471

EP - 501

BT - Theory of Cryptography

A2 - Hofheinz, Dennis

A2 - Rosen, Alon

PB - Springer

CY - Cham

T2 - Theory of Cryptography Conference, 17th International Conference

Y2 - 1 December 2019 through 5 December 2019

ER -