The following pages link to Ueli M. Maurer (Q676921):
Displaying 50 items.
- A non-interactive public-key distribution system (Q676923) (← links)
- A calculus for secure channel establishment in open networks (Q826063) (← links)
- Zero-knowledge proofs of knowledge for group homomorphisms (Q887447) (← links)
- Local randomness in pseudorandom sequences (Q1180515) (← links)
- Conditionally-perfect secrecy and a provably-secure randomized cipher (Q1184508) (← links)
- A universal statistical test for random bit generators (Q1196895) (← links)
- Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs (Q1199445) (← links)
- Cascade ciphers: The importance of being first (Q1207697) (← links)
- Linking information reconciliation and privacy amplification (Q1363071) (← links)
- (Q1629417) (redirect page) (← links)
- Information-theoretic secret-key agreement: the asymptotically tight relation between the secret-key rate and the channel quality ratio (Q1629419) (← links)
- Topology-hiding computation beyond semi-honest adversaries (Q1631311) (← links)
- But why does it work? A rational protocol design treatment of bitcoin (Q1648820) (← links)
- Bitcoin as a transaction ledger: a composable treatment (Q1675730) (← links)
- On composable security for digital signatures (Q1749299) (← links)
- Minimal complete primitives for secure multi-party computation (Q1777285) (← links)
- Toward an algebraic theory of systems (Q1786609) (← links)
- Security definitions for hash functions: combining UCE and indifferentiability (Q1796782) (← links)
- A constructive perspective on signcryption security (Q1796784) (← links)
- Optimal randomizer efficiency in the bounded-storage model (Q1879466) (← links)
- Fast generation of prime numbers and secure public-key cryptographic parameters. (Q1895963) (← links)
- Cryptology: A new application of mathematics (Q1908125) (← links)
- On the oracle complexity of factoring integers (Q1918949) (← links)
- Player simulation and general adversary structures in perfect multiparty computation (Q1976004) (← links)
- The Diffie-Hellman protocol (Q1976038) (← links)
- Topology-hiding computation for networks with unknown delays (Q2055692) (← links)
- Revisiting (R)CCA security and replay protection (Q2061954) (← links)
- Overcoming impossibility results in composable security using interval-wise guarantees (Q2096476) (← links)
- Anonymous symmetric-key communication (Q2106662) (← links)
- Synchronous constructive cryptography (Q2119055) (← links)
- Coupling of random systems (Q2119078) (← links)
- Multi-designated receiver signed public key encryption (Q2170065) (← links)
- Composable and finite computational security of quantum message transmission (Q2175915) (← links)
- A unified and composable take on ratcheting (Q2175936) (← links)
- Non-malleable encryption: simpler, shorter, stronger (Q2210445) (← links)
- Composable and robust outsourced storage (Q2287531) (← links)
- Efficient ratcheting: almost-optimal guarantees for secure messaging (Q2292643) (← links)
- Strengthening access control encryption (Q2412884) (← links)
- Secure multi-party computation made simple (Q2489932) (← links)
- Byzantine agreement given partial broadcast (Q2501708) (← links)
- MPC with synchronous security and asynchronous responsiveness (Q2691582) (← links)
- Generalized proofs of knowledge with fully dynamic setup (Q2695646) (← links)
- Adaptive security of multi-party protocols, revisited (Q2695654) (← links)
- Direct product hardness amplification (Q2697877) (← links)
- (Q2707411) (← links)
- Idealizing Identity-Based Encryption (Q2811144) (← links)
- Memory Erasability Amplification (Q2827713) (← links)
- Network-Hiding Communication and Applications to Multi-party Protocols (Q2829220) (← links)
- A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation (Q2849397) (← links)
- Constructing Confidential Channels from Authenticated Channels—Public-Key Encryption Revisited (Q2867215) (← links)
