EDBT 2026 Demo / reviewers in the wild / expert
Alan Szepieniec
dblp:167/2805
· DBLP profile ↗
8ranked-venue papers
3as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 8 · 3 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
3 papers |
Cryptographic protocols and secure computation · 84% Cryptographic primitives and cryptanalysis · 16% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs |
0.6 | 1 | 2022 | VOProof: Efficient zkSNARKs from Vector Oracle Compilers · CCS 2022 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs › non-interactive zero-knowledge proofs
zk-SNARK |
0.6 | 1 | 2022 | VOProof: Efficient zkSNARKs from Vector Oracle Compilers · CCS 2022 |
Cryptographic protocols and secure computation › proof systems
succinct non-interactive arguments of knowledge |
0.4 | 1 | 2020 | Transparent SNARKs from DARK Compilers · EUROCRYPT (1) 2020 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs › succinct arguments
transparent zk-SNARKs |
0.4 | 1 | 2020 | Transparent SNARKs from DARK Compilers · EUROCRYPT (1) 2020 |
Cryptographic primitives and cryptanalysis
message authentication codes |
0.2 | 1 | 2016 | On the Influence of Message Length in PMAC's Security Bounds · EUROCRYPT (1) 2016 |
Cryptographic primitives and cryptanalysis › message authentication codes
PMAC |
0.2 | 1 | 2016 | On the Influence of Message Length in PMAC's Security Bounds · EUROCRYPT (1) 2016 |
Methods — techniques the papers use, named apart from their topics
vector oracle protocol · 0.6algebraic tools · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | VOProof: Efficient zkSNARKs from Vector Oracle CompilersabstractThe design of zkSNARKs is increasingly complicated and requires familiarity with a broad class of cryptographic and algebraic tools. This complexity in zkSNARK design also increases the difficulty in zkSNARK implementation, analysis, and optimization. To address this complexity, we develop a new workflow for designing and implementing zkSNARKs, called VOProof. In VOProof, the designer only needs to construct a Vector Oracle (VO) protocol that is intuitive and straightforward to design, and then feeds this protocol to our VO compiler to transform it into a fully functional zkSNARK. This new workflow conceals most algebraic and cryptographic operations inside the compiler, so that the designer is no longer required to understand these cumbersome and error prone procedures. Moreover, our compiler can be fine-tuned to compile one VO protocol into multiple zkSNARKs with different tradeoffs. Yuncong Zhang, Alan Szepieniec, Ren Zhang 0003, Shifeng Sun 0001, Dawu Gu |
CCS | 2 |
| 2020 | Transparent SNARKs from DARK Compilers
Benedikt Bünz, Ben Fisch, Alan Szepieniec |
EUROCRYPT (1) | 3 |
| 2019 | Block-Anti-Circulant Unbalanced Oil and Vinegar
Alan Szepieniec, Bart Preneel |
SAC | 1 |
| 2018 | Public Key Compression for Constrained Linear Signature Schemes
Ward Beullens, Bart Preneel, Alan Szepieniec |
SAC | 3 |
| 2017 | XOR of PRPs in a Quantum World
Bart Mennink, Alan Szepieniec |
PQCrypto | 2 |
| 2017 | MQ Signatures for PKI
Alan Szepieniec, Ward Beullens, Bart Preneel |
PQCrypto | 1 |
| 2016 | On the Influence of Message Length in PMAC's Security Bounds
Atul Luykx, Bart Preneel, Alan Szepieniec, Kan Yasuda |
EUROCRYPT (1) | 3 |
| 2016 | Extension Field Cancellation: A New Central Trapdoor for Multivariate Quadratic Systems
Alan Szepieniec, Jintai Ding, Bart Preneel |
PQCrypto | 1 |