Name
Abstract | ||
|---|---|---|
Secure multi-party computation (SMPC) is a cryptographic tool that enables a set of parties to jointly compute any function of their inputs while keeping the privacy of inputs. The paper \"High Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority\" in this ACM CCS 2016 [4] presents a new protocol which its implementation carried out over 1,300,000 AESs per second and was able to support 35,000 login queries of Kerberos authentication per second. This poster/demo presents the design of the implementation and demonstrates the Kerberos authentication over here. The design will show how this high-throughput three-party computation can be done using simple servers. The demonstration proves that secure multiparty computation of Kerberos authentications in large organizations is now practical. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1145/2976749.2989035 | ACM Conference on Computer and Communications Security |
Field | DocType | Citations |
Secure multi-party computation,Internet privacy,Computer security,Computer science,Cryptography,Server,Login,Kerberos,Generic Security Service Algorithm for Secret Key Transaction,Throughput,Secure two-party computation | Conference | 1 |
PageRank | References | Authors |
0.36 | 4 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Toshinori Araki | 1 | 59 | 3.62 |
| Assaf Barak | 2 | 1 | 0.36 |
| Jun Furukawa | 3 | 357 | 18.35 |
| Yehuda Lindell | 4 | 4194 | 215.46 |
| Ariel Nof | 5 | 93 | 6.24 |
| Kazuma Ohara | 6 | 74 | 5.34 |