Ueli Maurer
Ueli Maurer
Professor of Computer Science, ETH Zurich
Verified email at inf.ethz.ch
Title
Cited by
Cited by
Year
Secret key agreement by public discussion from common information
UM Maurer
IEEE transactions on information theory 39 (3), 733-742, 1993
20901993
Generalized privacy amplification
CH Bennett, G Brassard, C Crépeau, UM Maurer
IEEE Transactions on Information Theory 41 (6), 1915-1923, 1995
16791995
General secure multi-party computation from any linear secret-sharing scheme
R Cramer, I Damgård, U Maurer
International Conference on the Theory and Applications of Cryptographic …, 2000
5802000
Modelling a public-key infrastructure
U Maurer
European Symposium on Research in Computer Security, 325-350, 1996
5091996
Information-theoretic key agreement: From weak to strong secrecy for free
U Maurer, S Wolf
International Conference on the Theory and Applications of Cryptographic …, 2000
4992000
Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology
U Maurer, R Renner, C Holenstein
Theory of cryptography conference, 21-39, 2004
4912004
A universal statistical test for random bit generators
UM Maurer
Journal of cryptology 5 (2), 89-105, 1992
3811992
Digital payment systems with passive anonymity-revoking trustees
J Camenisch, U Maurer, M Stadler
Journal of Computer Security 5 (1), 69-89, 1997
3141997
Conditionally-perfect secrecy and a provably-secure randomized cipher
UM Maurer
Journal of Cryptology 5 (1), 53-66, 1992
3081992
Unconditionally secure key agreement and the intrinsic conditional information
UM Maurer, S Wolf
IEEE Transactions on Information Theory 45 (2), 499-514, 1999
3051999
Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms
UM Maurer
Annual international cryptology conference, 271-281, 1994
3031994
New Public-Key Schemes Based on Elliptic Curves over the Ring Zn
K Koyama, UM Maurer, T Okamoto, SA Vanstone
Annual International Cryptology Conference, 252-266, 1991
2761991
Secret-key agreement over unauthenticated public channels. I. Definitions and a completeness result
U Maurer, S Wolf
IEEE Transactions on Information Theory 49 (4), 822-831, 2003
264*2003
Player simulation and general adversary structures in perfect multiparty computation
M Hirt, U Maurer
Journal of cryptology 13 (1), 31-60, 2000
2432000
Non-interactive public-key cryptography
UM Maurer, Y Yacobi
Workshop on the Theory and Application of of Cryptographic Techniques, 498-507, 1991
2401991
Complete characterization of adversaries tolerable in secure multi-party computation
M Hirt, U Maurer
Proceedings of the sixteenth annual ACM symposium on Principles of …, 1997
2251997
Indistinguishability of random systems
U Maurer
International Conference on the Theory and Applications of Cryptographic …, 2002
2192002
The relationship between breaking the Diffie--Hellman protocol and computing discrete logarithms
UM Maurer, S Wolf
SIAM Journal on Computing 28 (5), 1689-1721, 1999
1921999
Unconditional security against memory-bounded adversaries
C Cachin, U Maurer
Annual International Cryptology Conference, 292-306, 1997
1921997
Linking information reconciliation and privacy amplification
C Cachin, UM Maurer
journal of Cryptology 10 (2), 97-110, 1997
1911997
The system can't perform the operation now. Try again later.
Articles 1–20