The following pages link to Douglas Wikström (Q421031):
Displaying 25 items.
- Parallel repetition of computationally sound protocols revisited (Q421032) (← links)
- Simplified Universal Composability Framework (Q2796143) (← links)
- Efficiency Limitations of Σ-Protocols for Group Homomorphisms Revisited (Q2912813) (← links)
- An Efficient Parallel Repetition Theorem (Q3408184) (← links)
- Simplified Submission of Inputs to Protocols (Q3540053) (← links)
- Proofs of Restricted Shuffles (Q3558306) (← links)
- Group Message Authentication (Q3588356) (← links)
- An Adaptively Secure Mix-Net Without Erasures (Q3591438) (← links)
- Parallel Repetition of Computationally Sound Protocols Revisited (Q3596374) (← links)
- Designated Confirmer Signatures Revisited (Q3596388) (← links)
- How to Shuffle in Public (Q3596398) (← links)
- A Commitment-Consistent Proof of a Shuffle (Q3634509) (← links)
- (Q4417405) (← links)
- (Q4417420) (← links)
- Randomized Partial Checking Revisited (Q4910229) (← links)
- A Mix-Net from Any CCA2 Secure Cryptosystem (Q4911611) (← links)
- Offline/Online Mixing (Q5428833) (← links)
- A Sender Verifiable Mix-Net and a New Proof of a Shuffle (Q5451075) (← links)
- Security in Communication Networks (Q5491704) (← links)
- Selected Areas in Cryptography (Q5713955) (← links)
- Automata, Languages and Programming (Q5716796) (← links)
- Automata, Languages and Programming (Q5716864) (← links)
- On the Composition of Public-Coin Zero-Knowledge Protocols (Q5895112) (← links)
- On the Composition of Public-Coin Zero-Knowledge Protocols (Q5895542) (← links)
- Theory of Cryptography (Q5901779) (← links)
