EDBT 2026 Demo / reviewers in the wild / expert
Daniel Wagner 0001
dblp:65/6748-1
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2016
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 2Security 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 primitives and cryptanalysis · 100% | |
| Software engineering, system software, and programming languages
2 papers |
Compilers and program optimization · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Compilers and program optimization › program transformation
bidirectional transformation |
0.3 | 2 | 2012 | Edit lenses · POPL 2012 Symmetric lenses · POPL 2011 |
Cryptographic primitives and cryptanalysis › public-key cryptography › algebraic cryptography
multilinear maps |
0.2 | 1 | 2016 | 5Gen: A Framework for Prototyping Applications Using Multilinear Maps and Matrix Branching Programs · CCS 2016 |
Cryptographic primitives and cryptanalysis
functional encryption |
0.1 | 1 | 2016 | 5Gen: A Framework for Prototyping Applications Using Multilinear Maps and Matrix Branching Programs · CCS 2016 |
Cryptographic primitives and cryptanalysis › functional encryption
multi-input functional encryption |
0.1 | 1 | 2016 | 5Gen: A Framework for Prototyping Applications Using Multilinear Maps and Matrix Branching Programs · CCS 2016 |
Methods — techniques the papers use, named apart from their topics
program obfuscation · 0.2compiler · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | 5Gen: A Framework for Prototyping Applications Using Multilinear Maps and Matrix Branching ProgramsabstractSecure multilinear maps (mmaps) have been shown to have remarkable applications in cryptography, such as multi-input functional encryption (MIFE) and program obfuscation. To date, there has been little evaluation of the performance of these applications. In this paper we initiate a systematic study of mmap-based constructions. We build a general framework, called 5Gen, to experiment with these applications. At the top layer we develop a compiler that takes in a high-level program and produces an optimized matrix branching program needed for the applications we consider. Next, we optimize and experiment with several MIFE and obfuscation constructions and evaluate their performance. The 5Gen framework is modular and can easily accommodate new mmap constructions as well as new MIFE and obfuscation constructions, as well as being an open-source tool that can be used by other research groups to experiment with a variety of mmap-based constructions. Kevin Lewi, Alex J. Malozemoff, Daniel Apon, Brent Carmer, Adam Foltzer, Daniel Wagner 0001, David W. Archer, Dan Boneh, Jonathan Katz, Mariana Raykova 0001 |
CCS | 6 |
| 2012 | Edit lensesabstractA lens is a bidirectional transformation between a pair of connected data structures, capable of translating an edit on one structure into an appropriate edit on the other. Many varieties of lenses have been studied, but none, to date, has offered a satisfactory treatment of how edits are represented. Many foundational accounts only consider edits of the form "overwrite the whole structure," leading to poor behavior in many situations by failing to track the associations between corresponding parts of the structures when elements are inserted and deleted in ordered lists, for example. Other theories of lenses do maintain these associations, either by annotating the structures themselves with change information or using auxiliary data structures, but every extant theory assumes that the entire original source structure is part of the information passed to the lens. Martin Hofmann 0001, Benjamin C. Pierce, Daniel Wagner 0001 |
POPL | 3 |
| 2011 | Symmetric lensesabstractLenses--bidirectional transformations between pairs of connected structures--have been extensively studied and are beginning to find their way into industrial practice. However, some aspects of their foundations remain poorly understood. In particular, most previous work has focused on the special case of asymmetric lenses, where one of the structures is taken as primary and the other is thought of as a projection, or view. A few studies have considered symmetric variants, where each structure contains information not present in the other, but these all lack the basic operation of composition. Moreover, while many domain-specific languages based on lenses have been designed, lenses have not been thoroughly explored from an algebraic perspective. Martin Hofmann 0001, Benjamin C. Pierce, Daniel Wagner 0001 |
POPL | 3 |