The following pages link to Ueli M. Maurer (Q676921):
Displaying 50 items.
- A Constructive Perspective on Key Encapsulation (Q2867261) (← links)
- Confidentiality and Integrity: A Constructive Perspective (Q2891485) (← links)
- Constructive Cryptography – A New Paradigm for Security Definitions and Proofs (Q2902914) (← links)
- Collusion-Preserving Computation (Q2914257) (← links)
- UOWHFs from OWFs: Trading Regularity for Efficiency (Q2915125) (← links)
- Key-Indistinguishable Message Authentication Codes (Q2922676) (← links)
- Anonymous Authentication with Shared Secrets (Q2946477) (← links)
- Query-Complexity Amplification for Random Oracles (Q2947529) (← links)
- Graceful Degradation in Multi-Party Computation (Extended Abstract) (Q3002112) (← links)
- The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy (Q3102216) (← links)
- From Indifferentiability to Constructive Cryptography (and Back) (Q3179350) (← links)
- Computational Indistinguishability Amplification: Tight Product Theorems for System Composition (Q3183574) (← links)
- From partial consistency to global broadcast (Q3192019) (← links)
- (Q3374918) (← links)
- (Q3374920) (← links)
- Intrinsic Limitations of Digital Signatures and How to Cope with Them (Q3404403) (← links)
- A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch (Q3408197) (← links)
- Diffie-Hellman Oracles (Q3452357) (← links)
- Robust Authenticated Encryption and the Limits of Symmetric Cryptography (Q3460101) (← links)
- (De-)Constructing TLS 1.3 (Q3460169) (← links)
- Augmented Secure Channels and the Goal of the TLS 1.3 Record Layer (Q3467157) (← links)
- Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations (Q3498391) (← links)
- On the Power of Quantum Memory (Q3547157) (← links)
- Tight security proofs for the bounded-storage model (Q3579184) (← links)
- Constructive Cryptography – A Primer (Q3583562) (← links)
- Luby-Rackoff Ciphers from Weak Round Functions? (Q3593108) (← links)
- Abstract Storage Devices (Q3599084) (← links)
- MPC vs. SFE : Unconditional and Computational Security (Q3600361) (← links)
- Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography (Q3600371) (← links)
- Introduction to the Special Issue on Information Theoretic Security (Q3604426) (← links)
- The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement (Q3604445) (← links)
- Realistic Failures in Secure Multi-party Computation (Q3611772) (← links)
- Indistinguishability Amplification (Q3612547) (← links)
- Domain Extension of Public Random Functions: Beyond the Birthday Barrier (Q3612550) (← links)
- Unifying Zero-Knowledge Proofs of Knowledge (Q3637145) (← links)
- Random Systems: Theory and Applications (Q3649185) (← links)
- Cascade Encryption Revisited (Q3650683) (← links)
- (Q3792629) (← links)
- (Q3973160) (← links)
- (Q4011774) (← links)
- (Q4035724) (← links)
- (Q4036892) (← links)
- (Q4037488) (← links)
- (Q4037493) (← links)
- (Q4249325) (← links)
- (Q4249629) (← links)
- The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms (Q4268814) (← links)
- Secret key agreement by public discussion from common information (Q4277133) (← links)
- (Q4279591) (← links)
- (Q4279681) (← links)
