Name
Abstract | ||
|---|---|---|
Bit-decomposition is a powerful tool which can be used to design constant round protocols for bit-oriented multiparty computation (MPC) problems, such as comparison and Hamming weight computation. However, protocols that involve bit-decomposition are expensive in terms of performance. In this paper, we introduce a set of protocols for distributed exponentiation without bit-decomposition. We improve upon the current state-of-the-art by Ning and Xu [1,2], in terms of round and multiplicative complexity. We consider different cases where the inputs are either private or public and present privacy-preserving protocols for each case. Our protocols offer perfect security against passive and active adversaries and have constant multiplicative and round complexity, for any fixed number of parties. Furthermore, we showcase how these primitives can be used, for instance, to perform secure distributed decryption for some public key schemes, that are based on modular exponentiation. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/978-3-662-58387-6_16 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Round complexity,Multiplicative complexity,Multiplicative function,Computer science,Theoretical computer science,Hamming weight,Exponentiation,Public-key cryptography,Modular exponentiation,Computation,Distributed computing | Journal | 10957 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Abdelrahaman Aly | 1 | 38 | 5.76 |
| Aysajan Abidin | 2 | 26 | 7.79 |
| Svetla Nikova | 3 | 624 | 45.46 |