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 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.
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.
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.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Privacy-friendly aggregation for the smart-grid
Klaus Kursawe;George Danezis;Markulf Kohlweiss.
privacy enhancing technologies (2011)
A Messy State of the Union: Taming the Composite State Machines of TLS
Benjamin Beurdouche;Karthikeyan Bhargavan;Antoine Delignat-Lavaud;Cedric Fournet.
ieee symposium on security and privacy (2015)
Dependent types and multi-monadic effects in F*
Nikhil Swamy;Cătălin Hriţcu;Chantal Keller;Aseem Rastogi.
symposium on principles of programming languages (2016)
Randomizable Proofs and Delegatable Anonymous Credentials
Mira Belenkiy;Jan Camenisch;Melissa Chase;Markulf Kohlweiss.
Lecture Notes in Computer Science (2009)
Randomizable Proofs and Delegatable Anonymous Credentials
Mira Belenkiy;Jan Camenisch;Melissa Chase;Markulf Kohlweiss.
(2009)
How to win the clonewars: efficient periodic n-times anonymous authentication
Jan Camenisch;Susan Hohenberger;Markulf Kohlweiss;Anna Lysyanskaya.
computer and communications security (2006)
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
Jan Camenisch;Markulf Kohlweiss;Claudio Soriente.
public key cryptography (2009)
A Messy State of the Union: Taming the Composite State Machines of TLS
Benjamin Beurdouche;Karthikeyan Bhargavan;Antoine Delignat-Lavaud;Cédric Fournet.
ieee symposium on security and privacy (2015)
P-signatures and noninteractive anonymous credentials
Mira Belenkiy;Melissa Chase;Markulf Kohlweiss;Anna Lysyanskaya.
theory of cryptography conference (2008)
Implementing TLS with Verified Cryptographic Security
K. Bhargavan;C. Fournet;M. Kohlweiss;A. Pironti.
ieee symposium on security and privacy (2013)
If you think any of the details on this page are incorrect, let us know.
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:
Microsoft (United States)
DFINITY
Brown University
University College London
French Institute for Research in Computer Science and Automation - INRIA
Carnegie Mellon University
KU Leuven
University of Edinburgh
University College London
ETH Zurich
French Institute for Research in Computer Science and Automation - INRIA
Publications: 24
University of Tehran
University of Washington
City University of Hong Kong
Singapore Management University
University of Michigan–Ann Arbor
University of Alberta
University of Kansas
Nagoya City University
KU Leuven
University of Palermo
Institut de Physique du Globe de Paris
Curtin University
University of California, San Diego
Georgia Institute of Technology
Stanford University
University of Rome Tor Vergata