| Composability in quantum cryptography J Müller-Quade, R Renner New Journal of Physics 11 (8), 085006, 2009 | 195 | 2009 |
| Bingo voting: Secure and coercion-free voting using a trusted random number generator JM Bohli, J Müller-Quade, S Röhrich International Conference on E-Voting and Identity, 111-124, 2007 | 149 | 2007 |
| Improving quantum secret-sharing schemes ACA Nascimento, J Mueller-Quade, H Imai Physical Review A 64 (4), 042311, 2001 | 108 | 2001 |
| Universally composable commitments using random oracles D Hofheinz, J Müller-Quade Theory of Cryptography Conference, 58-76, 2004 | 102 | 2004 |
| Analytical beam shaping with application to laser-diode arrays H Aagedal, M Schmid, S Egner, J Müller-Quade, T Beth, F Wyrowski Journal of the Optical Society of America A 14 (7), 1549-1553, 1997 | 84 | 1997 |
| Lossy codes and a new variant of the learning-with-errors problem N Döttling, J Müller-Quade Annual International Conference on the Theory and Applications of …, 2013 | 81 | 2013 |
| IND-CCA secure cryptography based on a variant of the LPN problem N Döttling, J Müller-Quade, ACA Nascimento International Conference on the Theory and Application of Cryptology and …, 2012 | 76 | 2012 |
| Unconditional and composable security using a single stateful tamper-proof hardware token N Döttling, D Kraschewski, J Müller-Quade Theory of Cryptography Conference, 164-181, 2011 | 75 | 2011 |
| Universally composable zero-knowledge arguments and commitments from signature cards D Hofheinz, J Müller-Quade, D Unruh 5th Central European Conference on Cryptology, 2005 | 71 | 2005 |
| ConTra Corona: Contact Tracing against the Coronavirus by Bridging the Centralized–Decentralized Divide for Stronger Privacy W Beskorovajnov, F Dörre, G Hartung, A Koch, J Müller-Quade, T Strufe International Conference on the Theory and Application of Cryptology and …, 2021 | 67 | 2021 |
| A CCA2 secure public key encryption scheme based on the McEliece assumptions in the standard model R Dowsley, J Müller-Quade, ACA Nascimento Cryptographers’ Track at the RSA Conference, 240-251, 2009 | 59 | 2009 |
| Universally composable incoercibility D Unruh, J Müller-Quade Annual Cryptology Conference, 411-428, 2010 | 51 | 2010 |
| Oblivious transfer based on the McEliece assumptions R Dowsley, J Van De Graaf, J Müller-Quade, ACA Nascimento International Conference on Information Theoretic Security, 107-117, 2008 | 51 | 2008 |
| Improved coercion-resistant electronic elections through deniable re-voting D Achenbach, C Kempka, B Löwe, J Müller-Quade {USENIX} Journal of Election Technology and Systems ({JETS}) 3, 26-45, 2015 | 46 | 2015 |
| Long-term security and universal composability J Müller-Quade, D Unruh Theory of Cryptography Conference, 41-60, 2007 | 44 | 2007 |
| Secure computability of functions in the IT setting with dishonest majority and applications to long-term security R Künzler, J Müller-Quade, D Raub Theory of Cryptography Conference, 238-255, 2009 | 43 | 2009 |
| An information theoretical model for quantum secret sharing H Imai, J Müller-Quade, ACA Nascimento, P Tuyls, A Winter Quantum Information & Computation 5 (1), 69-80, 2005 | 43 | 2005 |
| Initiator-resilient universally composable key exchange D Hofheinz, J Müller-Quade, R Steinwandt European Symposium on Research in Computer Security, 61-84, 2003 | 41 | 2003 |
| Decomposing a matrix into circulant and diagonal factors M Schmid, R Steinwandt, J Müller-Quade, M Rötteler, T Beth Linear Algebra and its Applications 306 (1-3), 131-143, 2000 | 40 | 2000 |
| Polynomial runtime and composability D Hofheinz, D Unruh, J Müller-Quade Journal of Cryptology 26 (3), 375-441, 2013 | 38 | 2013 |
