Title | ||
---|---|---|
Reducing Communication Complexity of Random Number Bitwise-Sharing for Efficient Multi-party Computation. |
Year | Venue | Keywords |
---|---|---|
2012 | JIP | secret sharing |
Field | DocType | Volume |
Secure multi-party computation,Secret sharing,Bitwise operation,Computer science,Theoretical computer science,Communication complexity,Homomorphic secret sharing,Distributed computing,Computation | Journal | 20 |
Issue | Citations | PageRank |
4 | 0 | 0.34 |
References | Authors | |
5 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Naoto Kiribuchi | 1 | 1 | 1.38 |
Ryo Kato | 2 | 1 | 1.72 |
Takashi Nishide | 3 | 357 | 27.86 |
Tsukasa Endo | 4 | 1 | 1.37 |
Hiroshi Yoshiura | 5 | 80 | 15.41 |