Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Ueli Maurer
Ueli M. Maurer
2010 – today
- 2013
[c103]Martin Hirt, Christoph Lucas, Ueli Maurer: A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation. CRYPTO (2) 2013: 203-219- [c102]Gregory Demay, Peter Gazi, Martin Hirt, Ueli Maurer: Resource-Restricted Indifferentiability. EUROCRYPT 2013: 664-683
- [c101]
- [c100]
- [c99]
- [c98]Ueli Maurer: Conditional equivalence of random systems and indistinguishability proofs. ISIT 2013: 3150-3154
- [c97]Markulf Kohlweiss, Ueli Maurer, Cristina Onete, Björn Tackmann, Daniele Venturi: Anonymity-Preserving Public-Key Encryption: A Constructive Approach. Privacy Enhancing Technologies 2013: 19-39
- [c96]Jonathan Katz, Ueli Maurer, Björn Tackmann, Vassilis Zikas: Universally Composable Synchronous Computation. TCC 2013: 477-498
- [i25]Markulf Kohlweiss, Ueli Maurer, Cristina Onete, Björn Tackmann, Daniele Venturi: Anonymity-preserving Public-Key Encryption: A Constructive Approach. IACR Cryptology ePrint Archive 2013: 238 (2013)
- [i24]Martin Hirt, Ueli Maurer, Christoph Lucas: A Dynamic Tradeoff Between Active and Passive Corruptions in Secure Multi-Party Computation. IACR Cryptology ePrint Archive 2013: 349 (2013)
- [i23]Juan A. Garay, Jonathan Katz, Ueli Maurer, Björn Tackmann, Vassilis Zikas: Rational Protocol Design: Cryptography Against Incentive-driven Adversaries. IACR Cryptology ePrint Archive 2013: 496 (2013)
- [i22]Ueli Maurer, Björn Tackmann, Sandro Coretti: Key Exchange with Unilateral Authentication: Composable Security Definition and Modular Protocol Design. IACR Cryptology ePrint Archive 2013: 555 (2013)
- [i21]Christian Matt, Ueli Maurer: A Constructive Approach to Functional Encryption. IACR Cryptology ePrint Archive 2013: 559 (2013)
- 2012
- [c95]Joël Alwen, Jonathan Katz, Ueli Maurer, Vassilis Zikas: Collusion-Preserving Computation. CRYPTO 2012: 124-143
- [c94]Martin Hirt, Christoph Lucas, Ueli Maurer, Dominik Raub: Passive Corruption in Statistical Multi-Party Computation - (Extended Abstract). ICITS 2012: 129-146
- [c93]
- [c92]Kfir Barhum, Ueli Maurer: UOWHFs from OWFs: Trading Regularity for Efficiency. LATINCRYPT 2012: 234-253
- [c91]Ueli Maurer, Andreas Rüedlinger, Björn Tackmann: Confidentiality and Integrity: A Constructive Perspective. TCC 2012: 209-229
- [i20]Martin Hirt, Christoph Lucas, Ueli Maurer, Dominik Raub: Passive Corruption in Statistical Multi-Party Computation. IACR Cryptology ePrint Archive 2012: 272 (2012)
- [i19]Gregory Demay, Peter Gazi, Martin Hirt, Ueli Maurer: Resource-Restricted Indifferentiability. IACR Cryptology ePrint Archive 2012: 613 (2012)
- 2011
- [c90]Divesh Aggarwal, Ueli Maurer: The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy. ASIACRYPT 2011: 686-701
- [c89]Ghassan Karame, Srdjan Capkun, Ueli Maurer: Privacy-preserving outsourcing of brute-force key searches. CCSW 2011: 101-112
- [c88]Martin Hirt, Christoph Lucas, Ueli Maurer, Dominik Raub: Graceful Degradation in Multi-Party Computation (Extended Abstract). ICITS 2011: 163-180
- [c87]
- [c86]Ueli Maurer: Constructive Cryptography - A New Paradigm for Security Definitions and Proofs. TOSCA 2011: 33-56
- [i18]Marc Fischlin, Anna Lysyanskaya, Ueli Maurer, Alexander May: Public-Key Cryptography (Dagstuhl Seminar 11391). Dagstuhl Reports 1(9): 76-94 (2011)
- [i17]Martin Hirt, Christoph Lucas, Ueli Maurer, Dominik Raub: Graceful Degradation in Multi-Party Computation. IACR Cryptology ePrint Archive 2011: 94 (2011)
- [i16]Jonathan Katz, Ueli Maurer, Björn Tackmann, Vassilis Zikas: Universally Composable Synchronous Computation. IACR Cryptology ePrint Archive 2011: 310 (2011)
- [i15]Joël Alwen, Jonathan Katz, Ueli Maurer, Vassilis Zikas: Collusion-Preserving Computation. IACR Cryptology ePrint Archive 2011: 433 (2011)
- 2010
- [c85]Ueli Maurer, Björn Tackmann: On the soundness of authenticate-then-encrypt: formalizing the malleability of symmetric encryption. ACM Conference on Computer and Communications Security 2010: 505-515
- [c84]
- [c83]Christoph Lucas, Dominik Raub, Ueli M. Maurer: Hybrid-secure MPC: trading information-theoretic robustness for computational privacy. PODC 2010: 219-228
- [c82]Ueli M. Maurer, Stefano Tessaro: A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch. TCC 2010: 237-254
2000 – 2009
- 2009
- [c81]
- [c80]
- [c79]Ueli M. Maurer, Stefano Tessaro: Computational Indistinguishability Amplification: Tight Product Theorems for System Composition. CRYPTO 2009: 355-373
- [c78]
- [c77]Divesh Aggarwal, Ueli M. Maurer: Breaking RSA Generically Is Equivalent to Factoring. EUROCRYPT 2009: 36-53
- [c76]Peter Gazi, Ueli Maurer: Free-Start Distinguishing: Combining Two Types of Indistinguishability Amplification. ICITS 2009: 28-44
- [c75]
- [c74]Vassilis Zikas, Sarah Hauser, Ueli M. Maurer: Realistic Failures in Secure Multi-party Computation. TCC 2009: 274-293
- [i14]Christoph Lucas, Dominik Raub, Ueli Maurer: Hybrid-Secure MPC: Trading Information-Theoretic Robustness for Computational Privacy. IACR Cryptology ePrint Archive 2009: 9 (2009)
- [i13]Peter Gazi, Ueli Maurer: Cascade Encryption Revisited. IACR Cryptology ePrint Archive 2009: 93 (2009)
- [i12]Ueli Maurer, Stefano Tessaro: Computational Indistinguishability Amplification: Tight Product Theorems for System Composition. IACR Cryptology ePrint Archive 2009: 396 (2009)
- 2008
- [j30]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)
- [j29]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)
- [c73]Martin Hirt, Ueli M. Maurer, Vassilis Zikas: MPC vs. SFE : Unconditional and Computational Security. ASIACRYPT 2008: 1-18
- [c72]Ueli M. Maurer, Stefano Tessaro: Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography. ASIACRYPT 2008: 161-178
- [c71]
- [c70]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
- [e2]Johannes Blömer, Dan Boneh, Ronald Cramer, Ueli M. Maurer (Eds.): Cryptography, 16.09. - 21.09.2007. Dagstuhl Seminar Proceedings 07381, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008
- [i11]Divesh Aggarwal, Ueli Maurer: Breaking RSA Generically is Equivalent to Factoring. IACR Cryptology ePrint Archive 2008: 260 (2008)
- 2007
- [c69]Ueli M. Maurer, Dominik Raub: Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations. ASIACRYPT 2007: 427-443
- [c68]Ueli M. Maurer, Krzysztof Pietrzak, Renato Renner: Indistinguishability Amplification. CRYPTO 2007: 130-149
- [c67]Ueli M. Maurer, Stefano Tessaro: Domain Extension of Public Random Functions: Beyond the Birthday Barrier. CRYPTO 2007: 187-204
- [c66]Johannes Blömer, Dan Boneh, Ronald Cramer, Ueli M. Maurer: 07381 Executive Summary - Cryptography. Cryptography 2007
- [c65]Johannes Blömer, Dan Boneh, Ronald Cramer, Ueli M. Maurer: 07381 Abstracts Collection -- Cryptography. Cryptography 2007
- [c64]Ueli M. Maurer, Johan Sjödin: A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security. EUROCRYPT 2007: 498-516
- [i10]
- [i9]Zuzana Beerliová-Trubíniová, Matthias Fitzi, Martin Hirt, Ueli Maurer, Vassilis Zikas: MPC vs. SFE: Perfect Security in a Unified Corruption Model. IACR Cryptology ePrint Archive 2007: 78 (2007)
- [i8]Ueli Maurer, Dominik Raub: Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations. IACR Cryptology ePrint Archive 2007: 89 (2007)
- [i7]Ueli Maurer, Stefano Tessaro: Domain Extension of Public Random Functions: Beyond the Birthday Barrier. IACR Cryptology ePrint Archive 2007: 229 (2007)
- 2006
- [j28]Ueli M. Maurer: Secure multi-party computation made simple. Discrete Applied Mathematics 154(2): 370-381 (2006)
- [c63]Ueli M. Maurer, Yvonne Anne Oswald, Krzysztof Pietrzak, Johan Sjödin: Luby-Rackoff Ciphers from Weak Round Functions? EUROCRYPT 2006: 391-408
- [i6]Ueli Maurer, Johan Sjödin: A Fast and Key-Efficient Reduction of Chosen- Ciphertext to Known-Plaintext Security. IACR Cryptology ePrint Archive 2006: 71 (2006)
- [i5]Ueli Maurer, Yvonne Anne Oswald, Krzysztof Pietrzak, Johan Sjödin: Luby-Rackoff Ciphers from Weak Round Functions? IACR Cryptology ePrint Archive 2006: 213 (2006)
- [i4]Ueli Maurer, Krzysztof Pietrzak, Renato Renner: Indistinguishability Amplification. IACR Cryptology ePrint Archive 2006: 456 (2006)
- 2005
- [j27]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)
- [j26]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)
- [j25]Robert König, Ueli M. Maurer, Renato Renner: On the power of quantum memory. IEEE Transactions on Information Theory 51(7): 2391-2401 (2005)
- [c62]
- [c61]
- [c60]Ueli M. Maurer, Johan Sjödin: Domain Expansion of MACs: Alternative Uses of the FIL-MAC. IMA Int. Conf. 2005: 168-185
- [c59]Robert König, Ueli M. Maurer: Generalized Strong Extractors and Deterministic Privacy Amplification. IMA Int. Conf. 2005: 322-339
- [c58]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
- 2004
- [j24]Stefan Dziembowski, Ueli M. Maurer: Optimal Randomizer Efficiency in the Bounded-Storage Model. J. Cryptology 17(1): 5-26 (2004)
- [j23]
- [c57]Thomas Holenstein, Ueli M. Maurer, Johan Sjödin: Complete Classification of Bilinear Hard-Core Functions. CRYPTO 2004: 73-91
- [c56]Stefan Dziembowski, Ueli M. Maurer: On Generating the Initial Key in the Bounded-Storage Model. EUROCRYPT 2004: 126-137
- [c55]
- [c54]Ueli M. Maurer, Renato Renner, Clemens Holenstein: Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology. TCC 2004: 21-39
- [c53]Ueli M. Maurer, Krzysztof Pietrzak: Composition of Random Systems: When Two Weak Make One Strong. TCC 2004: 410-427
- [c52]
- 2003
- [j22]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)
- [j21]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)
- [j20]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)
- [c51]Ueli M. Maurer, Krzysztof Pietrzak: The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations. EUROCRYPT 2003: 544-561
- [c50]Ueli M. Maurer: Intrinsic Limitations of Digital Signatures and How to Cope with Them. ISC 2003: 180-192
- [i3]Ueli Maurer, Renato Renner, Clemens Holenstein: Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology. IACR Cryptology ePrint Archive 2003: 161 (2003)
- 2002
- [c49]Serge Fehr, Ueli M. Maurer: Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks. CRYPTO 2002: 565-580
- [c48]
- [c47]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
- [c46]
- [c45]Stefan Dziembowski, Ueli M. Maurer: Tight security proofs for the bounded-storage model. STOC 2002: 341-350
- 2001
- [c44]Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Rafail Ostrovsky: Minimal Complete Primitives for Secure Multi-party Computation. CRYPTO 2001: 80-100
- [c43]Martin Hirt, Ueli M. Maurer: Robustness for Free in Unconditional Multi-party Computation. CRYPTO 2001: 101-118
- [c42]
- [i2]Martin Hirt, Ueli Maurer: Robustness for Free in Unconditional Multi-Party Computation. IACR Cryptology ePrint Archive 2001: 23 (2001)
- 2000
- [j19]Ueli M. Maurer, Stefan Wolf: The Diffie-Hellman Protocol. Des. Codes Cryptography 19(2/3): 147-171 (2000)
- [j18]Martin Hirt, Ueli M. Maurer: Player Simulation and General Adversary Structures in Perfect Multiparty Computation. J. Cryptology 13(1): 31-60 (2000)
- [j17]Reto Kohlas, Ueli Maurer: Reasoning about public-key certification: on bindings between entities and public keys. IEEE Journal on Selected Areas in Communications 18(4): 551-560 (2000)
- [j16]Ueli M. Maurer: Authentication theory and hypothesis testing. IEEE Transactions on Information Theory 46(4): 1350-1356 (2000)
- [c41]Martin Hirt, Ueli M. Maurer, Bartosz Przydatek: Efficient Secure Multi-party Computation. ASIACRYPT 2000: 143-161
- [c40]Ronald Cramer, Ivan Damgård, Ueli M. Maurer: General Secure Multi-party Computation from any Linear Secret-Sharing Scheme. EUROCRYPT 2000: 316-334
- [c39]Ueli M. Maurer, Stefan Wolf: Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free. EUROCRYPT 2000: 351-368
- [c38]Reto Kohlas, Ueli M. Maurer: Confidence Valuation in a Public-Key Infrastructure Based on Uncertain Evidence. Public Key Cryptography 2000: 93-112
- [c37]
- [i1]Ronald Cramer, Ivan Damgård, Ueli Maurer: General Secure Multi-Party Computation from any Linear Secret Sharing Scheme. IACR Cryptology ePrint Archive 2000: 37 (2000)
1990 – 1999
- 1999
- [j15]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)
- [j14]Ueli M. Maurer, Stefan Wolf: Unconditionally Secure Key Agreement and the Intrinsic Conditional Information. IEEE Transactions on Information Theory 45(2): 499-514 (1999)
- [c36]Matthias Fitzi, Martin Hirt, Ueli M. Maurer: General Adversaries in Unconditional Multi-party Computation. ASIACRYPT 1999: 232-246
- [c35]
- [c34]Reto Kohlas, Ueli M. Maurer: Reasoning about Public-Key Certification: On Bindings between Entities and Public Keys. Financial Cryptography 1999: 86-103
- [c33]Ueli M. Maurer: Kryptographie: Basistechnologie der Informationsgesellschaft (Zusammenfassung). GI Jahrestagung 1999: 15
- [c32]Bernd Altmann, Matthias Fitzi, Ueli M. Maurer: Byzantine Agreement Secure against General Adversaries in the Dual Failure Model. DISC 1999: 123-137
- 1998
- [c31]Matthias Fitzi, Martin Hirt, Ueli M. Maurer: Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract). CRYPTO 1998: 121-136
- [c30]
- [c29]Matthias Fitzi, Ueli M. Maurer: Efficient Byzantine Agreement Secure Against General Adversaries. DISC 1998: 134-148
- 1997
- [j13]Jan Camenisch, Ueli M. Maurer, Markus Stadler: Digital Payment Systems With Passive Anonymity-Revoking Trustees. Journal of Computer Security 5(1): 69-90 (1997)
- [j12]Christian Cachin, Ueli M. Maurer: Linking Information Reconciliation and Privacy Amplification. J. Cryptology 10(2): 97-110 (1997)
- [c28]Christian Cachin, Ueli M. Maurer: Unconditional Security Against Memory-Bounded Adversaries. CRYPTO 1997: 292-306
- [c27]Ueli M. Maurer, Stefan Wolf: Privacy Amplification Secure Against Active Adversaries. CRYPTO 1997: 307-321
- [c26]Ueli M. Maurer: Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion. EUROCRYPT 1997: 209-225
- [c25]Martin Hirt, Ueli M. Maurer: Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation (Extended Abstract). PODC 1997: 25-34
- 1996
- [j11]Ueli M. Maurer, Yacov Yacobi: A Non-interactive Public-Key Distribution System. Des. Codes Cryptography 9(3): 305-316 (1996)
- [j10]Ueli M. Maurer, Pierre E. Schmid: A Calculus for Security Bootstrapping in Distributed Systems. Journal of Computer Security 4(1): 55-80 (1996)
- [c24]Daniel Bleichenbacher, Ueli M. Maurer: On the Efficiency of One-Time Digital Signatures. ASIACRYPT 1996: 145-158
- [c23]Ueli M. Maurer, Stefan Wolf: Towards Characterizing When Information-Theoretic Secret Key Agreement Is Possible. ASIACRYPT 1996: 196-209
- [c22]
- [c21]Jan Camenisch, Ueli M. Maurer, Markus Stadler: Digital Payment Systems with Passive Anonymity-Revoking Trustees. ESORICS 1996: 33-43
- [c20]
- [c19]Daniel Bleichenbacher, Ueli M. Maurer: Optimal Tree-Based One-Time Digital Signature Schemes. STACS 1996: 363-374
- [c18]
- [e1]Ueli M. Maurer (Ed.): Advances in Cryptology - EUROCRYPT '96, International Conference on the Theory and Application of Cryptographic Techniques, Saragossa, Spain, May 12-16, 1996, Proceeding. Lecture Notes in Computer Science 1070, Springer 1996, ISBN 3-540-61186-X
- 1995
- [j9]Ueli M. Maurer: On the Oracle Complexity of Factoring Integers. Computational Complexity 5(3/4): 237-247 (1995)
- [j8]Ueli M. Maurer: Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters. J. Cryptology 8(3): 123-155 (1995)
- [j7]Charles H. Bennett, Gilles Brassard, Claude Crépeau, Ueli M. Maurer: Generalized privacy amplification. IEEE Transactions on Information Theory 41(6): 1915-1923 (1995)
- 1994
- [c17]Daniel Bleichenbacher, Ueli M. Maurer: Directed Acyclic Graphs, One-way Functions and Digital Signatures. CRYPTO 1994: 75-82
- [c16]Ueli M. Maurer: Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Algorithms. CRYPTO 1994: 271-281
- [c15]Ueli M. Maurer, Pierre E. Schmid: A Calculus for Secure Channel Establishment in Open Networks. ESORICS 1994: 175-192
- [c14]Christian Cachin, Ueli M. Maurer: Linking Information Reconciliation and Privacy Amplification (Extended Abstract). EUROCRYPT 1994: 266-274
- 1993
- [j6]Ueli M. Maurer, James L. Massey: Cascade Ciphers: The Importance of Being First. J. Cryptology 6(1): 55-61 (1993)
- [j5]Ueli M. Maurer: Secret key agreement by public discussion from common information. IEEE Transactions on Information Theory 39(3): 733-742 (1993)
- 1992
- [j4]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)
- [j3]Ueli M. Maurer: Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher. J. Cryptology 5(1): 53-66 (1992)
- [j2]Ueli M. Maurer: A Universal Statistical Test for Random Bit Generators. J. Cryptology 5(2): 89-105 (1992)
- [c13]Ueli M. Maurer: Protocols for Secret Key Agreement by Public Discussion Based on Common Information. CRYPTO 1992: 461-470
- [c12]Ueli M. Maurer: A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generator. EUROCRYPT 1992: 239-255
- [c11]
- [c10]Ueli M. Maurer, Yacov Yacobi: A Remark on a Non-interactive Public-Key Distribution System. EUROCRYPT 1992: 458-460
- 1991
- [j1]Ueli M. Maurer, James L. Massey: Local Randomness in Pseudorandom Sequences. J. Cryptology 4(2): 135-149 (1991)
- [c9]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
- [c8]Ueli M. Maurer: New Approaches to the Design of Self-Synchronizing Stream Ciphers. EUROCRYPT 1991: 458-471
- [c7]
- [c6]Ueli M. Maurer: Perfect Cryptographic Security from Partially Independent Channels. STOC 1991: 561-571
- 1990
- [c5]
- [c4]
1980 – 1989
- 1989
- [c3]Ueli M. Maurer, James L. Massey: Perfect Local Randomness in Pseudo-Random Sequences. CRYPTO 1989: 100-112
- [c2]Ueli M. Maurer: Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity. EUROCRYPT 1989: 636-647
- 1987
- [c1]James L. Massey, Ueli M. Maurer, Muzhong Wang: Non-Expanding, Key-Minimal, Robustly-Perfect, Linear and Bilinear Ciphers. EUROCRYPT 1987: 237-247
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-15 21:38 CEST by the dblp team