 | 2010 |
|---|
| 113 |       | Ueli M. Maurer,
Stefano Tessaro:
A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch.
TCC 2010: 237-254 |
| 2009 |
|---|
| 112 | | Ueli M. Maurer:
Unifying Zero-Knowledge Proofs of Knowledge.
AFRICACRYPT 2009: 272-286 |
| 111 | | Peter Gazi,
Ueli M. Maurer:
Cascade Encryption Revisited.
ASIACRYPT 2009: 37-51 |
| 110 | | Ueli M. Maurer,
Stefano Tessaro:
Computational Indistinguishability Amplification: Tight Product Theorems for System Composition.
CRYPTO 2009: 355-373 |
| 109 | | Ueli M. Maurer:
Abstraction in Cryptography.
CRYPTO 2009: 465 |
| 108 | | Divesh Aggarwal,
Ueli M. Maurer:
Breaking RSA Generically Is Equivalent to Factoring.
EUROCRYPT 2009: 36-53 |
| 107 | | Robert König,
Ueli M. Maurer,
Stefano Tessaro:
Abstract Storage Devices.
SOFSEM 2009: 341-352 |
| 106 | | Vassilis Zikas,
Sarah Hauser,
Ueli M. Maurer:
Realistic Failures in Secure Multi-party Computation.
TCC 2009: 274-293 |
| 2008 |
|---|
| 105 |  | Johannes Blömer,
Dan Boneh,
Ronald Cramer,
Ueli M. Maurer:
Cryptography, 16.09. - 21.09.2007
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 |
| 104 | | Martin Hirt,
Ueli M. Maurer,
Vassilis Zikas:
MPC vs. SFE : Unconditional and Computational Security.
ASIACRYPT 2008: 1-18 |
| 103 | | Ueli M. Maurer,
Stefano Tessaro:
Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography.
ASIACRYPT 2008: 161-178 |
| 102 | | Ueli M. Maurer:
Rethinking Digital Signatures.
SECRYPT 2008: 31-33 |
| 101 | | Zuzana Beerliová-Trubíniová,
Matthias Fitzi,
Martin Hirt,
Ueli M. Maurer,
Vassilis Zikas:
MPC vs. SFE: Perfect Security in a Unified Corruption Model.
TCC 2008: 231-250 |
| 100 | | Hideki Imai,
Goichiro Hanaoka,
Ueli M. Maurer,
Yuliang Zheng:
Introduction to the Special Issue on Information Theoretic Security.
IEEE Transactions on Information Theory 54(6): 2405-2407 (2008) |
| 99 | | Stefan Dziembowski,
Ueli M. Maurer:
The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement.
IEEE Transactions on Information Theory 54(6): 2790-2792 (2008) |
| 2007 |
|---|
| 98 | | Ueli M. Maurer,
Dominik Raub:
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations.
ASIACRYPT 2007: 427-443 |
| 97 | | Ueli M. Maurer,
Krzysztof Pietrzak,
Renato Renner:
Indistinguishability Amplification.
CRYPTO 2007: 130-149 |
| 96 | | Ueli M. Maurer,
Stefano Tessaro:
Domain Extension of Public Random Functions: Beyond the Birthday Barrier.
CRYPTO 2007: 187-204 |
| 95 | | Johannes Blömer,
Dan Boneh,
Ronald Cramer,
Ueli M. Maurer:
07381 Abstracts Collection -- Cryptography.
Cryptography 2007 |
| 94 | | Johannes Blömer,
Dan Boneh,
Ronald Cramer,
Ueli M. Maurer:
07381 Executive Summary - Cryptography.
Cryptography 2007 |
| 93 | | Ueli M. Maurer,
Johan Sjödin:
A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security.
EUROCRYPT 2007: 498-516 |
| 92 | | Robert König,
Ueli M. Maurer,
Stefano Tessaro:
Abstract Storage Devices
CoRR abs/0706.2746: (2007) |
| 2006 |
|---|
| 91 | | Ueli M. Maurer,
Yvonne Anne Oswald,
Krzysztof Pietrzak,
Johan Sjödin:
Luby-Rackoff Ciphers from Weak Round Functions?
EUROCRYPT 2006: 391-408 |
| 90 | | Ueli M. Maurer:
Secure multi-party computation made simple.
Discrete Applied Mathematics 154(2): 370-381 (2006) |
| 2005 |
|---|
| 89 | | Ueli M. Maurer,
Johan Sjödin:
Single-Key AIL-MACs from Any FIL-MAC.
ICALP 2005: 472-484 |
| 88 | | Ueli M. Maurer:
Abstract Models of Computation in Cryptography.
IMA Int. Conf. 2005: 1-12 |
| 87 | | Ueli M. Maurer,
Johan Sjödin:
Domain Expansion of MACs: Alternative Uses of the FIL-MAC.
IMA Int. Conf. 2005: 168-185 |
| 86 | | Robert König,
Ueli M. Maurer:
Generalized Strong Extractors and Deterministic Privacy Amplification.
IMA Int. Conf. 2005: 322-339 |
| 85 | | Endre Bangerter,
Jan Camenisch,
Ueli M. Maurer:
Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order.
Public Key Cryptography 2005: 154-171 |
| 84 | | Robert König,
Ueli M. Maurer,
Renato Renner:
On the power of quantum memory.
IEEE Transactions on Information Theory 51(7): 2391-2401 (2005) |
| 83 | | Matthias Fitzi,
Juan A. Garay,
Ueli M. Maurer,
Rafail Ostrovsky:
Minimal Complete Primitives for Secure Multi-Party Computation.
J. Cryptology 18(1): 37-61 (2005) |
| 82 | | Jeffrey Considine,
Matthias Fitzi,
Matthew K. Franklin,
Leonid A. Levin,
Ueli M. Maurer,
David Metcalf:
Byzantine Agreement Given Partial Broadcast.
J. Cryptology 18(3): 191-217 (2005) |
| 2004 |
|---|
| 81 | | Thomas Holenstein,
Ueli M. Maurer,
Johan Sjödin:
Complete Classification of Bilinear Hard-Core Functions.
CRYPTO 2004: 73-91 |
| 80 | | Ueli M. Maurer:
Towards a Theory of Consistency Primitives.
DISC 2004: 379-389 |
| 79 | | Stefan Dziembowski,
Ueli M. Maurer:
On Generating the Initial Key in the Bounded-Storage Model.
EUROCRYPT 2004: 126-137 |
| 78 | | Ueli M. Maurer:
The Role of Cryptography in Database Security.
SIGMOD Conference 2004: 5-10 |
| 77 | | Ueli M. Maurer,
Renato Renner,
Clemens Holenstein:
Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology.
TCC 2004: 21-39 |
| 76 | | Ueli M. Maurer,
Krzysztof Pietrzak:
Composition of Random Systems: When Two Weak Make One Strong.
TCC 2004: 410-427 |
| 75 | | Stefan Dziembowski,
Ueli M. Maurer:
Optimal Randomizer Efficiency in the Bounded-Storage Model.
J. Cryptology 17(1): 5-26 (2004) |
| 74 | | Ueli M. Maurer:
New Approaches to Digital Evidence.
Proceedings of the IEEE 92(6): 933-947 (2004) |
| 2003 |
|---|
| 73 | | Ueli M. Maurer,
Krzysztof Pietrzak:
The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations.
EUROCRYPT 2003: 544-561 |
| 72 | | Ueli M. Maurer:
Intrinsic Limitations of Digital Signatures and How to Cope with Them.
ISC 2003: 180-192 |
| 71 | | Ueli M. Maurer,
Stefan Wolf:
Secret-key agreement over unauthenticated public channels I: Definitions and a completeness result.
IEEE Transactions on Information Theory 49(4): 822-831 (2003) |
| 70 | | Ueli M. Maurer,
Stefan Wolf:
Secret-key agreement over unauthenticated public channels II: the simulatability condition.
IEEE Transactions on Information Theory 49(4): 832-838 (2003) |
| 69 | | Ueli M. Maurer,
Stefan Wolf:
Secret-key agreement over unauthenticated public channels III: Privacy amplification.
IEEE Transactions on Information Theory 49(4): 839-851 (2003) |
| 2002 |
|---|
| 68 | | Serge Fehr,
Ueli M. Maurer:
Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks.
CRYPTO 2002: 565-580 |
| 67 | | Ueli M. Maurer:
Indistinguishability of Random Systems.
EUROCRYPT 2002: 110-132 |
| 66 | | Matthias Fitzi,
Nicolas Gisin,
Ueli M. Maurer,
Oliver von Rotz:
Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch.
EUROCRYPT 2002: 482-501 |
| 65 | | Ueli M. Maurer:
Secure Multi-party Computation Made Simple.
SCN 2002: 14-28 |
| 64 | | Stefan Dziembowski,
Ueli M. Maurer:
Tight security proofs for the bounded-storage model.
STOC 2002: 341-350 |
| 2001 |
|---|
| 63 | | Martin Hirt,
Ueli M. Maurer:
Robustness for Free in Unconditional Multi-party Computation.
CRYPTO 2001: 101-118 |
| 62 | | Matthias Fitzi,
Juan A. Garay,
Ueli M. Maurer,
Rafail Ostrovsky:
Minimal Complete Primitives for Secure Multi-party Computation.
CRYPTO 2001: 80-100 |
| 61 | | Ueli M. Maurer:
Cryptography 2000±10.
Informatics 2001: 63-85 |
| 2000 |
|---|
| 60 | | Martin Hirt,
Ueli M. Maurer,
Bartosz Przydatek:
Efficient Secure Multi-party Computation.
ASIACRYPT 2000: 143-161 |
| 59 | | Ronald Cramer,
Ivan Damgård,
Ueli M. Maurer:
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme.
EUROCRYPT 2000: 316-334 |
| 58 | | Ueli M. Maurer,
Stefan Wolf:
Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free.
EUROCRYPT 2000: 351-368 |
| 57 | | Reto Kohlas,
Ueli M. Maurer:
Confidence Valuation in a Public-Key Infrastructure Based on Uncertain Evidence.
Public Key Cryptography 2000: 93-112 |
| 56 | | Matthias Fitzi,
Ueli M. Maurer:
From partial consistency to global broadcast.
STOC 2000: 494-503 |
| 55 | | Ueli M. Maurer,
Stefan Wolf:
The Diffie-Hellman Protocol.
Des. Codes Cryptography 19(2/3): 147-171 (2000) |
| 54 | | Ueli M. Maurer:
Authentication theory and hypothesis testing.
IEEE Transactions on Information Theory 46(4): 1350-1356 (2000) |
| 53 | | Martin Hirt,
Ueli M. Maurer:
Player Simulation and General Adversary Structures in Perfect Multiparty Computation.
J. Cryptology 13(1): 31-60 (2000) |
| 1999 |
|---|
| 52 | | Matthias Fitzi,
Martin Hirt,
Ueli M. Maurer:
General Adversaries in Unconditional Multi-party Computation.
ASIACRYPT 1999: 232-246 |
| 51 | | Ueli M. Maurer:
Information-Theoretic Cryptography.
CRYPTO 1999: 47-64 |
| 50 | | Bernd Altmann,
Matthias Fitzi,
Ueli M. Maurer:
Byzantine Agreement Secure against General Adversaries in the Dual Failure Model.
DISC 1999: 123-137 |
| 49 | | Reto Kohlas,
Ueli M. Maurer:
Reasoning about Public-Key Certification: On Bindings between Entities and Public Keys.
Financial Cryptography 1999: 86-103 |
| 48 | | Ueli M. Maurer:
Kryptographie: Basistechnologie der Informationsgesellschaft (Zusammenfassung).
GI Jahrestagung 1999: 15 |
| 47 | | Ueli M. Maurer,
Stefan Wolf:
Unconditionally Secure Key Agreement and the Intrinsic Conditional Information.
IEEE Transactions on Information Theory 45(2): 499-514 (1999) |
| 46 | | Ueli M. Maurer,
Stefan Wolf:
The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms.
SIAM J. Comput. 28(5): 1689-1721 (1999) |
| 1998 |
|---|
| 45 | | Matthias Fitzi,
Martin Hirt,
Ueli M. Maurer:
Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract).
CRYPTO 1998: 121-136 |
| 44 | | Matthias Fitzi,
Ueli M. Maurer:
Efficient Byzantine Agreement Secure Against General Adversaries.
DISC 1998: 134-148 |
| 43 | | Ueli M. Maurer,
Stefan Wolf:
Lower Bounds on Generic Algorithms in Groups.
EUROCRYPT 1998: 72-84 |
| 1997 |
|---|
| 42 | | Christian Cachin,
Ueli M. Maurer:
Unconditional Security Against Memory-Bounded Adversaries.
CRYPTO 1997: 292-306 |
| 41 | | Ueli M. Maurer,
Stefan Wolf:
Privacy Amplification Secure Against Active Adversaries.
CRYPTO 1997: 307-321 |
| 40 | | Ueli M. Maurer:
Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion.
EUROCRYPT 1997: 209-225 |
| 39 | | Martin Hirt,
Ueli M. Maurer:
Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation (Extended Abstract).
PODC 1997: 25-34 |
| 38 | | Christian Cachin,
Ueli M. Maurer:
Linking Information Reconciliation and Privacy Amplification.
J. Cryptology 10(2): 97-110 (1997) |
| 37 | | Jan Camenisch,
Ueli M. Maurer,
Markus Stadler:
Digital Payment Systems With Passive Anonymity-Revoking Trustees.
Journal of Computer Security 5(1): 69-90 (1997) |
| 1996 |
|---|
| 36 | | Ueli M. Maurer:
Advances in Cryptology - EUROCRYPT '96, International Conference on the Theory and Application of Cryptographic Techniques, Saragossa, Spain, May 12-16, 1996, Proceeding
Springer 1996 |
| 35 | | Daniel Bleichenbacher,
Ueli M. Maurer:
On the Efficiency of One-Time Digital Signatures.
ASIACRYPT 1996: 145-158 |
| 34 | | Ueli M. Maurer,
Stefan Wolf:
Towards Characterizing When Information-Theoretic Secret Key Agreement Is Possible.
ASIACRYPT 1996: 196-209 |
| 33 | | Ueli M. Maurer,
Stefan Wolf:
Diffie-Hellman Oracles.
CRYPTO 1996: 268-282 |
| 32 | | Ueli M. Maurer:
Modelling a Public-Key Infrastructure.
ESORICS 1996: 325-350 |
| 31 | | Jan Camenisch,
Ueli M. Maurer,
Markus Stadler:
Digital Payment Systems with Passive Anonymity-Revoking Trustees.
ESORICS 1996: 33-43 |
| 30 | | Daniel Bleichenbacher,
Ueli M. Maurer:
Optimal Tree-Based One-Time Digital Signature Schemes.
STACS 1996: 363-374 |
| 29 | | Ueli M. Maurer:
A Unified and Generalized Treatment of Authentification Theory.
STACS 1996: 387-398 |
| 28 | | Ueli M. Maurer,
Yacov Yacobi:
A Non-interactive Public-Key Distribution System.
Des. Codes Cryptography 9(3): 305-316 (1996) |
| 27 | | Ueli M. Maurer,
Pierre E. Schmid:
A Calculus for Security Bootstrapping in Distributed Systems.
Journal of Computer Security 4(1): 55-80 (1996) |
| 1995 |
|---|
| 26 | | Ueli M. Maurer:
On the Oracle Complexity of Factoring Integers.
Computational Complexity 5(3/4): 237-247 (1995) |
| 25 | | Charles H. Bennett,
Gilles Brassard,
Claude Crépeau,
Ueli M. Maurer:
Generalized privacy amplification.
IEEE Transactions on Information Theory 41(6): 1915-1923 (1995) |
| 24 | | Ueli M. Maurer:
Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters.
J. Cryptology 8(3): 123-155 (1995) |
| 1994 |
|---|
| 23 | | Ueli M. Maurer:
Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Algorithms
CRYPTO 1994: 271-281 |
| 22 | | Daniel Bleichenbacher,
Ueli M. Maurer:
Directed Acyclic Graphs, One-way Functions and Digital Signatures.
CRYPTO 1994: 75-82 |
| 21 | | Ueli M. Maurer,
Pierre E. Schmid:
A Calculus for Secure Channel Establishment in Open Networks.
ESORICS 1994: 175-192 |
| 20 | | Christian Cachin,
Ueli M. Maurer:
Linking Information Reconciliation and Privacy Amplification (Extended Abstract).
EUROCRYPT 1994: 266-274 |
| 1993 |
|---|
| 19 | | Ueli M. Maurer:
Secret key agreement by public discussion from common information.
IEEE Transactions on Information Theory 39(3): 733-742 (1993) |
| 18 | | Ueli M. Maurer,
James L. Massey:
Cascade Ciphers: The Importance of Being First.
J. Cryptology 6(1): 55-61 (1993) |
| 1992 |
|---|
| 17 | | Ueli M. Maurer:
Protocols for Secret Key Agreement by Public Discussion Based on Common Information.
CRYPTO 1992: 461-470 |
| 16 | | Ueli M. Maurer:
A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generator.
EUROCRYPT 1992: 239-255 |
| 15 | | Ueli M. Maurer:
Factoring with an Oracle.
EUROCRYPT 1992: 429-436 |
| 14 | | Ueli M. Maurer,
Yacov Yacobi:
A Remark on a Non-interactive Public-Key Distribution System.
EUROCRYPT 1992: 458-460 |
| 13 | | Ueli M. Maurer:
Asymptotically-Tight Bounds on the Number of Cycles in Generalized de Bruijn-Good Graphs.
Discrete Applied Mathematics 37/38: 421-436 (1992) |
| 12 | | Ueli M. Maurer:
Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher.
J. Cryptology 5(1): 53-66 (1992) |
| 11 | | Ueli M. Maurer:
A Universal Statistical Test for Random Bit Generators.
J. Cryptology 5(2): 89-105 (1992) |
| 1991 |
|---|
| 10 | | Kenji Koyama,
Ueli M. Maurer,
Tatsuaki Okamoto,
Scott A. Vanstone:
New Public-Key Schemes Based on Elliptic Curves over the Ring Zn.
CRYPTO 1991: 252-266 |
| 9 | | Ueli M. Maurer:
New Approaches to the Design of Self-Synchronizing Stream Ciphers.
EUROCRYPT 1991: 458-471 |
| 8 | | Ueli M. Maurer,
Yacov Yacobi:
Non-interactive Public-Key Cryptography.
EUROCRYPT 1991: 498-507 |
| 7 | | Ueli M. Maurer:
Perfect Cryptographic Security from Partially Independent Channels
STOC 1991: 561-571 |
| 6 | | Ueli M. Maurer,
James L. Massey:
Local Randomness in Pseudorandom Sequences.
J. Cryptology 4(2): 135-149 (1991) |
| 1990 |
|---|
| 5 | | Ueli M. Maurer:
A Universal Statistical Test for Random Bit Generators.
CRYPTO 1990: 409-420 |
| 4 | | Ueli M. Maurer:
A Provably-Secure Strongly-Randomized Cipher.
EUROCRYPT 1990: 361-373 |
| 1989 |
|---|
| 3 | | Ueli M. Maurer,
James L. Massey:
Perfect Local Randomness in Pseudo-Random Sequences.
CRYPTO 1989: 100-112 |
| 2 | | Ueli M. Maurer:
Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity.
EUROCRYPT 1989: 636-647 |
| 1987 |
|---|
| 1 | | James L. Massey,
Ueli M. Maurer,
Muzhong Wang:
Non-Expanding, Key-Minimal, Robustly-Perfect, Linear and Bilinear Ciphers.
EUROCRYPT 1987: 237-247 |
