Douglas Wikström

According to our database, Douglas Wikström authored at least 35 papers between 2002 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Special Soundness in the Random Oracle Model.

Douglas Wikström

IACR Commun. Cryptol., 2024

Special Soundness Revisited.

Douglas Wikström

IACR Commun. Cryptol., 2024

2023

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

2019

Blackbox Constructions from Mix-Nets.

Douglas Wikström

IACR Cryptol. ePrint Arch., 2019

Anomalous Look at Provable Security.

Douglas Wikström

IACR Cryptol. ePrint Arch., 2019

2017

How Could Snowden Attack an Election?

Douglas Wikström, Jordi Barrat, Sven Heiberg, Robert Krimmer, Carsten Schürmann

Proceedings of the Electronic Voting - Second International Joint Conference, 2017

Return Code Schemes for Electronic Voting Systems.

Shahram Khazaei, Douglas Wikström

Proceedings of the Electronic Voting - Second International Joint Conference, 2017

2016

Simplified Universal Composability Framework.

Douglas Wikström

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

2012

Parallel Repetition of Computationally Sound Protocols Revisited.

Krzysztof Pietrzak, Douglas Wikström

J. Cryptol., 2012

Randomized Partial Checking Revisited.

Shahram Khazaei, Douglas Wikström

IACR Cryptol. ePrint Arch., 2012

Cryptanalysis of a Universally Verifiable Efficient Re-encryption Mixnet.

Shahram Khazaei, Björn Terelius, Douglas Wikström

IACR Cryptol. ePrint Arch., 2012

Efficiency Limitations of Σ-Protocols for Group Homomorphisms Revisited.

Björn Terelius, Douglas Wikström

Proceedings of the Security and Cryptography for Networks - 8th International Conference, 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

Proceedings of the 5th International Conference on Electronic Voting 2012, 2012

A Mix-Net from Any CCA2 Secure Cryptosystem.

Shahram Khazaei, Tal Moran, Douglas Wikström

Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011

On the Composition of Public-Coin Zero-Knowledge Protocols.

Rafael Pass, Wei-Lung Dustin Tseng, Douglas Wikström

SIAM J. Comput., 2011

A Commitment-Consistent Proof of a Shuffle.

Douglas Wikström

IACR Cryptol. ePrint Arch., 2011

2010

Group Message Authentication.

Bartosz Przydatek, Douglas Wikström

IACR Cryptol. ePrint Arch., 2010

An Efficient Parallel Repetition Theorem.

Johan Håstad, Rafael Pass, Douglas Wikström, Krzysztof Pietrzak

Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Practical Private Information Aggregation in Large Networks.

Gunnar Kreitz, Mads Dam, Douglas Wikström

Proceedings of the Information Security Technology for Applications, 2010

Proofs of Restricted Shuffles.

Björn Terelius, Douglas Wikström

Proceedings of the Progress in Cryptology, 2010

2009

An Efficient Concurrent Repetition Theorem.

Douglas Wikström

IACR Cryptol. ePrint Arch., 2009

2007

Offline/Online Mixing.

Ben Adida, Douglas Wikström

IACR Cryptol. ePrint Arch., 2007

2006

Simplified Submission of Inputs to Protocols.

Douglas Wikström

IACR Cryptol. ePrint Arch., 2006

Designated Confirmer Signatures Revisited.

Douglas Wikström

IACR Cryptol. ePrint Arch., 2006

An Adaptively Secure Mix-Net Without Erasures.

Douglas Wikström, Jens Groth

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

On the security of mix-nets and hierarchical group signatures.

Douglas Wikström

PhD thesis, 2005

A Sender Verifiable Mix-Net and a New Proof of a Shuffle.

Douglas Wikström

IACR Cryptol. ePrint Arch., 2005

How to Shuffle in Public.

Ben Adida, Douglas Wikström

IACR Cryptol. ePrint Arch., 2005

On the <i>l</i>-Ary GCD-Algorithm in Rings of Integers.

Douglas Wikström

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

Universally Composable DKG with Linear Number of Exponentiations.

Douglas Wikström

IACR Cryptol. ePrint Arch., 2004

Hierarchical Group Signatures.

Mårten Trolin, Douglas Wikström

IACR Cryptol. ePrint Arch., 2004

A Universally Composable Mix-Net.

Douglas Wikström

Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

2003

Five Practical Attacks for "Optimistic Mixing for Exit-Polls".

Douglas Wikström

Proceedings of the Selected Areas in Cryptography, 10th Annual International Workshop, 2003

2002

The Security of a Mix-Center Based on a Semantically Secure Cryptosystem.

Douglas Wikström

Proceedings of the Progress in Cryptology, 2002

A Note on the Malleability of the El Gamal Cryptosystem.

Douglas Wikström

Proceedings of the Progress in Cryptology, 2002