default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarkulf Kohlweiss
Person information
- affiliation: Univeristy of Edinburgh, UK
- affiliation (former): Microsoft Research Cambridge
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[e4]Markulf Kohlweiss
, Roberto Di Pietro, Alastair R. Beresford:
Cryptology and Network Security - 23rd International Conference, CANS 2024, Cambridge, UK, September 24-27, 2024, Proceedings, Part I. Lecture Notes in Computer Science 14905, Springer 2025, ISBN 978-981-97-8012-9 [contents]- [e3]Markulf Kohlweiss, Roberto Di Pietro, Alastair R. Beresford:
Cryptology and Network Security - 23rd International Conference, CANS 2024, Cambridge, UK, September 24-27, 2024, Proceedings, Part II. Lecture Notes in Computer Science 14906, Springer 2025, ISBN 978-981-97-8015-0 [contents] - 2024
- [j9]Balthazar Bauer, Pooya Farshim, Patrick Harasser, Markulf Kohlweiss:
The Uber-Knowledge Assumption: A Bridge to the AGM. IACR Commun. Cryptol. 1(3): 31 (2024) - [c76]Amirreza Sarencheh, Aggelos Kiayias, Markulf Kohlweiss:
PARScoin: A Privacy-preserving, Auditable, and Regulation-friendly Stablecoin. CANS (1) 2024: 289-313 - [i57]Jan Bobolz, Jesus Diaz, Markulf Kohlweiss:
Foundations of Anonymous Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions. IACR Cryptol. ePrint Arch. 2024: 42 (2024) - [i56]Scott Griffy, Markulf Kohlweiss, Anna Lysyanskaya, Meghna Sengupta:
Olympic Privacy-Preserving Blueprints: Faster Communication, Highly Functional, Stronger Security. IACR Cryptol. ePrint Arch. 2024: 675 (2024) - [i55]Jan Bobolz, Pooya Farshim, Markulf Kohlweiss, Akira Takahashi:
The Brave New World of Global Generic Groups and UC-Secure Zero-Overhead SNARKs. IACR Cryptol. ePrint Arch. 2024: 818 (2024) - [i54]Lorenzo Martinico, Markulf Kohlweiss:
AGATE: Augmented Global Attested Trusted Execution in the Universal Composability framework. IACR Cryptol. ePrint Arch. 2024: 1369 (2024) - 2023
- [c75]Elizabeth C. Crites, Markulf Kohlweiss, Bart Preneel, Mahdi Sedaghat, Daniel Slamanig:
Threshold Structure-Preserving Signatures. ASIACRYPT (2) 2023: 348-382 - [c74]Markulf Kohlweiss, Anna Lysyanskaya, An Nguyen:
Privacy-Preserving Blueprints. EUROCRYPT (2) 2023: 594-625 - [c73]Antonio Faonio, Dario Fiore, Markulf Kohlweiss, Luigi Russo, Michal Zajac:
From Polynomial IOP and Commitments to Non-malleable zkSNARKs. TCC (3) 2023: 455-485 - [c72]Markulf Kohlweiss, Mahak Pancholi, Akira Takahashi:
How to Compile Polynomial IOP into Simulation-Extractable SNARKs: A Modular Approach. TCC (3) 2023: 486-512 - [i53]Antonio Faonio, Dario Fiore, Markulf Kohlweiss, Luigi Russo, Michal Zajac:
From Polynomial IOP and Commitments to Non-malleable zkSNARKs. IACR Cryptol. ePrint Arch. 2023: 569 (2023) - [i52]Markulf Kohlweiss, Mahak Pancholi, Akira Takahashi:
How to Compile Polynomial IOP into Simulation-Extractable SNARKs: A Modular Approach. IACR Cryptol. ePrint Arch. 2023: 1067 (2023) - [i51]Balthazar Bauer, Pooya Farshim, Patrick Harasser, Markulf Kohlweiss:
The Uber-Knowledge Assumption: A Bridge to the AGM. IACR Cryptol. ePrint Arch. 2023: 1601 (2023) - [i50]Bernardo David, Felix Engelmann, Tore Kasper Frederiksen, Markulf Kohlweiss, Elena Pagnin, Mikhail Volkhov:
Updatable Privacy-Preserving Blueprints. IACR Cryptol. ePrint Arch. 2023: 1787 (2023) - [i49]Amirreza Sarencheh, Aggelos Kiayias, Markulf Kohlweiss:
PARScoin: A Privacy-preserving, Auditable, and Regulation-friendly Stablecoin. IACR Cryptol. ePrint Arch. 2023: 1908 (2023) - 2022
- [j8]Felix Engelmann, Thomas Kerber, Markulf Kohlweiss, Mikhail Volkhov:
Zswap: zk-SNARK Based Non-Interactive Multi-Asset Swaps. Proc. Priv. Enhancing Technol. 2022(4): 507-527 (2022) - [c71]Chris Brzuska, Antoine Delignat-Lavaud, Christoph Egger, Cédric Fournet, Konrad Kohbrok, Markulf Kohlweiss:
Key-Schedule Security for the TLS 1.3 Standard. ASIACRYPT (1) 2022: 621-650 - [c70]Kai Jun Eer, Jesus Diaz, Markulf Kohlweiss:
Bottom-Up Trust Registry in Self Sovereign Identity. BLOCKCHAIN 2022: 423-433 - [c69]Aggelos Kiayias, Markulf Kohlweiss, Amirreza Sarencheh:
PEReDi: Privacy-Enhanced, Regulated and Distributed Central Bank Digital Currencies. CCS 2022: 1739-1752 - [c68]Chaya Ganesh, Hamidreza Khoshakhlagh, Markulf Kohlweiss, Anca Nitulescu, Michal Zajac:
What Makes Fiat-Shamir zkSNARKs (Updatable SRS) Simulation Extractable? SCN 2022: 735-760 - [i48]Kai Jun Eer, Jesus Diaz, Markulf Kohlweiss:
Bottom-up Trust Registry in Self Sovereign Identity. CoRR abs/2208.04624 (2022) - [i47]Mahdi Sedaghat, Daniel Slamanig, Markulf Kohlweiss, Bart Preneel:
Structure-Preserving Threshold Signatures. IACR Cryptol. ePrint Arch. 2022: 839 (2022) - [i46]Aggelos Kiayias, Markulf Kohlweiss, Amirreza Sarencheh:
PEReDi: Privacy-Enhanced, Regulated and Distributed Central Bank Digital Currencies. IACR Cryptol. ePrint Arch. 2022: 974 (2022) - [i45]Felix Engelmann, Thomas Kerber, Markulf Kohlweiss, Mikhail Volkhov:
Zswap: zk-SNARK Based Non-Interactive Multi-Asset Swaps. IACR Cryptol. ePrint Arch. 2022: 1002 (2022) - [i44]Markulf Kohlweiss, Anna Lysyanskaya, An Nguyen:
Privacy-Preserving Blueprints. IACR Cryptol. ePrint Arch. 2022: 1536 (2022) - 2021
- [c67]Markulf Kohlweiss, Mary Maller, Janno Siim, Mikhail Volkhov:
Snarky Ceremonies. ASIACRYPT (3) 2021: 98-127 - [c66]Thomas Kerber, Aggelos Kiayias, Markulf Kohlweiss:
Composition with Knowledge Assumptions. CRYPTO (4) 2021: 364-393 - [c65]Christian Badertscher, Aggelos Kiayias, Markulf Kohlweiss, Hendrik Waldner:
Consistency for Functional Encryption. CSF 2021: 1-16 - [c64]Thomas Kerber, Aggelos Kiayias, Markulf Kohlweiss:
KACHINA - Foundations of Private Smart Contracts. CSF 2021: 1-16 - [c63]Karim Baghery, Markulf Kohlweiss, Janno Siim, Mikhail Volkhov:
Another Look at Extraction and Randomization of Groth's zk-SNARK. Financial Cryptography (1) 2021: 457-475 - [c62]Thomas Kerber, Aggelos Kiayias, Markulf Kohlweiss:
Mining for Privacy: How to Bootstrap a Snarky Blockchain. Financial Cryptography (1) 2021: 497-514 - [c61]Pramod Bhatotia, Markulf Kohlweiss, Lorenzo Martinico, Yiannis Tselekounis:
Steel: Composable Hardware-Based Stateful and Randomised Functional Encryption. Public Key Cryptography (2) 2021: 709-736 - [c60]Markulf Kohlweiss, Varun Madathil, Kartik Nayak, Alessandra Scafuro:
On the Anonymity Guarantees of Anonymous Proof-of-Stake Protocols. SP 2021: 1818-1833 - [i43]Thomas Kerber, Aggelos Kiayias, Markulf Kohlweiss:
Composition with Knowledge Assumptions. IACR Cryptol. ePrint Arch. 2021: 165 (2021) - [i42]Markulf Kohlweiss, Mary Maller, Janno Siim, Mikhail Volkhov:
Snarky Ceremonies. IACR Cryptol. ePrint Arch. 2021: 219 (2021) - [i41]Pramod Bhatotia, Markulf Kohlweiss, Lorenzo Martinico, Yiannis Tselekounis:
Steel: Composable Hardware-based Stateful and Randomised Functional Encryption. IACR Cryptol. ePrint Arch. 2021: 269 (2021) - [i40]Markulf Kohlweiss, Varun Madathil, Kartik Nayak, Alessandra Scafuro:
On the Anonymity Guarantees of Anonymous Proof-of-Stake Protocols. IACR Cryptol. ePrint Arch. 2021: 409 (2021) - [i39]Chris Brzuska, Antoine Delignat-Lavaud, Christoph Egger, Cédric Fournet, Konrad Kohbrok, Markulf Kohlweiss:
Key-schedule Security for the TLS 1.3 Standard. IACR Cryptol. ePrint Arch. 2021: 467 (2021) - [i38]Markulf Kohlweiss, Michal Zajac:
On Simulation-Extractability of Universal zkSNARKs. IACR Cryptol. ePrint Arch. 2021: 511 (2021) - 2020
- [e2]Aggelos Kiayias, Markulf Kohlweiss, Petros Wallden, Vassilis Zikas:
Public-Key Cryptography - PKC 2020 - 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, Edinburgh, UK, May 4-7, 2020, Proceedings, Part I. Lecture Notes in Computer Science 12110, Springer 2020, ISBN 978-3-030-45373-2 [contents] - [e1]Aggelos Kiayias, Markulf Kohlweiss, Petros Wallden, Vassilis Zikas:
Public-Key Cryptography - PKC 2020 - 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, Edinburgh, UK, May 4-7, 2020, Proceedings, Part II. Lecture Notes in Computer Science 12111, Springer 2020, ISBN 978-3-030-45387-9 [contents] - [i37]Christian Badertscher, Aggelos Kiayias, Markulf Kohlweiss, Hendrik Waldner:
Consistency for Functional Encryption. IACR Cryptol. ePrint Arch. 2020: 137 (2020) - [i36]Thomas Kerber, Aggelos Kiayias, Markulf Kohlweiss:
Mining for Privacy: How to Bootstrap a Snarky Blockchain. IACR Cryptol. ePrint Arch. 2020: 401 (2020) - [i35]Thomas Kerber, Aggelos Kiayias, Markulf Kohlweiss:
Kachina - Foundations of Private Smart Contracts. IACR Cryptol. ePrint Arch. 2020: 543 (2020) - [i34]Markulf Kohlweiss, Mikhail Volkhov:
Groth16 SNARKs are Randomizable and (Weakly) Simulation Extractable. IACR Cryptol. ePrint Arch. 2020: 811 (2020)
2010 – 2019
- 2019
- [j7]Masayuki Abe, Jens Groth, Markulf Kohlweiss, Miyako Ohkubo, Mehdi Tibouchi:
Efficient Fully Structure-Preserving Signatures and Shrinking Commitments. J. Cryptol. 32(3): 973-1025 (2019) - [c59]Mary Maller, Sean Bowe, Markulf Kohlweiss, Sarah Meiklejohn:
Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings. CCS 2019: 2111-2128 - [c58]Michel Abdalla, Fabrice Benhamouda, Markulf Kohlweiss, Hendrik Waldner:
Decentralizing Inner-Product Functional Encryption. Public Key Cryptography (2) 2019: 128-157 - [c57]Thomas Kerber, Aggelos Kiayias, Markulf Kohlweiss, Vassilis Zikas:
Ouroboros Crypsinous: Privacy-Preserving Proof-of-Stake. IEEE Symposium on Security and Privacy 2019: 157-174 - [i33]Michel Abdalla, Fabrice Benhamouda, Markulf Kohlweiss, Hendrik Waldner:
Decentralizing Inner-Product Functional Encryption. IACR Cryptol. ePrint Arch. 2019: 20 (2019) - [i32]Mary Maller, Sean Bowe, Markulf Kohlweiss, Sarah Meiklejohn:
Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings. IACR Cryptol. ePrint Arch. 2019: 99 (2019) - 2018
- [j6]Alfredo Rial, George Danezis, Markulf Kohlweiss:
Privacy-preserving smart metering revisited. Int. J. Inf. Sec. 17(1): 1-31 (2018) - [c56]Chris Brzuska, Antoine Delignat-Lavaud, Cédric Fournet, Konrad Kohbrok, Markulf Kohlweiss:
State Separation for Code-Based Game-Playing Proofs. ASIACRYPT (3) 2018: 222-249 - [c55]Jens Groth, Markulf Kohlweiss, Mary Maller, Sarah Meiklejohn, Ian Miers:
Updatable and Universal Common Reference Strings with Applications to zk-SNARKs. CRYPTO (3) 2018: 698-728 - [i31]Jens Groth, Markulf Kohlweiss, Mary Maller, Sarah Meiklejohn, Ian Miers:
Updatable and Universal Common Reference Strings with Applications to zk-SNARKs. IACR Cryptol. ePrint Arch. 2018: 280 (2018) - [i30]Chris Brzuska, Antoine Delignat-Lavaud, Konrad Kohbrok, Markulf Kohlweiss:
State-Separating Proofs: A Reduction Methodology for Real-World Protocols. IACR Cryptol. ePrint Arch. 2018: 306 (2018) - [i29]Thomas Kerber, Markulf Kohlweiss, Aggelos Kiayias, Vassilis Zikas:
Ouroboros Crypsinous: Privacy-Preserving Proof-of-Stake. IACR Cryptol. ePrint Arch. 2018: 1132 (2018) - 2017
- [j5]Benjamin Beurdouche, Karthikeyan Bhargavan, Antoine Delignat-Lavaud, Cédric Fournet, Markulf Kohlweiss, Alfredo Pironti, Pierre-Yves Strub, Jean Karim Zinzindohoue:
A messy state of the union: taming the composite state machines of TLS. Commun. ACM 60(2): 99-107 (2017) - [c54]Karthikeyan Bhargavan, Barry Bond, Antoine Delignat-Lavaud, Cédric Fournet, Chris Hawblitzel, Catalin Hritcu, Samin Ishtiaq, Markulf Kohlweiss, K. Rustan M. Leino, Jay R. Lorch, Kenji Maillard, Jianyang Pan, Bryan Parno, Jonathan Protzenko, Tahina Ramananandro, Ashay Rane, Aseem Rastogi, Nikhil Swamy, Laure Thompson, Peng Wang, Santiago Zanella Béguelin, Jean Karim Zinzindohoue:
Everest: Towards a Verified, Drop-in Replacement of HTTPS. SNAPL 2017: 1:1-1:12 - [c53]Antoine Delignat-Lavaud, Cédric Fournet, Markulf Kohlweiss, Jonathan Protzenko, Aseem Rastogi, Nikhil Swamy, Santiago Zanella Béguelin, Karthikeyan Bhargavan, Jianyang Pan, Jean Karim Zinzindohoue:
Implementing and Proving the TLS 1.3 Record Layer. IEEE Symposium on Security and Privacy 2017: 463-482 - [i28]Fatemeh Shirazi, Elena Andreeva, Markulf Kohlweiss, Claudia Díaz:
Multiparty Routing: Secure Routing for Mixnets. CoRR abs/1708.03387 (2017) - 2016
- [j4]Karthikeyan Bhargavan, Cédric Fournet, Markulf Kohlweiss:
miTLS: Verifying Protocol Implementations against Real-World Attacks. IEEE Secur. Priv. 14(6): 18-25 (2016) - [j3]Masayuki Abe, Melissa Chase, Bernardo David, Markulf Kohlweiss, Ryo Nishimaki, Miyako Ohkubo:
Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions. J. Cryptol. 29(4): 833-878 (2016) - [c52]Dario Fiore, Cédric Fournet, Esha Ghosh, Markulf Kohlweiss, Olga Ohrimenko, Bryan Parno:
Hash First, Argue Later: Adaptive Verifiable Computations on Outsourced Data. CCS 2016: 1304-1316 - [c51]Nikhil Swamy, Catalin Hritcu, Chantal Keller, Aseem Rastogi, Antoine Delignat-Lavaud, Simon Forest, Karthikeyan Bhargavan, Cédric Fournet, Pierre-Yves Strub, Markulf Kohlweiss, Jean Karim Zinzindohoue, Santiago Zanella Béguelin:
Dependent types and multi-monadic effects in F. POPL 2016: 256-270 - [c50]Nik Sultana, Markulf Kohlweiss, Andrew W. Moore:
Light at the middle of the tunnel: middleboxes for selective disclosure of network monitoring to distrusted parties. HotMiddlebox@SIGCOMM 2016: 1-6 - [c49]Antoine Delignat-Lavaud, Cédric Fournet, Markulf Kohlweiss, Bryan Parno:
Cinderella: Turning Shabby X.509 Certificates into Elegant Anonymous Credentials with the Magic of Verifiable Computation. IEEE Symposium on Security and Privacy 2016: 235-254 - [c48]Karthikeyan Bhargavan, Christina Brzuska, Cédric Fournet, Matthew Green, Markulf Kohlweiss, Santiago Zanella Béguelin:
Downgrade Resilience in Key-Exchange Protocols. IEEE Symposium on Security and Privacy 2016: 506-525 - [i27]Karthikeyan Bhargavan, Christina Brzuska, Cédric Fournet, Matthew Green, Markulf Kohlweiss, Santiago Zanella Béguelin:
Downgrade Resilience in Key-Exchange Protocols. IACR Cryptol. ePrint Arch. 2016: 72 (2016) - [i26]Dario Fiore, Cédric Fournet, Esha Ghosh, Markulf Kohlweiss, Olga Ohrimenko, Bryan Parno:
Hash First, Argue Later: Adaptive Verifiable Computations on Outsourced Data. IACR Cryptol. ePrint Arch. 2016: 985 (2016) - [i25]Karthikeyan Bhargavan, Antoine Delignat-Lavaud, Cédric Fournet, Markulf Kohlweiss, Jianyang Pan, Jonathan Protzenko, Aseem Rastogi, Nikhil Swamy, Santiago Zanella Béguelin, Jean Karim Zinzindohoue:
Implementing and Proving the TLS 1.3 Record Layer. IACR Cryptol. ePrint Arch. 2016: 1178 (2016) - 2015
- [j2]Markulf Kohlweiss, Ian Miers:
Accountable Metadata-Hiding Escrow: A Group Signature Case Study. Proc. Priv. Enhancing Technol. 2015(2): 206-221 (2015) - [c47]Jan Camenisch, Maria Dubovitskaya, Kristiyan Haralambiev, Markulf Kohlweiss:
Composable and Modular Anonymous Credentials: Definitions and Practical Constructions. ASIACRYPT (2) 2015: 262-288 - [c46]Olga Ohrimenko, Manuel Costa, Cédric Fournet, Christos Gkantsidis, Markulf Kohlweiss, Divya Sharma:
Observing and Preventing Leakage in MapReduce. CCS 2015: 1570-1581 - [c45]Masayuki Abe, Markulf Kohlweiss, Miyako Ohkubo, Mehdi Tibouchi:
Fully Structure-Preserving Signatures and Shrinking Commitments. EUROCRYPT (2) 2015: 35-65 - [c44]Jens Groth, Markulf Kohlweiss:
One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin. EUROCRYPT (2) 2015: 253-280 - [c43]Markulf Kohlweiss, Ueli Maurer, Cristina Onete, Björn Tackmann, Daniele Venturi:
(De-)Constructing TLS 1.3. INDOCRYPT 2015: 85-102 - [c42]Foteini Baldimtsi, Melissa Chase, Georg Fuchsbauer, Markulf Kohlweiss:
Anonymous Transferable E-Cash. Public Key Cryptography 2015: 101-124 - [c41]Craig Costello, Cédric Fournet, Jon Howell, Markulf Kohlweiss, Benjamin Kreuter, Michael Naehrig, Bryan Parno, Samee Zahur:
Geppetto: Versatile Verifiable Computation. IEEE Symposium on Security and Privacy 2015: 253-270 - [c40]Benjamin Beurdouche, Karthikeyan Bhargavan, Antoine Delignat-Lavaud, Cédric Fournet, Markulf Kohlweiss, Alfredo Pironti, Pierre-Yves Strub, Jean Karim Zinzindohoue:
A Messy State of the Union: Taming the Composite State Machines of TLS. IEEE Symposium on Security and Privacy 2015: 535-552 - [i24]Masayuki Abe, Markulf Kohlweiss, Miyako Ohkubo, Mehdi Tibouchi:
Fully Structure-Preserving Signatures and Shrinking Commitments. IACR Cryptol. ePrint Arch. 2015: 76 (2015) - [i23]Masayuki Abe, Bernardo David, Markulf Kohlweiss, Ryo Nishimaki, Miyako Ohkubo:
Tagged One-Time Signatures: Tight Security and Optimal Tag Size. IACR Cryptol. ePrint Arch. 2015: 311 (2015) - [i22]Jan Camenisch, Maria Dubovitskaya, Kristiyan Haralambiev, Markulf Kohlweiss:
Composable & Modular Anonymous Credentials: Definitions and Practical Constructions. IACR Cryptol. ePrint Arch. 2015: 580 (2015) - 2014
- [c39]George Danezis, Cédric Fournet, Jens Groth, Markulf Kohlweiss:
Square Span Programs with Applications to Succinct NIZK Arguments. ASIACRYPT (1) 2014: 532-550 - [c38]Karthikeyan Bhargavan, Cédric Fournet, Markulf Kohlweiss, Alfredo Pironti, Pierre-Yves Strub, Santiago Zanella Béguelin:
Proving the TLS Handshake Secure (As It Is). CRYPTO (2) 2014: 235-255 - [c37]Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Sarah Meiklejohn:
Malleable Signatures: New Definitions and Delegatable Anonymous Credentials. CSF 2014: 199-213 - [i21]Markulf Kohlweiss, Ueli Maurer, Cristina Onete, Björn Tackmann, Daniele Venturi:
(De-)Constructing TLS. IACR Cryptol. ePrint Arch. 2014: 20 (2014) - [i20]Karthikeyan Bhargavan, Cédric Fournet, Markulf Kohlweiss, Alfredo Pironti, Pierre-Yves Strub, Santiago Zanella Béguelin:
Proving the TLS Handshake Secure (as it is). IACR Cryptol. ePrint Arch. 2014: 182 (2014) - [i19]George Danezis, Cédric Fournet, Jens Groth, Markulf Kohlweiss:
Square Span Programs with Applications to Succinct NIZK Arguments. IACR Cryptol. ePrint Arch. 2014: 718 (2014) - [i18]Jens Groth, Markulf Kohlweiss:
One-out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin. IACR Cryptol. ePrint Arch. 2014: 764 (2014) - [i17]Markulf Kohlweiss, Ian Miers:
Accountable Tracing Signatures. IACR Cryptol. ePrint Arch. 2014: 824 (2014) - [i16]Craig Costello, Cédric Fournet, Jon Howell, Markulf Kohlweiss, Benjamin Kreuter, Michael Naehrig, Bryan Parno, Samee Zahur:
Geppetto: Versatile Verifiable Computation. IACR Cryptol. ePrint Arch. 2014: 976 (2014) - 2013
- [c36]George Danezis, Cédric Fournet, Markulf Kohlweiss, Bryan Parno:
Pinocchio coin: building zerocoin from a succinct pairing-based proof system. PETShop@CCS 2013: 27-30 - [c35]George Danezis, Cédric Fournet, Markulf Kohlweiss, Santiago Zanella Béguelin:
Smart meter aggregation via secret-sharing. SEGS@CCS 2013: 75-80 - [c34]Markulf Kohlweiss, Ueli Maurer, Cristina Onete, Björn Tackmann, Daniele Venturi:
Anonymity-Preserving Public-Key Encryption: A Constructive Approach. Privacy Enhancing Technologies 2013: 19-39 - [c33]Masayuki Abe, Bernardo David, Markulf Kohlweiss, Ryo Nishimaki, Miyako Ohkubo:
Tagged One-Time Signatures: Tight Security and Optimal Tag Size. Public Key Cryptography 2013: 312-331 - [c32]Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Sarah Meiklejohn:
Verifiable Elections That Scale for Free. Public Key Cryptography 2013: 479-496 - [c31]Karthikeyan Bhargavan, Cédric Fournet, Markulf Kohlweiss, Alfredo Pironti, Pierre-Yves Strub:
Implementing TLS with Verified Cryptographic Security. IEEE Symposium on Security and Privacy 2013: 445-459 - [c30]Nik Sultana, Moritz Y. Becker, Markulf Kohlweiss:
Selective Disclosure in Datalog-Based Trust Management. STM 2013: 160-175 - [c29]Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Sarah Meiklejohn:
Succinct Malleable NIZKs and an Application to Compact Shuffles. TCC 2013: 100-119 - [c28]Cédric Fournet, Markulf Kohlweiss, George Danezis, Zhengqin Luo:
ZQL: A Compiler for Privacy-Preserving Data Processing. USENIX Security Symposium 2013: 163-178 - [c27]Markulf Kohlweiss, Alfredo Rial:
Optimally private access control. WPES 2013: 37-48 - [i15]Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Sarah Meiklejohn:
Malleable Signatures: Complex Unary Transformations and Delegatable Anonymous Credentials. IACR Cryptol. ePrint Arch. 2013: 179 (2013) - [i14]Markulf Kohlweiss, Ueli Maurer, Cristina Onete, Björn Tackmann, Daniele Venturi:
Anonymity-preserving Public-Key Encryption: A Constructive Approach. IACR Cryptol. ePrint Arch. 2013: 238 (2013) - 2012
- [c26]Masayuki Abe, Melissa Chase, Bernardo David, Markulf Kohlweiss, Ryo Nishimaki, Miyako Ohkubo:
Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions. ASIACRYPT 2012: 4-24 - [c25]Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Sarah Meiklejohn:
Malleable Proof Systems and Applications. EUROCRYPT 2012: 281-300 - [c24]Sebastian Faust, Markulf Kohlweiss, Giorgia Azzurra Marson, Daniele Venturi:
On the Non-malleability of the Fiat-Shamir Transform. INDOCRYPT 2012: 60-79 - [c23]George Danezis, Markulf Kohlweiss, Benjamin Livshits, Alfredo Rial:
Private Client-Side Profiling with Random Forests and Hidden Markov Models. Privacy Enhancing Technologies 2012: 18-37 - [c22]Melissa Chase, Markulf Kohlweiss:
A New Hash-and-Sign Approach and Structure-Preserving Signatures from DLIN. SCN 2012: 131-148 - [i13]Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Sarah Meiklejohn:
Malleable Proof Systems and Applications. IACR Cryptol. ePrint Arch. 2012: 12 (2012) - [i12]Masayuki Abe, Melissa Chase, Bernardo David, Markulf Kohlweiss, Ryo Nishimaki, Miyako Ohkubo:
Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions. IACR Cryptol. ePrint Arch. 2012: 285 (2012) - [i11]Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Sarah Meiklejohn:
Succinct Malleable NIZKs and an Application to Compact Shuffles. IACR Cryptol. ePrint Arch. 2012: 506 (2012) - [i10]Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Sarah Meiklejohn:
Verifiable Elections That Scale for Free. IACR Cryptol. ePrint Arch. 2012: 697 (2012) - [i9]Sebastian Faust, Markulf Kohlweiss, Giorgia Azzurra Marson, Daniele Venturi:
On the Non-malleability of the Fiat-Shamir Transform. IACR Cryptol. ePrint Arch. 2012: 704 (2012) - 2011
- [c21]Jan Camenisch, Kristiyan Haralambiev, Markulf Kohlweiss, Jorn Lapon, Vincent Naessens:
Structure Preserving CCA Secure Encryption and Applications. ASIACRYPT 2011: 89-106 - [c20]Cédric Fournet, Markulf Kohlweiss, Pierre-Yves Strub:
Modular code-based cryptographic verification. CCS 2011: 341-350 - [c19]Jorn Lapon, Markulf Kohlweiss, Bart De Decker, Vincent Naessens:
Analysis of Revocation Strategies for Anonymous Idemix Credentials. Communications and Multimedia Security 2011: 3-17 - [c18]George Danezis, Markulf Kohlweiss, Alfredo Rial:
Differentially Private Billing with Rebates. Information Hiding 2011: 148-162 - [c17]Klaus Kursawe, George Danezis, Markulf Kohlweiss:
Privacy-Friendly Aggregation for the Smart-Grid. PETS 2011: 175-191 - [c16]Filipe Beato, Markulf Kohlweiss, Karel Wouters:
Scramble! Your Social Network Data. PETS 2011: 211-225 - [p3]Jan Camenisch, Maria Dubovitskaya, Markulf Kohlweiss, Jorn Lapon, Gregory Neven:
Cryptographic Mechanisms for Privacy. Privacy and Identity Management for Life 2011: 117-134 - [p2]Jan Camenisch, Markulf Kohlweiss, Dieter Sommer:
Pseudonyms and Private Credentials. Digital Privacy - PRIME 2011: 289-308 - [p1]Anas Abou El Kalam, Carlos Aguilar Melchor, Stefan Berthold, Jan Camenisch, Sebastian Clauß, Yves Deswarte, Markulf Kohlweiss, Andriy Panchenko, Lexi Pimenidis, Matthieu Roy:
Further Privacy Mechanisms. Digital Privacy - PRIME 2011: 485-555 - [i8]George Danezis, Markulf Kohlweiss, Alfredo Rial:
Differentially Private Billing with Rebates. IACR Cryptol. ePrint Arch. 2011: 134 (2011) - [i7]Jan Camenisch, Kristiyan Haralambiev, Markulf Kohlweiss, Jorn Lapon, Vincent Naessens:
Structure Preserving CCA Secure Encryption and Its Application to Oblivious Third Parties. IACR Cryptol. ePrint Arch. 2011: 319 (2011) - [i6]Melissa Chase, Markulf Kohlweiss:
A Domain Transformation for Structure-Preserving Signatures on Group Elements. IACR Cryptol. ePrint Arch. 2011: 342 (2011) - 2010
- [j1]Claudio A. Ardagna, Jan Camenisch, Markulf Kohlweiss, Ronald Leenes, Gregory Neven, Bart Priem, Pierangela Samarati, Dieter Sommer, Mario Verdicchio:
Exploiting cryptography for privacy-enhanced access control: A result of the PRIME Project. J. Comput. Secur. 18(1): 123-160 (2010) - [c15]Jan Camenisch, Markulf Kohlweiss, Claudio Soriente:
Solving Revocation with Efficient Update of Anonymous Credentials. SCN 2010: 454-471 - [c14]Jorn Lapon, Markulf Kohlweiss, Bart De Decker, Vincent Naessens:
Performance Analysis of Accumulator-Based Revocation Mechanisms. SEC 2010: 289-301
2000 – 2009
- 2009
- [c13]Mira Belenkiy, Jan Camenisch, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Hovav Shacham:
Randomizable Proofs and Delegatable Anonymous Credentials. CRYPTO 2009: 108-125 - [c12]Roel Peeters, Markulf Kohlweiss, Bart Preneel:
Threshold Things That Think: Authorisation for Resharing. iNetSeC 2009: 111-124 - [c11]Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya:
Compact E-Cash and Simulatable VRFs Revisited. Pairing 2009: 114-131 - [c10]Alfredo Rial, Markulf Kohlweiss, Bart Preneel:
Universally Composable Adaptive Priced Oblivious Transfer. Pairing 2009: 231-247 - [c9]Jan Camenisch, Markulf Kohlweiss, Alfredo Rial, Caroline Sheedy:
Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data. Public Key Cryptography 2009: 196-214 - [c8]Jan Camenisch, Markulf Kohlweiss, Claudio Soriente:
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials. Public Key Cryptography 2009: 481-500 - [c7]Roel Peeters, Markulf Kohlweiss, Bart Preneel, Nicky Sulmon:
Threshold things that think: usable authorization for resharing. SOUPS 2009 - [i5]Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya:
Compact E-Cash and Simulatable VRFs Revisited. IACR Cryptol. ePrint Arch. 2009: 107 (2009) - 2008
- [c6]Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya:
P-signatures and Noninteractive Anonymous Credentials. TCC 2008: 356-374 - [c5]Leonardo A. Martucci, Markulf Kohlweiss, Christer Andersson, Andriy Panchenko:
Self-certified Sybil-free pseudonyms. WISEC 2008: 154-159 - [c4]Christer Andersson, Markulf Kohlweiss, Leonardo A. Martucci, Andriy Panchenko:
A Self-certified and Sybil-Free Framework for Secure Digital Identity Domain Buildup. WISTP 2008: 64-77 - [i4]Mira Belenkiy, Jan Camenisch, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Hovav Shacham:
Delegatable Anonymous Credentials. IACR Cryptol. ePrint Arch. 2008: 428 (2008) - [i3]Jan Camenisch, Markulf Kohlweiss, Claudio Soriente:
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials. IACR Cryptol. ePrint Arch. 2008: 539 (2008) - 2007
- [c3]Markulf Kohlweiss, Sebastian Faust, Lothar Fritsch, Bartek Gedrojc, Bart Preneel:
Efficient Oblivious Augmented Maps: Location-Based Services with a Payment Broker. Privacy Enhancing Technologies 2007: 77-94 - [i2]Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya:
Non-Interactive Anonymous Credentials. IACR Cryptol. ePrint Arch. 2007: 384 (2007) - 2006
- [c2]Jan Camenisch, Susan Hohenberger, Markulf Kohlweiss, Anna Lysyanskaya, Mira Meyerovich:
How to win the clonewars: efficient periodic n-times anonymous authentication. CCS 2006: 201-210 - [i1]Jan Camenisch, Susan Hohenberger, Markulf Kohlweiss, Anna Lysyanskaya, Mira Meyerovich:
How to Win the Clone Wars: Efficient Periodic n-Times Anonymous Authentication. IACR Cryptol. ePrint Arch. 2006: 454 (2006) - 2005
- [c1]Tobias Kölsch, Lothar Fritsch, Markulf Kohlweiss, Dogan Kesdogan:
Privacy for Profitable Location Based Services. SPC 2005: 164-178
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
