| Random oracles in a quantum world D Boneh, Ö Dagdelen, M Fischlin, A Lehmann, C Schaffner, M Zhandry Advances in Cryptology–ASIACRYPT 2011: 17th International Conference on the …, 2011 | 612 | 2011 |
| Distributed single sign-on J Camenisch, Y Gilad, A Lehmann, G Neven US Patent 9,705,872, 2017 | 213 | 2017 |
| Security of sanitizable signatures revisited C Brzuska, M Fischlin, T Freudenreich, A Lehmann, M Page, J Schelbert, ... Public Key Cryptography–PKC 2009: 12th International Conference on Practice …, 2009 | 192 | 2009 |
| Anonymous attestation using the strong diffie hellman assumption revisited J Camenisch, M Drijvers, A Lehmann Trust and Trustworthy Computing: 9th International Conference, TRUST 2016 …, 2016 | 151 | 2016 |
| Unlinkability of sanitizable signatures C Brzuska, M Fischlin, A Lehmann, D Schröder Public Key Cryptography–PKC 2010: 13th International Conference on Practice …, 2010 | 127 | 2010 |
| The wonderful world of global random oracles J Camenisch, M Drijvers, T Gagliardoni, A Lehmann, G Neven Annual international conference on the theory and applications of …, 2018 | 116 | 2018 |
| Random oracles with (out) programmability M Fischlin, A Lehmann, T Ristenpart, T Shrimpton, M Stam, S Tessaro International Conference on the Theory and Application of Cryptology and …, 2010 | 108 | 2010 |
| Updatable encryption with post-compromise security A Lehmann, B Tackmann Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference …, 2018 | 99 | 2018 |
| Universally composable direct anonymous attestation J Camenisch, M Drijvers, A Lehmann Public-Key Cryptography–PKC 2016: 19th IACR International Conference on …, 2016 | 95 | 2016 |
| One TPM to bind them all: Fixing TPM 2.0 for provably secure anonymous attestation J Camenisch, L Chen, M Drijvers, A Lehmann, D Novick, R Urian 2017 IEEE Symposium on Security and Privacy (SP), 901-920, 2017 | 82 | 2017 |
| Formal treatment of privacy-enhancing credential systems J Camenisch, S Krenn, A Lehmann, GL Mikkelsen, G Neven, ... International Conference on Selected Areas in Cryptography, 3-24, 2015 | 81 | 2015 |
| On the joint security of encryption and signature in EMV JP Degabriele, A Lehmann, KG Paterson, NP Smart, M Strefler Topics in Cryptology–CT-RSA 2012: The Cryptographers’ Track at the RSA …, 2012 | 78 | 2012 |
| Optimal distributed password verification J Camenisch, A Lehmann, G Neven Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications …, 2015 | 77 | 2015 |
| Memento: How to reconstruct your secrets from a single password in a hostile environment J Camenisch, A Lehmann, A Lysyanskaya, G Neven Advances in Cryptology–CRYPTO 2014: 34th Annual Cryptology Conference, Santa …, 2014 | 70 | 2014 |
| Concepts and languages for privacy-preserving attribute-based authentication J Camenisch, M Dubovitskaya, A Lehmann, G Neven, C Paquin, ... Policies and Research in Identity Management: Third IFIP WG 11.6 Working …, 2013 | 70 | 2013 |
| Short threshold dynamic group signatures J Camenisch, M Drijvers, A Lehmann, G Neven, P Towa International conference on security and cryptography for networks, 401-423, 2020 | 64 | 2020 |
| (R)CCA Secure Updatable Encryption with Integrity Protection M Klooß, A Lehmann, A Rupp Eurocrypt, 2019 | 63 | 2019 |
| PESTO: proactively secure distributed single sign-on, or how to trust a hacked server C Baum, T Frederiksen, J Hesse, A Lehmann, A Yanai 2020 IEEE European Symposium on Security and Privacy (EuroS&P), 587-606, 2020 | 59 | 2020 |
| History-free aggregate message authentication codes O Eikemeier, M Fischlin, JF Götzmann, A Lehmann, D Schröder, ... International Conference on Security and Cryptography for Networks, 309-328, 2010 | 59 | 2010 |
| SoK: oblivious pseudorandom functions S Casacuberta, J Hesse, A Lehmann 2022 IEEE 7th European Symposium on Security and Privacy (EuroS&P), 625-646, 2022 | 57 | 2022 |
Jan CamenischDFINITYPreverjeni e-poštni naslov na dfinity.org
