TY - GEN
T1 - One-Round Secure Multiparty Computation of Arithmetic Streams and Functions
T2 - 2nd International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2018
AU - Bitan, Dor
AU - Dolev, Shlomi
N1 - Funding Information:
The research was partially supported by the Rita Altura Trust Chair in Computer Sciences; the Lynne and William Frankel Center for Computer Science; the Ministry of Foreign Affairs, Italy; the grant from the Ministry of Science, Technology and Space, Israel, and the National Science Council (NSC) of Taiwan; the Ministry of Science, Technology and Space, Infrastructure Research in the Field of Advanced Computing and Cyber Security; and the Israel National Cyber Bureau.
Publisher Copyright:
© 2018, Springer International Publishing AG, part of Springer Nature.
PY - 2018/6/17
Y1 - 2018/6/17
N2 - Efficient secure multiparty computation (SMPC) schemes over secret shares are presented. We consider scenarios in which the secrets are elements of a finite field, Fp, and are held and shared by a single participant, the user. Evaluation of any function (formula presented) is implemented in one round of communication by representing f as a multivariate polynomial. Our schemes are based on partitioning secrets to sums or products of random elements of the field. Secrets are shared using either (multiplicative) shares whose product is the secret or (additive) shares that sum upto the secret. Sequences of additions of secrets are implemented locally by addition of local shares, requiring no communication among participants, and so does sequences of multiplications of secrets. The shift to handle a sequence of additions from the execution of multiplications or vice versa is efficiently handled as well with no need to decrypt the secrets in the course of the computation. On each shift from multiplications to additions or vice versa, the current set of participants is eliminated, and a new set of participants becomes active. Assuming no coalitions among the active participants and the previously eliminated participants are possible, our schemes are information-theoretically secure with a threshold of all active participants. Our schemes can also be used to support SMPC of boolean circuits.
AB - Efficient secure multiparty computation (SMPC) schemes over secret shares are presented. We consider scenarios in which the secrets are elements of a finite field, Fp, and are held and shared by a single participant, the user. Evaluation of any function (formula presented) is implemented in one round of communication by representing f as a multivariate polynomial. Our schemes are based on partitioning secrets to sums or products of random elements of the field. Secrets are shared using either (multiplicative) shares whose product is the secret or (additive) shares that sum upto the secret. Sequences of additions of secrets are implemented locally by addition of local shares, requiring no communication among participants, and so does sequences of multiplications of secrets. The shift to handle a sequence of additions from the execution of multiplications or vice versa is efficiently handled as well with no need to decrypt the secrets in the course of the computation. On each shift from multiplications to additions or vice versa, the current set of participants is eliminated, and a new set of participants becomes active. Assuming no coalitions among the active participants and the previously eliminated participants are possible, our schemes are information-theoretically secure with a threshold of all active participants. Our schemes can also be used to support SMPC of boolean circuits.
UR - http://www.scopus.com/inward/record.url?scp=85049009753&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-94147-9_20
DO - 10.1007/978-3-319-94147-9_20
M3 - Conference contribution
AN - SCOPUS:85049009753
SN - 9783319941462
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 255
EP - 273
BT - Cyber Security Cryptography and Machine Learning - Second International Symposium, CSCML 2018, Proceedings
A2 - Dinur, Itai
A2 - Dolev, Shlomi
A2 - Lodha, Sachin
PB - Springer Verlag
Y2 - 21 June 2018 through 22 June 2018
ER -