Demo Data from SIGIR 2026 / reviewers in the wild / expert
Bar Alon 0001
dblp:187/5662
· DBLP profile ↗
16ranked-venue papers
16as first author
13since 2021 · last 2026
0000-0002-8392-0245ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 14 · 14 first-author · 11 since 2021Theory of computation · 8 · 8 first-author · 6 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021
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
6 papers |
Cryptographic protocols and secure computation · 100% | |
| Artificial intelligence
1 paper |
Trustworthy machine learning · 100% | |
| Theoretical computer science
1 paper |
Quantum computing and quantum information · 100% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation
secure multiparty computation |
1.9 | 3 | 2024 | MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably · CRYPTO (8) 2024 On the Power of an Honest Majority in Three-Party Computation Without Broadcast · J. Cryptol. 2023 MPC with Friends and Foes · CRYPTO (2) 2020 |
Machine learning › Trustworthy machine learning › interpretability › explanation evaluation
explanation faithfulness |
1.0 | 1 | 2026 | Faithful Serum: Mitigating the Faithfulness Gap in Textual Explanations of LLM Decisions via Attribution Guidance · ACL (1) 2026 |
Machine learning › Trustworthy machine learning
interpretability |
1.0 | 1 | 2026 | Faithful Serum: Mitigating the Faithfulness Gap in Textual Explanations of LLM Decisions via Attribution Guidance · ACL (1) 2026 |
Machine learning › Trustworthy machine learning › language model interpretability
large language model explanation |
1.0 | 1 | 2026 | Faithful Serum: Mitigating the Faithfulness Gap in Textual Explanations of LLM Decisions via Attribution Guidance · ACL (1) 2026 |
Cryptographic protocols and secure computation › secure multiparty computation
large-scale MPC |
0.8 | 1 | 2024 | MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably · CRYPTO (8) 2024 |
Cryptographic protocols and secure computation › coin flipping
multiparty coin tossing |
0.7 | 1 | 2023 | Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious · J. Cryptol. 2023 |
Cryptographic protocols and secure computation › secure multiparty computation › active security
identifiable abort |
0.5 | 1 | 2021 | Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort · CRYPTO (1) 2021 |
Cryptographic protocols and secure computation › secure multiparty computation
quantum multiparty computation |
0.5 | 1 | 2021 | Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort · CRYPTO (1) 2021 |
Quantum computing and quantum information
quantum cryptography |
0.5 | 1 | 2021 | Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort · CRYPTO (1) 2021 |
Methods — techniques the papers use, named apart from their topics
token-level heatmap attribution · 1.0round-efficient protocol · 1.0identifiable abort · 1.0counterfactual evaluation · 1.0attention-level intervention · 1.0secret sharing · 0.8protocol design · 0.8garbled circuits · 0.8MPC protocol design · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Faithful Serum: Mitigating the Faithfulness Gap in Textual Explanations of LLM Decisions via Attribution GuidanceabstractLarge language models (LLMs) achieve strong performance and have revolutionized NLP, but their lack of explainability keeps them treated as black boxes, limiting their use in domains that demand transparency and trust.A promising direction to address this issue is post-hoc text-based explanations, which aim to explain model decisions in natural language.Prior work has focused on generating convincing rationales that appear to be subjectively faithful, but it remains unclear whether these explanations are epistemically faithful, whether they reflect the internal evidence the model actually relied on for its decision.In this paper, we first assess the epistemic faithfulness of LLMgenerated explanations via counterfactuals and show that they are often unfaithful.We then introduce a training-free method that enhances faithfulness by guiding explanation generation through attention-level interventions, informed by token-level heatmaps extracted via a faithful attribution method.This method significantly improves epistemic faithfulness across multiple models, benchmarks, and prompts. Bar Alon 0001, Itamar Zimerman, Lior Wolf |
ACL (1) | 1 |
| 2026 | Lower Bounds on Black-Box Constructions of Pseudorandom Functions
Bar Alon 0001, Itai Dinur, Muthuramakrishnan Venkitasubramaniam |
CRYPTO (1) | 1 |
| 2025 | Simplified PIR and CDS Protocols and Improved Linear Secret-Sharing Schemes
Bar Alon 0001, Amos Beimel, Or Lasri |
TCC (2) | 1 |
| 2024 | MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably
Bar Alon 0001, Moni Naor, Eran Omri, Uri Stemmer |
CRYPTO (8) | 1 |
| 2024 | Can Alice and Bob Guarantee Output to Carol?
Bar Alon 0001, Eran Omri, Muthuramakrishnan Venkitasubramaniam |
EUROCRYPT (5) | 1 |
| 2024 | New Upper Bounds for Evolving Secret Sharing via Infinite Branching Programs
Bar Alon 0001, Amos Beimel, Tamar Ben David, Eran Omri, Anat Paskin-Cherniavsky |
TCC (4) | 1 |
| 2023 | Three Party Secure Computation with Friends and Foes
Bar Alon 0001, Amos Beimel, Eran Omri |
TCC (2) | 1 |
| 2023 | On Secure Computation of Solitary Output Functionalities with and Without Broadcast
Bar Alon 0001, Eran Omri |
TCC (2) | 1 |
| 2023 | On the Power of an Honest Majority in Three-Party Computation Without Broadcast
Bar Alon 0001, Ran Cohen, Eran Omri, Tom Suad |
J. Cryptol. | 1 |
| 2023 | Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
Bar Alon 0001, Eran Omri |
J. Cryptol. | 1 |
| 2022 | On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness
Bar Alon 0001, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky, Arpita Patra |
TCC (2) | 1 |
| 2021 | Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort
Bar Alon 0001, Hao Chung, Kai-Min Chung, Mi-Ying (Miryam) Huang, Yi Lee, Yu-Ching Shen |
CRYPTO (1) | 1 |
| 2021 | On perfectly secure 2PC in the OT-hybrid model
Bar Alon 0001, Anat Paskin-Cherniavsky |
Theor. Comput. Sci. | 1 |
| 2020 | MPC with Friends and Foes
Bar Alon 0001, Eran Omri, Anat Paskin-Cherniavsky |
CRYPTO (2) | 1 |
| 2020 | On the Power of an Honest Majority in Three-Party Computation Without Broadcast
Bar Alon 0001, Ran Cohen, Eran Omri, Tom Suad |
TCC (2) | 1 |
| 2019 | On Perfectly Secure 2PC in the OT-Hybrid Model
Bar Alon 0001, Anat Paskin-Cherniavsky |
TCC (1) | 1 |