A Note on the Malleability of the El Gamal Cryptosystem. - Douglas Wikström (INDOCRYPT, 2002)

The Security of a Mix-Center Based on a Semantically Secure Cryptosystem. - Douglas Wikström (INDOCRYPT, 2002)

Five Practical Attacks for "Optimistic Mixing for Exit-Polls". - Douglas Wikström (Selected Areas in Cryptography, 2003)

A Universally Composable Mix-Net. - Douglas Wikström (TCC, 2004)

Hierarchical Group Signatures. - Mårten Trolin; Douglas Wikström (IACR Cryptol. ePrint Arch., 2004)

Universally Composable DKG with Linear Number of Exponentiations. - Douglas Wikström (IACR Cryptol. ePrint Arch., 2004)

On the l-Ary GCD-Algorithm in Rings of Integers. - Douglas Wikström (ICALP, 2005)

How to Shuffle in Public. - Ben Adida; Douglas Wikström (IACR Cryptol. ePrint Arch., 2005)

A Sender Verifiable Mix-Net and a New Proof of a Shuffle. - Douglas Wikström (IACR Cryptol. ePrint Arch., 2005)

On the security of mix-nets and hierarchical group signatures. - Douglas Wikström (2005)

An Adaptively Secure Mix-Net Without Erasures. - Douglas Wikström; Jens Groth (ICALP (2), 2006)

Designated Confirmer Signatures Revisited. - Douglas Wikström (IACR Cryptol. ePrint Arch., 2006)

Simplified Submission of Inputs to Protocols. - Douglas Wikström (IACR Cryptol. ePrint Arch., 2006)

Offline/Online Mixing. - Ben Adida; Douglas Wikström (IACR Cryptol. ePrint Arch., 2007)

An Efficient Concurrent Repetition Theorem. - Douglas Wikström (IACR Cryptol. ePrint Arch., 2009)

Proofs of Restricted Shuffles. - Björn Terelius; Douglas Wikström (AFRICACRYPT, 2010)

Practical Private Information Aggregation in Large Networks. - Gunnar Kreitz; Mads Dam; Douglas Wikström (NordSec, 2010)

An Efficient Parallel Repetition Theorem. - Johan Håstad; Rafael Pass; Douglas Wikström; Krzysztof Pietrzak (TCC, 2010)

Group Message Authentication. - Bartosz Przydatek; Douglas Wikström (IACR Cryptol. ePrint Arch., 2010)

A Commitment-Consistent Proof of a Shuffle. - Douglas Wikström (IACR Cryptol. ePrint Arch., 2011)

On the Composition of Public-Coin Zero-Knowledge Protocols. - Rafael Pass; Wei-Lung Dustin Tseng; Douglas Wikström (SIAM J. Comput., 2011)

A Mix-Net from Any CCA2 Secure Cryptosystem. - Shahram Khazaei; Tal Moran; Douglas Wikström (ASIACRYPT, 2012)

A New Implementation of a Dual (Paper and Cryptographic) Voting System. - Jonathan Ben-Nun; Niko Fahri; Morgan Llewellyn; Ben Riva; Alon Rosen; Amnon Ta-Shma; Douglas Wikström (Electronic Voting, 2012)

Efficiency Limitations of Σ-Protocols for Group Homomorphisms Revisited. - Björn Terelius; Douglas Wikström (SCN, 2012)

Cryptanalysis of a Universally Verifiable Efficient Re-encryption Mixnet. - Shahram Khazaei; Björn Terelius; Douglas Wikström (IACR Cryptol. ePrint Arch., 2012)

Randomized Partial Checking Revisited. - Shahram Khazaei; Douglas Wikström (IACR Cryptol. ePrint Arch., 2012)

Parallel Repetition of Computationally Sound Protocols Revisited. - Krzysztof Pietrzak; Douglas Wikström (J. Cryptol., 2012)

Simplified Universal Composability Framework. - Douglas Wikström (TCC (A1), 2016)

Return Code Schemes for Electronic Voting Systems. - Shahram Khazaei; Douglas Wikström (E-VOTE-ID, 2017)

How Could Snowden Attack an Election? - Douglas Wikström; Jordi Barrat; Sven Heiberg; Robert Krimmer; Carsten Schürmann (E-VOTE-ID, 2017)

Anomalous Look at Provable Security. - Douglas Wikström (IACR Cryptol. ePrint Arch., 2019)

Blackbox Constructions from Mix-Nets. - Douglas Wikström (IACR Cryptol. ePrint Arch., 2019)

Sorald: Automatic Patch Suggestions for SonarQube Static Analysis Violations. - Khashayar Etemadi; Nicolas Harrand; Simon Larsén; Haris Adzemovic; Henry Luong Phu; Ashutosh Verma; Fernanda Madeiral; Douglas Wikström; Martin Monperrus (IEEE Trans. Dependable Secur. Comput., 2023)

Special Soundness Revisited. - Douglas Wikström (IACR Commun. Cryptol., 2024)

Special Soundness in the Random Oracle Model. - Douglas Wikström (IACR Commun. Cryptol., 2024)