Publications

[Extracted from DiVA, the publication database at KTH.]

Wikström, D.; Barrat, J.; Heiberg, S.; Krimmer, R.; Schürmann, C. (2017):
How could Snowden attack an election?.
[Conference paper] 2nd International Joint Conference on Electronic Voting, E-Vote-ID 2017, Bregenz, Austria, 24 October 2017 through 27 October 2017; 2nd International Joint Conference on Electronic Voting, E-Vote-ID 2017 280-291 [Details]
Khazaei, S.; Wikström, D. (2017):
Return code schemes for electronic voting systems.
[Conference paper] 2nd International Joint Conference on Electronic Voting, E-Vote-ID 2017, Bregenz, Austria, 24 October 2017 through 27 October 2017; 2nd International Joint Conference on Electronic Voting, E-Vote-ID 2017 198-209 [Details]
Wikström, D. (2016):
Simplified universal composability framework.
[Conference paper] 13th International Conference on Theory of Cryptography, TCC 2016; Tel Aviv; Israel; 13th International Conference on Theory of Cryptography, TCC 2016 566-595 [Details]
Khazaei, S.; Wikström, D. (2013):
Randomized partial checking revisited.
[Conference paper] Cryptographers' Track at the RSA Conference 2013, CT-RSA 2013, 25 February 2013 through 1 March 2013, San Francisco, CA; Lect. Notes Comput. Sci. 115-128 [Details]
Ben-Nun, J.; Farhi, N.; Llewellyn, M.; Riva, B.; Rosen, A.; Ta-Shma, A.; Wikström, D. (2012):
A new implementation of a dual (paper and cryptographic) voting system.
[Conference paper] 5th International Conference on Electronic Voting, EVOTE 2012, 11-14 July 2012, Bregenz, Austria; 315-329 [Details]
Khazaei, S.; Moran, T.; Wikström, D. (2012):
A mix-net from any CCA2 secure cryptosystem.
[Conference paper] 18th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2012, 2 December 2012 through 6 December 2012, Beijing; Advances in Cryptology – ASIACRYPT 2012 607-625 [Details]
Khazaei, S.; Wikström, D. (2012):
Randomized Partial Checking Revisited.
Manuscript (preprint) [Details]
Khazaei, S.; Terelius, B.; Wikström, D. (2012):
Cryptanalysis of a Universally Verifiable Efficient Re-encryption Mixnet.
Manuscript (preprint) [Details]
Terelius, B.; Wikström, D. (2012):
Efficiency limitations of Σ-protocols for group homomorphisms revisited.
[Conference paper] 8th International Conference on Security and Cryptography for Networks, SCN 2012, 5 September 2012 through 7 September 2012, Amalfi; Security and Cryptography for Networks 461-476 [Details]
Pietrzak, K.; Wikström, D. (2012):
Parallel Repetition of Computationally Sound Protocols Revisited.
Journal of Cryptology 25: 116-135 [Details]
Kreitz, G.; Dam, M.; Wikström, D. (2012):
Practical Private Information Aggregation in Large Networks.
[Conference paper] 15th Nordic Conference on Secure IT Systems, NordSec 2010;Espoo;27 October 2010 through 29 October 2010; Information Security Technology For Applications 89-103 [Details]
Khazaei, S.; Terelius, B.; Wikström, D. (2012):
Cryptanalysis of a universally verifiable efficient re-encryption mixnet.
[Conference paper] 2012 Electronic Voting Technology Workshop/Workshop on Trustworthy Elections, EVT/WOTE 2012, co-located with the 21st USENIX Security Symposium, 6 August 2012 through 7 August 2012, Bellevue; 2012 Electronic Voting Technology Workshop/Workshop on Trustworthy Elections, EVT/WOTE 2012 [Details]
Pass, R.; Tseng, W.; Wikström, D. (2011):
On the composition of public-coin zero-knowledge protocols.
SIAM journal on computing (Print) 40: 1529-1553 [Details]
Przydatek, B.; Wikström, D. (2010):
Group Message Authentication.
[Conference paper] 7th Conference on Security and Cryptography for Networks. Amalfi, ITALY. SEP 13-15, 2010; SECURITY AND CRYPTOGRAPHY FOR NETWORKS 399-417 [Details]
Håstad, J.; Pass, R.; Wikström, D.; Pietrzak, K. (2010):
An Efficient Parallel Repetition Theorem.
[Conference paper] 7th Theory of Cyptography Conference; THEORY OF CRYPTOGRAPHY, PROCEEDINGS 1-18 [Details]
Terelius, B.; Wikström, D. (2010):
Proofs of Restricted Shuffles.
[Conference paper] 3rd International Conference on Cryptology in Africa; PROGRESS IN CRYPTOLOGY - AFRICACRYPT 2010 100-113 [Details]
Pass, R.; Tseng, W.; Wikström, D. (2009):
On the Composition of Public-Coin Zero-Knowledge Protocols.
[Conference paper] 29th Annual International Cryptology Conference. Santa Barbara, CA. AUG 16-20, 2009; ADVANCES IN CRYPTOLOGY - CRYPTO 2009 160-176 [Details]
Wikström, D. (2009):
A Commitment-Consistent Proof of a Shuffle.
[Conference paper] 14th Australasian Conference on Information Security and Privacy Queensland Univ Technol, Informat Secur Inst, Brisbane, AUSTRALIA, JUL 01-03, 2009; INFORMATION SECURITY AND PRIVACY, PROCEEDINGS 407-421 [Details]
Wikström, D. (2008):
Simplified Submission of Inputs to Protocols.
[Conference paper] 6th International Conference on Security and Cryptography for Networks, SCN 2008; Amalfi; 10 September 2008 through 12 September 2008; Security And Cryptography For Networks, Proceedings 293-308 [Details]
Pietrazak, K.; Wikström, D. (2007):
Parallel repetition of computationally sound protocols revisited.
[Conference paper] 4th Theory of Cryptography Conference. Amsterdam, NETHERLANDS. FEB 21-24, 2007; THEORY OF CRYPTOGRAPHY, PROCEEDINGS 86-102 [Details]
Wikström, D. (2007):
Designated confirmer signatures revisited.
[Conference paper] 4th Theory of Cryptography Conference. Amsterdam, NETHERLANDS. FEB 21-24, 2007; Theory of Cryptography, Proceedings 342-361 [Details]
Adida, B.; Wikström, D. (2007):
Offline/online mixing.
[Conference paper] 34th International Colloquium on Automata, Languages and Programming. Wroclaw, POLAND. JUL 09-13, 2007; AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS 484-495 [Details]
Adida, B.; Wikström, D. (2007):
How to shuffle in public.
[Conference paper] 4th Theory of Cryptography Conference. Amsterdam, NETHERLANDS. FEB 21-24, 2007; THEORY OF CRYPTOGRAPHY, PROCEEDINGS 555-574 [Details]
Wikström, D.; Groth, J. (2006):
An adaptively secure mix-net without erasures.
[Conference paper] 33rd International Colloquium on Automata, Languages and Programming. Venice, ITALY. JUL 10-14, 2006; AUTOMATA, LANGAGES AND PROGRAMMING, PT 2 276-287 [Details]
Wikström, D. (2005):
Universally composable DKG with linear number of exponentiations.
[Conference paper] 4th International Conference on Security in Communication Networks. Amalfi, Italy. SEP 08-10, 2004; Security in Communication Networks 263-277 [Details]
Wikström, D. (2005):
A sender verifiable mix-net and a new proof of a shuffle.
[Conference paper] 11th International Conference on the Theory and Application of Cryptology and Information Security. Chennai, INDIA. DEC 04-08, 2005; ADVANCES IN CRYPTOLOGY ASIACRYPT 200 273-292 [Details]
Trolin, M.; Wikström, D. (2005):
Hierarchical group signatures.
[Conference paper] 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005) Location: Lisbon, PORTUGAL Date: JUL 11-15, 2005; AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS 446-458 [Details]
Wikström, D. (2005):
On the l-ary GCD-algorithm in rings of integers.
[Conference paper] 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005) Location: Lisbon, PORTUGAL Date: JUL 11-15, 2005; AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS 1189-1201 [Details]
Wikström, D. (2005):
On the security of mix-nets and hierarchical group signatures.
Doctoral thesis, monograph [Details]
Wikström, D. (2004):
On the security of mix-nets and related problems.
Licentiate thesis, monograph [Details]
Wikström, D. (2004):
Five Practical Attacks for “Optimistic Mixing for Exit-Polls”.
[Conference paper] 10th Annual International Workshop on Selected Areas in Cryptography. Carleton Univ, Ottawa, CANADA. AUG 14-15, 2003; SELECTED AREAS IN CRYPTOGRAPHY 160-174 [Details]
Wikström, D. (2004):
A universally composable mix-net.
[Conference paper] 1st Theory of Cryptography Conference (TCC 2004). MIT, Cambridge, MA. FEB 19-21, 2004; THEORY OF CRYTOGRAPHY, PROCEEDINGS  Book Series: LECTURE NOTES IN COMPUTER SCIENCE 317-335 [Details]
Wikström, D. (2002):
A note on the malleability of the El Gamal cryptosystem.
[Conference paper] 3rd International Conference on Cryptology in India (INDOCRYRT 02). HYDERABAD, INDIA. DEC 16-18, 2002; PROGRESS IN CRYPTOLOGY - INDOCRYPT 2002, PROCEEDINGS 176-184 [Details]
Wikström, D. (2002):
The security of a mix-center based on a semantically secure cryptosystem.
[Conference paper] 3rd International Conference on Cryptology in India (INDOCRYRT 02). HYDERABAD, INDIA. DEC 16-18, 2002; PROGRESS IN CRYPTOLOGY - INDOCRYPT 2002, PROCEEDINGS 368-381 [Details]