EDBT 2026 Demo / reviewers in the wild / expert
Assaf Barak
dblp:187/8972
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2016
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
1 paper |
Cryptographic protocols and secure computation · 88% Authentication and access control · 12% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation
secure multiparty computation |
0.2 | 1 | 2016 | DEMO: High-Throughput Secure Three-Party Computation of Kerberos Ticket Generation · CCS 2016 |
Cryptographic protocols and secure computation › secure multiparty computation
three-party computation |
0.2 | 1 | 2016 | DEMO: High-Throughput Secure Three-Party Computation of Kerberos Ticket Generation · CCS 2016 |
Authentication and access control
kerberos authentication |
0.1 | 1 | 2016 | DEMO: High-Throughput Secure Three-Party Computation of Kerberos Ticket Generation · CCS 2016 |
Methods — techniques the papers use, named apart from their topics
honest-majority MPC · 0.2AES · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | DEMO: High-Throughput Secure Three-Party Computation of Kerberos Ticket GenerationabstractSecure 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. Toshinori Araki, Assaf Barak, Jun Furukawa 0001, Yehuda Lindell, Ariel Nof, Kazuma Ohara |
CCS | 2 |