| Composability in quantum cryptography J Müller-Quade, R Renner New Journal of Physics 11 (8), 085006, 2009 | 123 | 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 | 113 | 2007 |
| Improving quantum secret-sharing schemes ACA Nascimento, J Mueller-Quade, H Imai Physical Review A 64 (4), 042311, 2001 | 97 | 2001 |
| Universally composable commitments using random oracles D Hofheinz, J Müller-Quade Theory of Cryptography Conference, 58-76, 2004 | 82 | 2004 |
| Analytical beam shaping with application to laser-diode arrays H Aagedal, M Schmid, S Egner, J Müller-Quade, T Beth, F Wyrowski JOSA A 14 (7), 1549-1553, 1997 | 64 | 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 | 62 | 2013 |
| 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 | 61 | 2005 |
| 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 | 59 | 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 | 59 | 2011 |
| 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 | 55 | 2009 |
| A quantum information theoretical model for quantum secret sharing schemes H Imai, J Müller-Quade, ACA Nascimento, P Tuyls, A Winter arXiv preprint quant-ph/0311136, 2003 | 42 | 2003 |
| Universally composable incoercibility D Unruh, J Müller-Quade Annual Cryptology Conference, 411-428, 2010 | 39 | 2010 |
| 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 | 39 | 2009 |
| 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 | 39 | 2008 |
| Initiator-resilient universally composable key exchange D Hofheinz, J Müller-Quade, R Steinwandt European Symposium on Research in Computer Security, 61-84, 2003 | 38 | 2003 |
| Implementing resettable UC-functionalities with untrusted tamper-proof hardware-tokens N Döttling, T Mie, J Müller-Quade, T Nilges Theory of Cryptography Conference, 642-661, 2013 | 34 | 2013 |
| Long-term security and universal composability J Müller-Quade, D Unruh Theory of Cryptography Conference, 41-60, 2007 | 31 | 2007 |
| On fairness in simulatability-based cryptographic systems M Backes, D Hofheinz, J Müller-Quade, D Unruh Proceedings of the 2005 ACM workshop on Formal methods in security …, 2005 | 30 | 2005 |
| Enhancing electronic voting machines on the example of Bingo voting JM Bohli, C Henrich, C Kempka, JÖ Muller-Quade, S Rohrich IEEE transactions on information forensics and security 4 (4), 745-750, 2009 | 29 | 2009 |
| Information-theoretically secure oblivious polynomial evaluation in the commodity-based model R Tonicelli, ACA Nascimento, R Dowsley, J Müller-Quade, H Imai, ... International Journal of Information Security 14 (1), 73-84, 2015 | 28 | 2015 |
