![](https://dblp.org/img/logo.320x120.png)
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://rp.liu233w.com/img/search.dark.16x16.png)
default search action
Ueli Maurer
2020 – today
- 2024
- [j37]Christian Badertscher, Ueli Maurer, Daniel Tschudi, Vassilis Zikas:
Bitcoin as a Transaction Ledger: A Composable Treatment. J. Cryptol. 37(2): 18 (2024) - [c164]Fabio Banfi
, Konstantin Gegier
, Martin Hirt, Ueli Maurer, Guilherme Rito
:
Anamorphic Encryption, Revisited. EUROCRYPT (2) 2024: 3-32 - 2023
- [c163]Suvradip Chakraborty
, Dennis Hofheinz, Ueli Maurer, Guilherme Rito
:
Deniable Authentication When Signing Keys Leak. EUROCRYPT (3) 2023: 69-100 - [i79]Suvradip Chakraborty, Dennis Hofheinz, Ueli Maurer, Guilherme Rito:
Deniable Authentication when Signing Keys Leak. IACR Cryptol. ePrint Arch. 2023: 213 (2023) - [i78]Fabio Banfi, Konstantin Gegier, Martin Hirt, Ueli Maurer:
Anamorphic Encryption, Revisited. IACR Cryptol. ePrint Arch. 2023: 249 (2023) - [i77]Fabio Banfi, Ueli Maurer, Silvia Ritsch:
On the Security of Universal Re-Encryption. IACR Cryptol. ePrint Arch. 2023: 1165 (2023) - 2022
- [c162]Chen-Da Liu-Zhang
, Christian Matt
, Ueli Maurer, Guilherme Rito
, Søren Eller Thomsen
:
Practical Provably Secure Flooding for Blockchains. ASIACRYPT (1) 2022: 774-805 - [c161]Ueli Maurer, Christopher Portmann, Guilherme Rito
:
Multi-Designated Receiver Signed Public Key Encryption. EUROCRYPT (2) 2022: 644-673 - [c160]Fabio Banfi
, Ueli Maurer:
Anonymous Authenticated Communication. SCN 2022: 289-312 - [i76]Ueli Maurer, Christopher Portmann, Guilherme Rito:
Multi-Designated Receiver Signed Public Key Encryption. IACR Cryptol. ePrint Arch. 2022: 256 (2022) - [i75]Chen-Da Liu-Zhang, Christian Matt, Ueli Maurer, Guilherme Rito, Søren Eller Thomsen:
Practical Provably Secure Flooding for Blockchains. IACR Cryptol. ePrint Arch. 2022: 608 (2022) - 2021
- [c159]Ueli Maurer, Christopher Portmann, Guilherme Rito
:
Giving an Adversary Guarantees (Or: How to Model Designated Verifier Signatures in a Composable Framework). ASIACRYPT (3) 2021: 189-219 - [c158]David A. Basin, Andreas Lochbihler, Ueli Maurer, S. Reza Sefidgar:
Abstract Modeling of System Communication in Constructive Cryptography using CryptHOL. CSF 2021: 1-16 - [c157]Christian Badertscher
, Ueli Maurer, Christopher Portmann, Guilherme Rito
:
Revisiting (R)CCA Security and Replay Protection. Public Key Cryptography (2) 2021: 173-202 - [c156]Christian Badertscher
, Daniel Jost
, Ueli Maurer:
Generalized Proofs of Knowledge with Fully Dynamic Setup. TCC (1) 2021: 499-528 - [c155]David Lanzenberger, Ueli Maurer:
Direct Product Hardness Amplification. TCC (2) 2021: 605-625 - [c154]Martin Hirt, Chen-Da Liu-Zhang, Ueli Maurer:
Adaptive Security of Multi-party Protocols, Revisited. TCC (1) 2021: 686-716 - [i74]Onur Günlü, Ueli Maurer, João Ribeiro:
Effects of Quantization on the Multiple-Round Secret-Key Capacity. CoRR abs/2105.01350 (2021) - [i73]Andrés Fábrega, Ueli Maurer, Marta Mularczyk:
A Fresh Approach to Updatable Symmetric Encryption. IACR Cryptol. ePrint Arch. 2021: 559 (2021) - [i72]Onur Günlü, Ueli Maurer, João Ribeiro:
Effects of Quantization on the Multiple-Round Secret-Key Capacity. IACR Cryptol. ePrint Arch. 2021: 584 (2021) - [i71]Martin Hirt, Chen-Da Liu-Zhang, Ueli Maurer:
Adaptive Security of Multi-Party Protocols, Revisited. IACR Cryptol. ePrint Arch. 2021: 1175 (2021) - [i70]Ueli Maurer, Christopher Portmann, Guilherme Rito:
Giving an Adversary Guarantees (Or: How to Model Designated Verifier Signatures in a Composable Framework). IACR Cryptol. ePrint Arch. 2021: 1185 (2021) - [i69]David Lanzenberger, Ueli Maurer:
Direct Product Hardness Amplification. IACR Cryptol. ePrint Arch. 2021: 1229 (2021) - [i68]Fabio Banfi, Ueli Maurer:
Composable Notions for Anonymous and Authenticated Communication. IACR Cryptol. ePrint Arch. 2021: 1581 (2021) - 2020
- [j36]Sandro Coretti, Yevgeniy Dodis, Ueli Maurer, Björn Tackmann, Daniele Venturi:
Non-malleable Encryption: Simpler, Shorter, Stronger. J. Cryptol. 33(4): 1984-2033 (2020) - [c153]Chen-Da Liu-Zhang
, Julian Loss, Ueli Maurer, Tal Moran, Daniel Tschudi:
MPC with Synchronous Security and Asynchronous Responsiveness. ASIACRYPT (3) 2020: 92-119 - [c152]Daniel Jost
, Ueli Maurer:
Overcoming Impossibility Results in Composable Security Using Interval-Wise Guarantees. CRYPTO (1) 2020: 33-62 - [c151]Chen-Da Liu-Zhang
, Varun Maram
, Ueli Maurer:
On Broadcast in Generalized Network and Adversarial Models. OPODIS 2020: 25:1-25:16 - [c150]Rio LaVigne, Chen-Da Liu Zhang
, Ueli Maurer, Tal Moran, Marta Mularczyk, Daniel Tschudi
:
Topology-Hiding Computation for Networks with Unknown Delays. Public Key Cryptography (2) 2020: 215-245 - [c149]Fabio Banfi
, Ueli Maurer:
Anonymous Symmetric-Key Communication. SCN 2020: 471-491 - [c148]David Lanzenberger, Ueli Maurer:
Coupling of Random Systems. TCC (3) 2020: 207-240 - [c147]Chen-Da Liu-Zhang
, Ueli Maurer:
Synchronous Constructive Cryptography. TCC (2) 2020: 439-472 - [i67]Fabio Banfi, Ueli Maurer:
Anonymous Symmetric-Key Communication. IACR Cryptol. ePrint Arch. 2020: 73 (2020) - [i66]Daniel Jost, Ueli Maurer:
Overcoming Impossibility Results in Composable Security using Interval-Wise Guarantees. IACR Cryptol. ePrint Arch. 2020: 92 (2020) - [i65]Christian Badertscher, Ueli Maurer, Christopher Portmann, Guilherme Rito:
Revisiting (R)CCA Security and Replay Protection. IACR Cryptol. ePrint Arch. 2020: 177 (2020) - [i64]Ueli Maurer, Christopher Portmann, Jiamin Zhu:
Unifying Generic Group Models. IACR Cryptol. ePrint Arch. 2020: 996 (2020) - [i63]David Lanzenberger, Ueli Maurer:
Coupling of Random Systems. IACR Cryptol. ePrint Arch. 2020: 1187 (2020) - [i62]Chen-Da Liu-Zhang, Ueli Maurer:
Synchronous Constructive Cryptography. IACR Cryptol. ePrint Arch. 2020: 1226 (2020) - [i61]Chen-Da Liu-Zhang, Varun Maram, Ueli Maurer:
On Broadcast in Generalized Network and Adversarial Models. IACR Cryptol. ePrint Arch. 2020: 1408 (2020)
2010 – 2019
- 2019
- [j35]Grégory Demay, Peter Gazi, Ueli Maurer, Björn Tackmann:
Per-session security: Password-based cryptography revisited. J. Comput. Secur. 27(1): 75-111 (2019) - [c146]Andreas Lochbihler, S. Reza Sefidgar, David A. Basin, Ueli Maurer:
Formalizing Constructive Cryptography using CryptHOL. CSF 2019: 152-166 - [c145]Daniel Jost
, Ueli Maurer, Marta Mularczyk:
Efficient Ratcheting: Almost-Optimal Guarantees for Secure Messaging. EUROCRYPT (1) 2019: 159-188 - [c144]Daniel Jost
, Ueli Maurer, Marta Mularczyk
:
A Unified and Composable Take on Ratcheting. TCC (2) 2019: 180-210 - [c143]Fabio Banfi
, Ueli Maurer, Christopher Portmann
, Jiamin Zhu
:
Composable and Finite Computational Security of Quantum Message Transmission. TCC (1) 2019: 282-311 - [c142]Chen-Da Liu Zhang
, Varun Maram
, Ueli Maurer:
Brief Announcement: Towards Byzantine Broadcast in Generalized Communication and Adversarial Models. DISC 2019: 47:1-47:3 - [i60]Fabio Banfi, Ueli Maurer, Christopher Portmann, Jiamin Zhu:
Composable and Finite Computational Security of Quantum Message Transmission. CoRR abs/1908.03436 (2019) - [i59]Chen-Da Liu Zhang, Julian Loss, Ueli Maurer, Tal Moran, Daniel Tschudi:
Robust MPC: Asynchronous Responsiveness yet Synchronous Security. IACR Cryptol. ePrint Arch. 2019: 159 (2019) - [i58]Christian Badertscher, Daniel Jost, Ueli Maurer:
Agree-and-Prove: Generalized Proofs Of Knowledge and Applications. IACR Cryptol. ePrint Arch. 2019: 662 (2019) - [i57]Daniel Jost, Ueli Maurer, Marta Mularczyk:
A Unified and Composable Take on Ratcheting. IACR Cryptol. ePrint Arch. 2019: 694 (2019) - [i56]Fabio Banfi, Ueli Maurer, Christopher Portmann, Jiamin Zhu:
Composable and Finite Computational Security of Quantum Message Transmission. IACR Cryptol. ePrint Arch. 2019: 914 (2019) - [i55]Rio LaVigne, Chen-Da Liu Zhang, Ueli Maurer, Tal Moran, Marta Mularczyk, Daniel Tschudi:
Topology-Hiding Computation for Networks with Unknown Delays. IACR Cryptol. ePrint Arch. 2019: 1211 (2019) - 2018
- [j34]Christian Matt
, Ueli Maurer, Christopher Portmann, Renato Renner, Björn Tackmann:
Toward an algebraic theory of systems. Theor. Comput. Sci. 747: 1-25 (2018) - [c141]Christian Badertscher
, Ueli Maurer:
Composable and Robust Outsourced Storage. CT-RSA 2018: 354-373 - [c140]Christian Badertscher
, Juan A. Garay, Ueli Maurer, Daniel Tschudi
, Vassilis Zikas:
But Why Does It Work? A Rational Protocol Design Treatment of Bitcoin. EUROCRYPT (2) 2018: 34-65 - [c139]Christian Badertscher
, Ueli Maurer, Björn Tackmann:
On Composable Security for Digital Signatures. Public Key Cryptography (1) 2018: 494-523 - [c138]Daniel Jost
, Ueli Maurer:
Security Definitions for Hash Functions: Combining UCE and Indifferentiability. SCN 2018: 83-101 - [c137]Christian Badertscher
, Fabio Banfi
, Ueli Maurer:
A Constructive Perspective on Signcryption Security. SCN 2018: 102-120 - [c136]Rio LaVigne, Chen-Da Liu Zhang
, Ueli Maurer, Tal Moran, Marta Mularczyk
, Daniel Tschudi
:
Topology-Hiding Computation Beyond Semi-Honest Adversaries. TCC (2) 2018: 3-35 - [c135]Daniel Jost
, Ueli Maurer, João L. Ribeiro
:
Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio. TCC (1) 2018: 345-369 - [c134]Julian Loss, Ueli Maurer, Daniel Tschudi
:
Strong Separations Between Broadcast and Authenticated Channels. DISC 2018: 36:1-36:17 - [i54]Christian Badertscher, Ueli Maurer, Björn Tackmann:
On Composable Security for Digital Signatures. IACR Cryptol. ePrint Arch. 2018: 15 (2018) - [i53]Christian Badertscher, Fabio Banfi, Ueli Maurer:
A Constructive Perspective on Signcryption Security. IACR Cryptol. ePrint Arch. 2018: 50 (2018) - [i52]Christian Badertscher, Juan A. Garay, Ueli Maurer, Daniel Tschudi, Vassilis Zikas:
But Why does it Work? A Rational Protocol Design Treatment of Bitcoin. IACR Cryptol. ePrint Arch. 2018: 138 (2018) - [i51]Rio LaVigne, Chen-Da Liu Zhang, Ueli Maurer, Tal Moran, Marta Mularczyk, Daniel Tschudi:
Topology-Hiding Computation Beyond Semi-Honest Adversaries. IACR Cryptol. ePrint Arch. 2018: 255 (2018) - [i50]Daniel Jost, Ueli Maurer, Marta Mularczyk:
Efficient Ratcheting: Almost-Optimal Guarantees for Secure Messaging. IACR Cryptol. ePrint Arch. 2018: 954 (2018) - 2017
- [j33]Christopher Portmann
, Christian Matt
, Ueli Maurer, Renato Renner, Björn Tackmann:
Causal Boxes: Quantum Information-Processing Systems Closed Under Composition. IEEE Trans. Inf. Theory 63(5): 3277-3305 (2017) - [c133]Christian Badertscher
, Christian Matt
, Ueli Maurer:
Strengthening Access Control Encryption. ASIACRYPT (1) 2017: 502-532 - [c132]Christian Badertscher
, Ueli Maurer, Daniel Tschudi
, Vassilis Zikas:
Bitcoin as a Transaction Ledger: A Composable Treatment. CRYPTO (1) 2017: 324-356 - [c131]Grégory Demay, Peter Gazi, Ueli Maurer, Björn Tackmann:
Per-Session Security: Password-Based Cryptography Revisited. ESORICS (1) 2017: 408-426 - [c130]Ueli Maurer:
An information-theoretic approach to hardness amplification. ISIT 2017: 948-952 - [c129]Chen-Da Liu Zhang
, Ueli Maurer, Martin Raszyk
, Daniel Tschudi
:
Witness-hiding proofs of knowledge for cable locks. ISIT 2017: 953-957 - [c128]Christian Badertscher
, Sandro Coretti, Chen-Da Liu Zhang
, Ueli Maurer:
Efficiency lower bounds for commit-and-prove constructions. ISIT 2017: 1788-1792 - [i49]Christian Badertscher, Ueli Maurer:
Composable and Robust Outsourced Storage. IACR Cryptol. ePrint Arch. 2017: 133 (2017) - [i48]Christian Badertscher, Ueli Maurer, Daniel Tschudi, Vassilis Zikas:
Bitcoin as a Transaction Ledger: A Composable Treatment. IACR Cryptol. ePrint Arch. 2017: 149 (2017) - [i47]Christian Badertscher, Christian Matt, Ueli Maurer:
Strengthening Access Control Encryption. IACR Cryptol. ePrint Arch. 2017: 429 (2017) - [i46]Daniel Jost, Ueli Maurer:
Context-Restricted Indifferentiability: Generalizing UCE and Implications on the Soundness of Hash-Function Constructions. IACR Cryptol. ePrint Arch. 2017: 461 (2017) - [i45]Daniel Jost, Ueli Maurer, João L. Ribeiro:
Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio. IACR Cryptol. ePrint Arch. 2017: 1130 (2017) - 2016
- [j32]Divesh Aggarwal, Ueli Maurer:
Breaking RSA Generically Is Equivalent to Factoring. IEEE Trans. Inf. Theory 62(11): 6251-6259 (2016) - [c127]Martin Hirt, Ueli Maurer, Daniel Tschudi
, Vassilis Zikas:
Network-Hiding Communication and Applications to Multi-party Protocols. CRYPTO (2) 2016: 335-365 - [c126]Ueli Maurer, João Ribeiro
:
New perspectives on weak Oblivious Transfer. ISIT 2016: 790-794 - [c125]Julian Loss, Ueli Maurer, Daniel Tschudi
:
Hierarchy of three-party consistency specifications. ISIT 2016: 3048-3052 - [c124]Gregor Seiler, Ueli Maurer:
On the impossibility of information-theoretic composable coin toss extension. ISIT 2016: 3058-3061 - [c123]Jan Camenisch, Robert R. Enderlein, Ueli Maurer:
Memory Erasability Amplification. SCN 2016: 104-125 - [c122]Ueli Maurer, Renato Renner:
From Indifferentiability to Constructive Cryptography (and Back). TCC (B1) 2016: 3-24 - [p2]Ueli Maurer:
Cryptography and Computation after Turing. The Once and Future Turing 2016: 53-77 - [i44]Christian Matt, Ueli Maurer, Christopher Portmann, Renato Renner, Björn Tackmann:
Toward an Algebraic Theory of Systems. CoRR abs/1609.04293 (2016) - [i43]Grégory Demay, Peter Gazi, Ueli Maurer, Björn Tackmann:
Per-Session Security: Password-Based Cryptography Revisited. IACR Cryptol. ePrint Arch. 2016: 166 (2016) - [i42]Martin Hirt, Ueli Maurer, Daniel Tschudi, Vassilis Zikas:
Network-Hiding Communication and Applications to Multi-Party Protocols. IACR Cryptol. ePrint Arch. 2016: 556 (2016) - [i41]Jan Camenisch, Robert R. Enderlein, Ueli Maurer:
Memory Erasability Amplification. IACR Cryptol. ePrint Arch. 2016: 706 (2016) - [i40]Ueli Maurer, Renato Renner:
From Indifferentiability to Constructive Cryptography (and Back). IACR Cryptol. ePrint Arch. 2016: 903 (2016) - 2015
- [j31]Ueli Maurer:
Zero-knowledge proofs of knowledge for group homomorphisms. Des. Codes Cryptogr. 77(2-3): 663-676 (2015) - [c121]Dennis Hofheinz, Christian Matt
, Ueli Maurer:
Idealizing Identity-Based Encryption. ASIACRYPT (1) 2015: 495-520 - [c120]Christian Matt
, Ueli Maurer:
A Definitional Framework for Functional Encryption. CSF 2015: 217-231 - [c119]Grégory Demay, Peter Gazi, Ueli Maurer, Björn Tackmann:
Query-Complexity Amplification for Random Oracles. ICITS 2015: 159-180 - [c118]Christian Badertscher
, Christian Matt
, Ueli Maurer, Phillip Rogaway, Björn Tackmann:
Robust Authenticated Encryption and the Limits of Symmetric Cryptography. IMACC 2015: 112-129 - [c117]Markulf Kohlweiss
, Ueli Maurer, Cristina Onete, Björn Tackmann, Daniele Venturi
:
(De-)Constructing TLS 1.3. INDOCRYPT 2015: 85-102 - [c116]Christian Badertscher
, Christian Matt
, Ueli Maurer, Phillip Rogaway, Björn Tackmann:
Augmented Secure Channels and the Goal of the TLS 1.3 Record Layer. ProvSec 2015: 85-104 - [c115]Sandro Coretti, Ueli Maurer, Björn Tackmann, Daniele Venturi:
From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes. TCC (1) 2015: 532-560 - [i39]Christopher Portmann, Christian Matt, Ueli Maurer, Renato Renner, Björn Tackmann:
Causal Boxes: Quantum Information-Processing Systems Closed under Composition. CoRR abs/1512.02240 (2015) - [i38]Grégory Demay, Peter Gazi, Ueli Maurer, Björn Tackmann:
Query-Complexity Amplification for Random Oracles. IACR Cryptol. ePrint Arch. 2015: 315 (2015) - [i37]Christian Badertscher, Christian Matt, Ueli Maurer, Phillip Rogaway, Björn Tackmann:
Augmented Secure Channels and the Goal of the TLS 1.3 Record Layer. IACR Cryptol. ePrint Arch. 2015: 394 (2015) - [i36]Dennis Hofheinz, Christian Matt, Ueli Maurer:
Idealizing Identity-Based Encryption. IACR Cryptol. ePrint Arch. 2015: 862 (2015) - [i35]Christian Badertscher, Christian Matt, Ueli Maurer, Phillip Rogaway, Björn Tackmann:
Robust Authenticated Encryption and the Limits of Symmetric Cryptography. IACR Cryptol. ePrint Arch. 2015: 893 (2015) - 2014
- [c114]Grégory Demay, Peter Gazi, Ueli Maurer, Björn Tackmann:
Optimality of non-adaptive strategies: The case of parallel games. ISIT 2014: 1707-1711 - [c113]Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov:
Anonymous Authentication with Shared Secrets. LATINCRYPT 2014: 219-236 - [c112]Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov:
Key-Indistinguishable Message Authentication Codes. SCN 2014: 476-493 - [c111]Martin Hirt, Ueli Maurer, Pavel Raykov:
Broadcast Amplification. TCC 2014: 419-439 - [i34]Markulf Kohlweiss, Ueli Maurer, Cristina Onete
, Björn Tackmann, Daniele Venturi:
(De-)Constructing TLS. IACR Cryptol. ePrint Arch. 2014: 20 (2014) - [i33]Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov:
Anonymous Authentication with Shared Secrets. IACR Cryptol. ePrint Arch. 2014: 73 (2014) - [i32]Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov:
Key-Indistinguishable Message Authentication Codes. IACR Cryptol. ePrint Arch. 2014: 107 (2014) - [i31]Grégory Demay, Peter Gazi, Ueli Maurer, Björn Tackmann:
Optimality of Non-Adaptive Strategies: The Case of Parallel Games. IACR Cryptol. ePrint Arch. 2014: 299 (2014) - [i30]Sandro Coretti, Ueli Maurer, Björn Tackmann, Daniele Venturi:
From Single-Bit to Multi-Bit Public-Key Encryption via Non-Malleable Codes. IACR Cryptol. ePrint Arch. 2014: 324 (2014) - 2013
- [c110]Sandro Coretti, Ueli Maurer, Björn Tackmann:
Constructing Confidential Channels from Authenticated Channels - Public-Key Encryption Revisited. ASIACRYPT (1) 2013: 134-153 - [c109]Sandro Coretti, Ueli Maurer, Björn Tackmann:
A Constructive Perspective on Key Encapsulation. Number Theory and Cryptography 2013: 226-239 - [c108]Martin Hirt, Christoph Lucas, Ueli Maurer:
A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation. CRYPTO (2) 2013: 203-219 - [c107]Martin Hirt, Christoph Lucas, Ueli Maurer:
Erratum: A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation. CRYPTO (2) 2013 - [c106]Grégory Demay, Peter Gazi, Martin Hirt, Ueli Maurer:
Resource-Restricted Indifferentiability. EUROCRYPT 2013: 664-683 - [c105]Juan A. Garay, Jonathan Katz, Ueli Maurer, Björn Tackmann, Vassilis Zikas:
Rational Protocol Design: Cryptography against Incentive-Driven Adversaries. FOCS 2013: 648-657 - [c104]Grégory Demay, Ueli Maurer:
Unfair coin tossing. ISIT 2013: 1556-1560 - [c103]Christian Matt
, Ueli Maurer:
The one-time pad revisited. ISIT 2013: 2706-2710 - [c102]Ueli Maurer:
Authentication amplification by synchronization. ISIT 2013: 2711-2714 - [c101]Ueli Maurer:
Conditional equivalence of random systems and indistinguishability proofs. ISIT 2013: 3150-3154 - [c100]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 - [c99]Jonathan Katz, Ueli Maurer, Björn Tackmann, Vassilis Zikas:
Universally Composable Synchronous Computation. TCC 2013: 477-498 - [p1]Ueli Maurer, Vassilis Zikas:
Information-Theoretic Secure Multiparty Computation. Secure Multi-Party Computation 2013: 168-200 - [i29]Markulf Kohlweiss, Ueli Maurer, Cristina Onete
, Björn Tackmann, Daniele Venturi:
Anonymity-preserving Public-Key Encryption: A Constructive Approach. IACR Cryptol. ePrint Arch. 2013: 238 (2013) - [i28]Martin Hirt, Ueli Maurer, Christoph Lucas:
A Dynamic Tradeoff Between Active and Passive Corruptions in Secure Multi-Party Computation. IACR Cryptol. ePrint Arch. 2013: 349 (2013) - [i27]Juan A. Garay, Jonathan Katz, Ueli Maurer, Björn Tackmann, Vassilis Zikas:
Rational Protocol Design: Cryptography Against Incentive-driven Adversaries. IACR Cryptol. ePrint Arch. 2013: 496 (2013) - [i26]Ueli Maurer, Björn Tackmann, Sandro Coretti:
Key Exchange with Unilateral Authentication: Composable Security Definition and Modular Protocol Design. IACR Cryptol. ePrint Arch. 2013: 555 (2013) - [i25]Christian Matt, Ueli Maurer:
A Constructive Approach to Functional Encryption. IACR Cryptol. ePrint Arch. 2013: 559 (2013) - [i24]Sandro Coretti, Ueli Maurer, Björn Tackmann:
Constructing Confidential Channels from Authenticated Channels - Public-Key Encryption Revisited. IACR Cryptol. ePrint Arch. 2013: 719 (2013) - [i23]Martin Hirt, Ueli Maurer, Pavel Raykov:
Broadcast Amplification. IACR Cryptol. ePrint Arch. 2013: 769 (2013) - 2012
- [c98]Joël Alwen, Jonathan Katz, Ueli Maurer, Vassilis Zikas:
Collusion-Preserving Computation. CRYPTO 2012: 124-143 - [c97]Martin Hirt, Christoph Lucas, Ueli Maurer, Dominik Raub:
Passive Corruption in Statistical Multi-Party Computation - (Extended Abstract). ICITS 2012: 129-146 - [c96]Ueli Maurer, Björn Tackmann:
Synchrony amplification. ISIT 2012: 1583-1587 - [c95]Grégory Demay, Ueli Maurer:
Common randomness amplification: A constructive view. ITW 2012: 35-39 - [c94]Kfir Barhum, Ueli Maurer:
UOWHFs from OWFs: Trading Regularity for Efficiency. LATINCRYPT 2012: 234-253 - [c93]Ueli Maurer, Andreas Rüedlinger, Björn Tackmann:
Confidentiality and Integrity: A Constructive Perspective. TCC 2012: 209-229 - [i22]Martin Hirt, Christoph Lucas, Ueli Maurer, Dominik Raub:
Passive Corruption in Statistical Multi-Party Computation. IACR Cryptol. ePrint Arch. 2012: 272 (2012) - [i21]Grégory Demay, Peter Gazi, Martin Hirt, Ueli Maurer:
Resource-Restricted Indifferentiability. IACR Cryptol. ePrint Arch. 2012: 613 (2012) - 2011
- [c92]Divesh Aggarwal, Ueli Maurer:
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy. ASIACRYPT 2011: 686-701 - [c91]Ghassan Karame, Srdjan Capkun, Ueli Maurer:
Privacy-preserving outsourcing of brute-force key searches. CCSW 2011: 101-112 - [c90]Martin Hirt, Christoph Lucas, Ueli Maurer, Dominik Raub:
Graceful Degradation in Multi-Party Computation (Extended Abstract). ICITS 2011: 163-180 - [c89]Ueli Maurer, Renato Renner:
Abstract Cryptography. ICS 2011: 1-21 - [c88]Ueli Maurer:
Constructive Cryptography - A New Paradigm for Security Definitions and Proofs. TOSCA 2011: 33-56 - [i20]Marc Fischlin, Anna Lysyanskaya, Ueli Maurer, Alexander May:
Public-Key Cryptography (Dagstuhl Seminar 11391). Dagstuhl Reports 1(9): 76-94 (2011) - [i19]Martin Hirt, Christoph Lucas, Ueli Maurer, Dominik Raub:
Graceful Degradation in Multi-Party Computation. IACR Cryptol. ePrint Arch. 2011: 94 (2011) - [i18]Jonathan Katz, Ueli Maurer, Björn Tackmann, Vassilis Zikas:
Universally Composable Synchronous Computation. IACR Cryptol. ePrint Arch. 2011: 310 (2011) - [i17]Joël Alwen, Jonathan Katz, Ueli Maurer, Vassilis Zikas:
Collusion-Preserving Computation. IACR Cryptol. ePrint Arch. 2011: 433 (2011) - 2010
- [c87]Ueli Maurer, Björn Tackmann:
On the soundness of authenticate-then-encrypt: formalizing the malleability of symmetric encryption. CCS 2010: 505-515 - [c86]Ueli Maurer:
Constructive Cryptography - A Primer. Financial Cryptography 2010: 1 - [c85]Christoph Lucas, Dominik Raub, Ueli M. Maurer:
Hybrid-secure MPC: trading information-theoretic robustness for computational privacy. PODC 2010: 219-228 - [c84]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
- [c83]Ueli M. Maurer:
Unifying Zero-Knowledge Proofs of Knowledge. AFRICACRYPT 2009: 272-286 - [c82]Peter Gazi, Ueli M. Maurer:
Cascade Encryption Revisited. ASIACRYPT 2009: 37-51 - [c81]Ueli M. Maurer, Stefano Tessaro:
Computational Indistinguishability Amplification: Tight Product Theorems for System Composition. CRYPTO 2009: 355-373 - [c80]Ueli M. Maurer:
Abstraction in Cryptography. CRYPTO 2009: 465 - [c79]Divesh Aggarwal, Ueli M. Maurer:
Breaking RSA Generically Is Equivalent to Factoring. EUROCRYPT 2009: 36-53 - [c78]Peter Gazi, Ueli Maurer:
Free-Start Distinguishing: Combining Two Types of Indistinguishability Amplification. ICITS 2009: 28-44 - [c77]Robert König, Ueli M. Maurer, Stefano Tessaro:
Abstract Storage Devices. SOFSEM 2009: 341-352 - [c76]Vassilis Zikas, Sarah Hauser, Ueli M. Maurer:
Realistic Failures in Secure Multi-party Computation. TCC 2009: 274-293 - [i16]Christoph Lucas, Dominik Raub, Ueli Maurer:
Hybrid-Secure MPC: Trading Information-Theoretic Robustness for Computational Privacy. IACR Cryptol. ePrint Arch. 2009: 9 (2009) - [i15]Peter Gazi, Ueli Maurer:
Cascade Encryption Revisited. IACR Cryptol. ePrint Arch. 2009: 93 (2009) - [i14]Ueli Maurer, Stefano Tessaro:
Computational Indistinguishability Amplification: Tight Product Theorems for System Composition. IACR Cryptol. ePrint Arch. 2009: 396 (2009) - 2008
- [j30]Hideki Imai, Goichiro Hanaoka, Ueli M. Maurer, Yuliang Zheng
:
Introduction to the Special Issue on Information Theoretic Security. IEEE Trans. Inf. 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 Trans. Inf. Theory 54(6): 2790-2792 (2008) - [c75]Martin Hirt, Ueli M. Maurer, Vassilis Zikas:
MPC vs. SFE : Unconditional and Computational Security. ASIACRYPT 2008: 1-18 - [c74]Ueli M. Maurer, Stefano Tessaro:
Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography. ASIACRYPT 2008: 161-178 - [c73]Ueli M. Maurer:
Rethinking Digital Signatures. SECRYPT 2008: 31-33 - [c72]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:
Cryptography, 16.09. - 21.09.2007. Dagstuhl Seminar Proceedings 07381, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 [contents] - [i13]Divesh Aggarwal, Ueli Maurer:
Breaking RSA Generically is Equivalent to Factoring. IACR Cryptol. ePrint Arch. 2008: 260 (2008) - 2007
- [c71]Ueli M. Maurer, Dominik Raub:
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations. ASIACRYPT 2007: 427-443 - [c70]Ueli M. Maurer, Krzysztof Pietrzak, Renato Renner:
Indistinguishability Amplification. CRYPTO 2007: 130-149 - [c69]Ueli M. Maurer, Stefano Tessaro:
Domain Extension of Public Random Functions: Beyond the Birthday Barrier. CRYPTO 2007: 187-204 - [c68]Ueli M. Maurer, Johan Sjödin:
A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security. EUROCRYPT 2007: 498-516 - [c67]Ueli Maurer:
Random Systems: Theory and Applications. ICITS 2007: 44-45 - [i12]Johannes Blömer, Dan Boneh, Ronald Cramer, Ueli M. Maurer:
07381 Executive Summary - Cryptography. Cryptography 2007 - [i11]Johannes Blömer, Dan Boneh, Ronald Cramer, Ueli M. Maurer:
07381 Abstracts Collection -- Cryptography. Cryptography 2007 - [i10]Robert König, Ueli M. Maurer, Stefano Tessaro:
Abstract Storage Devices. CoRR abs/0706.2746 (2007) - [i9]Zuzana Beerliová-Trubíniová, Matthias Fitzi, Martin Hirt, Ueli Maurer, Vassilis Zikas:
MPC vs. SFE: Perfect Security in a Unified Corruption Model. IACR Cryptol. ePrint Arch. 2007: 78 (2007) - [i8]Ueli Maurer, Dominik Raub:
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations. IACR Cryptol. ePrint Arch. 2007: 89 (2007) - [i7]Ueli Maurer, Stefano Tessaro:
Domain Extension of Public Random Functions: Beyond the Birthday Barrier. IACR Cryptol. ePrint Arch. 2007: 229 (2007) - 2006
- [j28]Ueli M. Maurer:
Secure multi-party computation made simple. Discret. Appl. Math. 154(2): 370-381 (2006) - [c66]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 Cryptol. ePrint Arch. 2006: 71 (2006) - [i5]Ueli Maurer, Yvonne Anne Oswald, Krzysztof Pietrzak, Johan Sjödin:
Luby-Rackoff Ciphers from Weak Round Functions? IACR Cryptol. ePrint Arch. 2006: 213 (2006) - [i4]Ueli Maurer, Krzysztof Pietrzak, Renato Renner:
Indistinguishability Amplification. IACR Cryptol. ePrint Arch. 2006: 456 (2006) - 2005
- [j27]Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Rafail Ostrovsky:
Minimal Complete Primitives for Secure Multi-Party Computation. J. Cryptol. 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. Cryptol. 18(3): 191-217 (2005) - [j25]Robert König, Ueli M. Maurer, Renato Renner:
On the power of quantum memory. IEEE Trans. Inf. Theory 51(7): 2391-2401 (2005) - [c65]Ueli M. Maurer, Johan Sjödin:
Single-Key AIL-MACs from Any FIL-MAC. ICALP 2005: 472-484 - [c64]Ueli M. Maurer:
Abstract Models of Computation in Cryptography. IMACC 2005: 1-12 - [c63]Ueli M. Maurer, Johan Sjödin:
Domain Expansion of MACs: Alternative Uses of the FIL-MAC. IMACC 2005: 168-185 - [c62]Robert König, Ueli M. Maurer:
Generalized Strong Extractors and Deterministic Privacy Amplification. IMACC 2005: 322-339 - [c61]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. Cryptol. 17(1): 5-26 (2004) - [j23]Ueli M. Maurer:
New Approaches to Digital Evidence. Proc. IEEE 92(6): 933-947 (2004) - [c60]Thomas Holenstein, Ueli M. Maurer, Johan Sjödin:
Complete Classification of Bilinear Hard-Core Functions. CRYPTO 2004: 73-91 - [c59]Stefan Dziembowski, Ueli M. Maurer:
On Generating the Initial Key in the Bounded-Storage Model. EUROCRYPT 2004: 126-137 - [c58]Robert König, Ueli Maurer, Renato Renner:
Privacy amplification secure against an adversary with selectable knowledge. ISIT 2004: 231 - [c57]Robert König, Ueli Maurer:
Extracting randomness from generalized symbol-fixing and Markov sources. ISIT 2004: 232 - [c56]Ueli M. Maurer:
The Role of Cryptography in Database Security. SIGMOD Conference 2004: 5-10 - [c55]Ueli M. Maurer, Renato Renner, Clemens Holenstein:
Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology. TCC 2004: 21-39 - [c54]Ueli M. Maurer, Krzysztof Pietrzak:
Composition of Random Systems: When Two Weak Make One Strong. TCC 2004: 410-427 - [c53]Ueli M. Maurer:
Towards a Theory of Consistency Primitives. DISC 2004: 379-389 - 2003
- [j22]Ueli M. Maurer, Stefan Wolf
:
Secret-key agreement over unauthenticated public channels I: Definitions and a completeness result. IEEE Trans. Inf. Theory 49(4): 822-831 (2003) - [j21]Ueli M. Maurer, Stefan Wolf
:
Secret-key agreement over unauthenticated public channels II: the simulatability condition. IEEE Trans. Inf. Theory 49(4): 832-838 (2003) - [j20]Ueli M. Maurer, Stefan Wolf
:
Secret-key agreement over unauthenticated public channels III: Privacy amplification. IEEE Trans. Inf. Theory 49(4): 839-851 (2003) - [c52]Ueli M. Maurer, Krzysztof Pietrzak:
The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations. EUROCRYPT 2003: 544-561 - [c51]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 Cryptol. ePrint Arch. 2003: 161 (2003) - 2002
- [c50]Serge Fehr, Ueli M. Maurer:
Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks. CRYPTO 2002: 565-580 - [c49]Ueli M. Maurer:
Indistinguishability of Random Systems. EUROCRYPT 2002: 110-132 - [c48]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 - [c47]Ueli M. Maurer:
Secure Multi-party Computation Made Simple. SCN 2002: 14-28 - [c46]Stefan Dziembowski
, Ueli M. Maurer:
Tight security proofs for the bounded-storage model. STOC 2002: 341-350 - 2001
- [c45]Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Rafail Ostrovsky:
Minimal Complete Primitives for Secure Multi-party Computation. CRYPTO 2001: 80-100 - [c44]Martin Hirt, Ueli M. Maurer:
Robustness for Free in Unconditional Multi-party Computation. CRYPTO 2001: 101-118 - [c43]Ueli M. Maurer:
Cryptography 2000±10. Informatics 2001: 63-85 - [i2]Martin Hirt, Ueli Maurer:
Robustness for Free in Unconditional Multi-Party Computation. IACR Cryptol. ePrint Arch. 2001: 23 (2001) - 2000
- [j19]Ueli M. Maurer, Stefan Wolf
:
The Diffie-Hellman Protocol. Des. Codes Cryptogr. 19(2/3): 147-171 (2000) - [j18]Martin Hirt, Ueli M. Maurer:
Player Simulation and General Adversary Structures in Perfect Multiparty Computation. J. Cryptol. 13(1): 31-60 (2000) - [j17]Reto Kohlas, Ueli Maurer:
Reasoning about public-key certification: on bindings between entities and public keys. IEEE J. Sel. Areas Commun. 18(4): 551-560 (2000) - [j16]Ueli M. Maurer:
Authentication theory and hypothesis testing. IEEE Trans. Inf. Theory 46(4): 1350-1356 (2000) - [c42]Martin Hirt, Ueli M. Maurer, Bartosz Przydatek:
Efficient Secure Multi-party Computation. ASIACRYPT 2000: 143-161 - [c41]Ronald Cramer, Ivan Damgård, Ueli M. Maurer:
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme. EUROCRYPT 2000: 316-334 - [c40]Ueli M. Maurer, Stefan Wolf
:
Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free. EUROCRYPT 2000: 351-368 - [c39]Reto Kohlas, Ueli M. Maurer:
Confidence Valuation in a Public-Key Infrastructure Based on Uncertain Evidence. Public Key Cryptography 2000: 93-112 - [c38]Matthias Fitzi, Ueli M. Maurer:
From partial consistency to global broadcast. STOC 2000: 494-503 - [i1]Ronald Cramer, Ivan Damgård, Ueli Maurer:
General Secure Multi-Party Computation from any Linear Secret Sharing Scheme. IACR Cryptol. ePrint Arch. 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 Trans. Inf. Theory 45(2): 499-514 (1999) - [c37]Matthias Fitzi, Martin Hirt, Ueli M. Maurer:
General Adversaries in Unconditional Multi-party Computation. ASIACRYPT 1999: 232-246 - [c36]Ueli M. Maurer:
Information-Theoretic Cryptography. CRYPTO 1999: 47-64 - [c35]Reto Kohlas, Ueli M. Maurer:
Reasoning about Public-Key Certification: On Bindings between Entities and Public Keys. Financial Cryptography 1999: 86-103 - [c34]Ueli M. Maurer:
Kryptographie: Basistechnologie der Informationsgesellschaft (Zusammenfassung). GI Jahrestagung 1999: 15 - [c33]Bernd Altmann, Matthias Fitzi, Ueli M. Maurer:
Byzantine Agreement Secure against General Adversaries in the Dual Failure Model. DISC 1999: 123-137 - 1998
- [c32]Matthias Fitzi, Martin Hirt, Ueli M. Maurer:
Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract). CRYPTO 1998: 121-136 - [c31]Ueli M. Maurer, Stefan Wolf
:
Lower Bounds on Generic Algorithms in Groups. EUROCRYPT 1998: 72-84 - [c30]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. J. Comput. Secur. 5(1): 69-90 (1997) - [j12]Christian Cachin, Ueli M. Maurer:
Linking Information Reconciliation and Privacy Amplification. J. Cryptol. 10(2): 97-110 (1997) - [c29]Christian Cachin, Ueli M. Maurer:
Unconditional Security Against Memory-Bounded Adversaries. CRYPTO 1997: 292-306 - [c28]Ueli M. Maurer, Stefan Wolf
:
Privacy Amplification Secure Against Active Adversaries. CRYPTO 1997: 307-321 - [c27]Ueli M. Maurer:
Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion. EUROCRYPT 1997: 209-225 - [c26]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 Cryptogr. 9(3): 305-316 (1996) - [j10]Ueli M. Maurer, Pierre E. Schmid:
A Calculus for Security Bootstrapping in Distributed Systems. J. Comput. Secur. 4(1): 55-80 (1996) - [c25]Daniel Bleichenbacher, Ueli M. Maurer:
On the Efficiency of One-Time Digital Signatures. ASIACRYPT 1996: 145-158 - [c24]Ueli M. Maurer, Stefan Wolf
:
Towards Characterizing When Information-Theoretic Secret Key Agreement Is Possible. ASIACRYPT 1996: 196-209 - [c23]Ueli M. Maurer, Stefan Wolf
:
Diffie-Hellman Oracles. CRYPTO 1996: 268-282 - [c22]Jan Camenisch, Ueli M. Maurer, Markus Stadler:
Digital Payment Systems with Passive Anonymity-Revoking Trustees. ESORICS 1996: 33-43 - [c21]Ueli M. Maurer:
Modelling a Public-Key Infrastructure. ESORICS 1996: 325-350 - [c20]Daniel Bleichenbacher, Ueli M. Maurer:
Optimal Tree-Based One-Time Digital Signature Schemes. STACS 1996: 363-374 - [c19]Ueli M. Maurer:
A Unified and Generalized Treatment of Authentification Theory. STACS 1996: 387-398 - [e1]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. Lecture Notes in Computer Science 1070, Springer 1996, ISBN 3-540-61186-X [contents] - 1995
- [j9]Ueli M. Maurer:
On the Oracle Complexity of Factoring Integers. Comput. Complex. 5(3/4): 237-247 (1995) - [j8]Ueli M. Maurer:
Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters. J. Cryptol. 8(3): 123-155 (1995) - [j7]Charles H. Bennett, Gilles Brassard, Claude Crépeau, Ueli M. Maurer:
Generalized privacy amplification. IEEE Trans. Inf. Theory 41(6): 1915-1923 (1995) - 1994
- [c18]Daniel Bleichenbacher, Ueli M. Maurer:
Directed Acyclic Graphs, One-way Functions and Digital Signatures. CRYPTO 1994: 75-82 - [c17]Ueli M. Maurer:
Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms. CRYPTO 1994: 271-281 - [c16]Ueli M. Maurer, Pierre E. Schmid:
A Calculus for Secure Channel Establishment in Open Networks. ESORICS 1994: 175-192 - [c15]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. Cryptol. 6(1): 55-61 (1993) - [j5]Ueli M. Maurer:
Secret key agreement by public discussion from common information. IEEE Trans. Inf. 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. Discret. Appl. Math. 37/38: 421-436 (1992) - [j3]Ueli M. Maurer:
Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher. J. Cryptol. 5(1): 53-66 (1992) - [j2]Ueli M. Maurer:
A Universal Statistical Test for Random Bit Generators. J. Cryptol. 5(2): 89-105 (1992) - [c14]Ueli M. Maurer:
Protocols for Secret Key Agreement by Public Discussion Based on Common Information. CRYPTO 1992: 461-470 - [c13]Ueli M. Maurer:
A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generator. EUROCRYPT 1992: 239-255 - [c12]Ueli M. Maurer:
Factoring with an Oracle. EUROCRYPT 1992: 429-436 - [c11]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. Cryptol. 4(2): 135-149 (1991) - [c10]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 - [c9]Ueli M. Maurer:
New Approaches to the Design of Self-Synchronizing Stream Ciphers. EUROCRYPT 1991: 458-471 - [c8]Ueli M. Maurer, Yacov Yacobi:
Non-interactive Public-Key Cryptography. EUROCRYPT 1991: 498-507 - [c7]Ueli M. Maurer:
Perfect Cryptographic Security from Partially Independent Channels. STOC 1991: 561-571 - 1990
- [c6]Ueli M. Maurer:
A Universal Statistical Test for Random Bit Generators. CRYPTO 1990: 409-420 - [c5]Ueli M. Maurer:
Practical Perfect Cryptographic Security. Advances In Computational Complexity Theory 1990: 135-153 - [c4]Ueli M. Maurer:
A Provably-Secure Strongly-Randomized Cipher. EUROCRYPT 1990: 361-373
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
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
![](https://rp.liu233w.com/img/new-feature-top-right.156x64.png)