VLDB 2026 Research / reviewers in the wild / expert
Vitalik Buterin
dblp:207/8171
· DBLP profile ↗
4ranked-venue papers
1as first author
4since 2021 · last 2024
0009-0003-2715-5600ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 3 · 3 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Complete Knowledge: Preventing Encumbrance of Cryptographic SecretsabstractMost cryptographic protocols model a player's knowledge of secrets in a simple way. Informally, the player knows a secret in the sense that she can directly furnish it as a (private) input to a protocol, e.g., to digitally sign a message. Mahimna Kelkar, Kushal Babel, Philip Daian, James Austgen, Vitalik Buterin, Ari Juels |
CCS | 5 |
| 2024 | Blockchain privacy and regulatory compliance: Towards a practical equilibriumabstractWe study Privacy Pools, a novel smart contract-based privacy-enhancing protocol. The protocol introduces a mechanism for users to reveal certain properties of their transaction without having to reveal the transaction itself. The core concept involves allowing users to publish a zero-knowledge proof, demonstrating that their funds (do not) originate from known (un-)lawful sources, without publicly revealing their entire transaction history. This is achieved by proving membership in custom association sets, which are designed to demonstrate compliance with regulatory frameworks or social consensus. We illustrate how this mechanism can create a separating equilibrium between compliant and non-compliant withdrawals. Our work describes the technical underpinnings, incentives and broader implications of this mechanism, highlighting how Privacy Pools-like protocols can create more private yet compliant blockchain transactions. Vitalik Buterin, Jacob Illum, Matthias Nadler, Fabian Schär, Ameen Soleimani |
Blockchain Res. Appl. | 1 |
| 2024 | BaseSAP: Modular Stealth Address Protocol for Programmable BlockchainsabstractStealth addresses represent an approach to enhancing privacy within public and distributed blockchains, such as Ethereum and Bitcoin. Stealth address protocols employ a distinct, randomly generated address for the recipient, thereby concealing interactions between entities. In this study, we introduce BaseSAP, an autonomous base-layer protocol for embedding stealth addresses within the application layer of programmable blockchains. BaseSAP expands upon previous research to develop a modular protocol for executing unlinkable transactions on public blockchains. BaseSAP allows for the development of additional stealth address layers using different cryptographic algorithms on top of the primary implementation, capitalizing on its modularity. To demonstrate the effectiveness of our proposed protocol, we present simulations of an advanced Secp256k1-based dual-key stealth address protocol. This protocol is developed on top of BaseSAP and deployed on the Ethereum test network as the first prototype implementation. Furthermore, we provide cost analyses and underscore potential security ramifications and attack vectors that could affect the privacy of stealth addresses. Our study highlights the flexibility of the BaseSAP protocol and provides insights into the broader implications of stealth address technology in the realm of blockchain privacy. Anton Wahrstätter, Matthew Solomon, Ben DiFrancesco, Vitalik Buterin, Davor Svetinovic |
IEEE Trans. Inf. Forensics Secur. | 4 |
| 2022 | Caulk: Lookup Arguments in Sublinear TimeabstractWe present position-hiding linkability for vector commitment schemes: one can prove in zero knowledge that one or m values that comprise commitment \cm all belong to the vector of size N committed to in \com. Our construction \textsfCaulk can be used for membership proofs and lookup arguments and outperforms all existing alternatives in prover time by orders of magnitude. Arantxa Zapico, Vitalik Buterin, Dmitry Khovratovich, Mary Maller, Anca Nitulescu, Mark Simkin 0001 |
CCS | 2 |