World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
50
Citations
8212
World Ranking
5693
National Ranking
344

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Computer network
  • Cryptography

The scientist’s investigation covers issues in Computer security, Mathematical proof, Authentication, Credential and Theoretical computer science. Markulf Kohlweiss is involved in the study of Computer security that focuses on Encryption in particular. Markulf Kohlweiss interconnects Construct, Programming language, Protocol and Logarithm in the investigation of issues within Mathematical proof.

His Authentication research is multidisciplinary, incorporating elements of Internet security, Cryptographic protocol, Cryptographic primitive and Provable security. Markulf Kohlweiss has researched Credential in several fields, including Security parameter and Anonymity. Markulf Kohlweiss focuses mostly in the field of Theoretical computer science, narrowing it down to topics relating to Signature and, in certain cases, Group and Scheme.

His most cited work include:

  • Privacy-friendly aggregation for the smart-grid (294 citations)
  • How to win the clonewars: efficient periodic n-times anonymous authentication (215 citations)
  • An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials (211 citations)

What are the main themes of his work throughout his whole career to date?

His primary areas of investigation include Computer security, Cryptography, Theoretical computer science, Encryption and Mathematical proof. His research on Computer security often connects related areas such as Internet privacy. Markulf Kohlweiss combines subjects such as Handshake, Correctness, Server and Compiler with his study of Cryptography.

His Theoretical computer science research incorporates themes from Signature, Malleability, Random oracle, Structure and Scheme. His studies deal with areas such as Trusted third party and Adversary as well as Encryption. His study in Mathematical proof is interdisciplinary in nature, drawing from both Security parameter, Construct, Protocol, Verifiable secret sharing and Public-key cryptography.

He most often published in these fields:

  • Computer security (47.48%)
  • Cryptography (29.50%)
  • Theoretical computer science (28.06%)

What were the highlights of his more recent work (between 2015-2021)?

  • Computer security (47.48%)
  • Theoretical computer science (28.06%)
  • Cryptography (29.50%)

In recent papers he was focusing on the following fields of study:

His primary scientific interests are in Computer security, Theoretical computer science, Cryptography, Mathematical proof and Zero-knowledge proof. Markulf Kohlweiss frequently studies issues relating to Service and Computer security. His Theoretical computer science research incorporates elements of Structure, Simple, Functional encryption, Scheme and Computation.

His studies in Cryptography integrate themes in fields like Adversary and Server. His Mathematical proof study incorporates themes from Programming language and State. His Zero-knowledge proof research includes themes of Discrete mathematics and Relation.

Between 2015 and 2021, his most popular works were:

  • Dependent types and multi-monadic effects in F* (140 citations)
  • Updatable and universal common reference strings with applications to zk-SNARKs (36 citations)
  • Updatable and universal common reference strings with applications to zk-SNARKs (36 citations)

In his most recent research, the most cited papers focused on:

  • Programming language
  • Computer network
  • The Internet

Markulf Kohlweiss spends much of his time researching Theoretical computer science, Structure, Relation, Zero-knowledge proof and Distributed computing. His Theoretical computer science study combines topics in areas such as Signature and Hash chain, Hash tree, Merkle tree, Hash function. His Structure research integrates issues from Group, Simple, Constant, Scheme and Computation.

His Zero-knowledge proof research entails a greater understanding of Mathematical proof. His Cryptographic primitive study introduces a deeper knowledge of Cryptography. His Computer network research is multidisciplinary, incorporating perspectives in Computer security and Secure by design.

Best Publications

  • Privacy-friendly aggregation for the smart-grid

    Klaus Kursawe;George Danezis;Markulf Kohlweiss

  • Dependent types and multi-monadic effects in F*

    Nikhil Swamy;Cătălin Hriţcu;Chantal Keller;Aseem Rastogi

  • A Messy State of the Union: Taming the Composite State Machines of TLS

    Benjamin Beurdouche;Karthikeyan Bhargavan;Antoine Delignat-Lavaud;Cedric Fournet

  • An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials

    Jan Camenisch;Markulf Kohlweiss;Claudio Soriente

  • Randomizable Proofs and Delegatable Anonymous Credentials

    Mira Belenkiy;Jan Camenisch;Melissa Chase;Markulf Kohlweiss

  • Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings

    Mary Maller;Sean Bowe;Markulf Kohlweiss;Sarah Meiklejohn

  • How to win the clonewars: efficient periodic n-times anonymous authentication

    Jan Camenisch;Susan Hohenberger;Markulf Kohlweiss;Anna Lysyanskaya

  • Randomizable Proofs and Delegatable Anonymous Credentials

    Mira Belenkiy;Jan Camenisch;Melissa Chase;Markulf Kohlweiss

  • P-signatures and noninteractive anonymous credentials

    Mira Belenkiy;Melissa Chase;Markulf Kohlweiss;Anna Lysyanskaya

  • Geppetto: Versatile Verifiable Computation

    Craig Costello;Cedric Fournet;Jon Howell;Markulf Kohlweiss

  • Implementing TLS with Verified Cryptographic Security

    K. Bhargavan;C. Fournet;M. Kohlweiss;A. Pironti

  • One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin

    Jens Groth;Markulf Kohlweiss

  • Updatable and universal common reference strings with applications to zk-SNARKs

    Jens Groth;Markulf Kohlweiss;Markulf Kohlweiss;Mary Maller;Mary Maller;Sarah Meiklejohn

  • Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data

    Jan Camenisch;Markulf Kohlweiss;Alfredo Rial;Caroline Sheedy

  • Square Span Programs with Applications to Succinct NIZK Arguments

    George Danezis;Cédric Fournet;Jens Groth;Markulf Kohlweiss

  • On the Non-malleability of the Fiat-Shamir Transform.

    Sebastian Faust;Markulf Kohlweiss;Giorgia Azzurra Marson;Daniele Venturi

  • Scramble! your social network data

    Filipe Ramos Araújo Beato;Markulf Kohlweiss;Karel Wouters

  • Pinocchio coin: building zerocoin from a succinct pairing-based proof system

    George Danezis;Cedric Fournet;Markulf Kohlweiss;Bryan Parno

  • Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions

    Masayuki Abe;Melissa Chase;Bernardo David;Markulf Kohlweiss

  • Malleable Proof Systems and Applications.

    Melissa Chase;Markulf Kohlweiss;Anna Lysyanskaya;Sarah Meiklejohn

  • How to Win the Clone Wars: Efficient Periodic n-Times Anonymous Authentication.

    Jan Camenisch;Susan Hohenberger;Markulf Kohlweiss;Anna Lysyanskaya

  • Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data

    Jan Camenisch;Markulf Kohlweiss;Alfredo Rial Duran;Caroline Sheedy

  • A messy state of the union: taming the composite state machines of TLS

    Benjamin Beurdouche;Karthikeyan Bhargavan;Antoine Delignat-Lavaud;Cédric Fournet

  • Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings.

    Mary Maller;Sean Bowe;Markulf Kohlweiss;Sarah Meiklejohn

Frequent Co-Authors

Cédric Fournet
Cédric Fournet Microsoft (United States)
Anna Lysyanskaya
Anna Lysyanskaya Brown University
George Danezis
George Danezis University College London
Karthikeyan Bhargavan
Karthikeyan Bhargavan French Institute for Research in Computer Science and Automation - INRIA
Masayuki Abe
Masayuki Abe Kyoto University
Bryan Parno
Bryan Parno Carnegie Mellon University
Bart Preneel
Bart Preneel KU Leuven
Aggelos Kiayias
Aggelos Kiayias University of Edinburgh
Nikhil Swamy
Nikhil Swamy Microsoft (United States)

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online education opens numerous opportunities for students considering Computer Science in the USA. Whether you’re aiming to advance your career or change fields, online degrees offer flexible, accredited options that can fit various goals and schedules.

For those seeking advanced credentials while controlling costs, the cheapest online phd programs can help you achieve a terminal degree affordably. Education professionals interested in leadership roles might consider the cheapest edd programs, which offer fast-track online pathways.

Not everyone is ready for a four-year commitment. Accelerated options like the best associate degree in 6 months online can help you enter the workforce or start a new career sooner. Additionally, tech-minded students interested in the business side of tech can benefit from online business degree programs accredited for quality and credibility.

By exploring these diverse online options, you can find a program that aligns with your ambitions, whether in computer science, education, or business.

Best Scientists Citing Markulf Kohlweiss

Trending Scientists