Demo Data from SIGIR 2026 / reviewers in the wild / expert
Luke Parker
dblp:320/0458
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 since 2021Security and privacy · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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
1 paper |
Cryptographic primitives and cryptanalysis · 77% Cryptographic protocols and secure computation · 23% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
distributed signatures |
0.9 | 1 | 2025 | Trout: Two-Round Threshold ECDSA from Class Groups · CCS 2025 |
Cryptographic protocols and secure computation › secure multiparty computation › active security
identifiable abort |
0.9 | 1 | 2025 | Trout: Two-Round Threshold ECDSA from Class Groups · CCS 2025 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › threshold signature
threshold ECDSA |
0.9 | 1 | 2025 | Trout: Two-Round Threshold ECDSA from Class Groups · CCS 2025 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
threshold signature |
0.9 | 1 | 2025 | Trout: Two-Round Threshold ECDSA from Class Groups · CCS 2025 |
Methods — techniques the papers use, named apart from their topics
cryptographic protocol design · 0.9class groups · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Trout: Two-Round Threshold ECDSA from Class GroupsabstractWe present Trout (Two-ROUnd Threshold), the first distributed two-round ECDSA signing protocol for arbitrary thresholds. Trout has constant upload bandwidth per-party and processing time linear in the amount of participants. Moreover, Trout achieves the Identifiable Abort (IA) property, which means that if the protocol cannot terminate due to a failure, parties can attribute the failure to a specific party. We achieve this without a trusted setup. Hila Dahari-Garbian, Ariel Nof, Luke Parker |
CCS | 3 |
| 2025 | Comparative analysis of artificial intelligence policies in universities across five countriesabstractAbstract The rapid integration of artificial intelligence (AI) in higher education has led to significant gaps in policy frameworks across universities worldwide. This study analyzes AI policies at 343 leading universities in Australia, Canada, China, the U.K., and the U.S., selected from the top 1500 institutions globally, as ranked by Times Higher Education for excellence in education across 2024/2025. Using a comparative analysis approach, we examined how these institutions govern the use of AI tools in teaching and learning contexts. Data were gathered from publicly available policy documents, student handbooks, and faculty guidelines, and analyzed using qualitative thematic coding supported by descriptive statistics. Our findings reveal diverse approaches, ranging from outright prohibitions to policies granting instructor's discretion, with notable regional differences influenced by cultural and regulatory factors. Quantitatively, for example, nearly half of universities adopted discretionary policies, while fewer than one in five issued outright bans. This study fills a gap in the literature by providing the first cross-regional analysis of AI policies in higher education, highlighting the absence of a universal framework. These insights offer valuable guidance for institutions to develop flexible, adaptive AI governance models that reflect their unique needs and values. Luke Parker, A. Jane Loper, Josh Hayes, Alice L. Karakas, Heidi Hallman |
Discov. Comput. | 1 |
| 2024 | Neural-Inspired Dendritic Multiplication Using a Reconfigurable Analog Integrated CircuitabstractA longstanding goal of neuromorphic computing is to develop novel computer architectures with a brain-like energy footprint. Still, key biological components such as dendrites are often overlooked. Instead, more compact scalable neuron models are favored for neuromorphic implementations. Here we present a novel neuroscience-inspired multiplicative circuit that uses shunting inhibition as the multiplicative mechanism in a CMOS dendrite circuit. We demonstrate an experimental implementation of our model on a 350-nm process field programmable analog array (FPAA) integrated circuit (IC), that exhibits shunting inhibition as a multiplicative process in neuromorphic circuits. Jordan Edwards, Luke Parker, Suma Cardwell, Frances S. Chance, Scott Koziol |
ISCAS | 2 |