The following pages link to Björn Tackmann (Q1653118):
Displaying 24 items.
- Updatable encryption with post-compromise security (Q1653119) (← links)
- Fair distributed computation of reactive functions (Q1664161) (← links)
- Moderately hard functions: definition, instantiations, and applications (Q1690205) (← links)
- On composable security for digital signatures (Q1749299) (← links)
- Toward an algebraic theory of systems (Q1786609) (← links)
- Universal composition with global subroutines: capturing global setup within plain UC (Q2119067) (← links)
- Nonces are noticed: AEAD revisited (Q2181852) (← links)
- Non-malleable encryption: simpler, shorter, stronger (Q2210445) (← links)
- Non-Malleable Encryption: Simpler, Shorter, Stronger (Q2796130) (← links)
- How Fair is Your Protocol? (Q2796263) (← links)
- Nonce-Based Cryptography: Retaining Security When Randomness Fails (Q2820505) (← links)
- The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3 (Q2835590) (← links)
- Constructing Confidential Channels from Authenticated Channels—Public-Key Encryption Revisited (Q2867215) (← links)
- A Constructive Perspective on Key Encapsulation (Q2867261) (← links)
- Confidentiality and Integrity: A Constructive Perspective (Q2891485) (← links)
- Query-Complexity Amplification for Random Oracles (Q2947529) (← 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)
- Universally Composable Synchronous Computation (Q4910294) (← links)
- From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes (Q5261643) (← links)
- (Q5347985) (← links)
- Asymmetric Distributed Trust (Q5874233) (← links)
- Asymmetric distributed trust (Q6601210) (← links)
