Markulf Kohlweiss
Artificial Intelligence · 2006–2019
A researcher in the Science corpus: 11 papers; trusts 47 researchers and is trusted by 15 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 148 citations into it; #9,882 of 35,345 by trust here, #7,728 by citations
- Computational Theory and Mathematics — 61 citations into it; #10,459 of 12,182 by trust here, #3,218 by citations
- Information Systems — 59 citations into it; #5,013 of 8,771 by trust here, #2,064 by citations
- Privacy & Security — 34 citations into it; #536 of 709 by trust here, #449 by citations
- Computer Networks and Communications — 28 citations into it
- Geometry and Topology — 14 citations into it
- Electrical and Electronic Engineering — 12 citations into it
- Program Analysis & Verification — 10 citations into it; #276 of 301 by trust here, #169 by citations
Whom Markulf Kohlweiss trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Jan Camenisch
- Dan Boneh
- Jens Groth
- Craig Gentry
- David Chaum
- Torben P. Pedersen
- Claus-Peter Schnorr
- Eli Ben-Sasson
- Silvio Micali
- Helger Lipmaa
Who trusts Markulf Kohlweiss overall
- George Danezis
- Srinath T. V. Setty
- Henry Corrigan-Gibbs
- Dan Boneh
- Eli Ben-Sasson
- Sarah Meiklejohn
- Masayuki Abe
- Ahmed E. Kosba
- Riad S. Wahby
Papers from Markulf Kohlweiss's perspective
Ordered by how strongly the researchers Markulf Kohlweiss trusts endorse each paper. Same corpus, a different order for every researcher.
- Random oracles are practical: a paradigm for designing efficient protocols
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems
- Fully homomorphic encryption using ideal lattices
- Efficient signature generation by smart cards
- Identity-Based Encryption from the Weil Pairing
- The Knowledge Complexity of Interactive Proof Systems
- Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- Blind Signatures for Untraceable Payments
- New Explicit Conditions of Elliptic Curve Traces for FR-Reduction
Their papers
- Geppetto: Versatile Verifiable Computation (2015) — 241 citations
- Pinocchio coin: building zerocoin from a succinct pairing-based proof system (2013) — 127 citations
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials (2009) — 319 citations
- Dependent types and multi-monadic effects in F* (2016) — 434 citations
- A Messy State of the Union: Taming the Composite State Machines of TLS (2015) — 300 citations
- Succinct Malleable NIZKs and an Application to Compact Shuffles (2013) — 24 citations
- Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings (2019) — 417 citations
- Observing and Preventing Leakage in MapReduce (2015) — 92 citations
- Smart meter aggregation via secret-sharing (2013) — 102 citations
- Privacy-Friendly Aggregation for the Smart-Grid (2011) — 440 citations
- How to win the clonewars: efficient periodic n-times anonymous authentication (2006) — 310 citations