- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c24 |      | |
| 2012 | ||
| j2 | | Krzysztof Pietrzak, Douglas Wikström: Parallel Repetition of Computationally Sound Protocols Revisited. J. Cryptology 25(1): 116-135 (2012) |
| c23 | | Shahram Khazaei, Tal Moran, Douglas Wikström: A Mix-Net from Any CCA2 Secure Cryptosystem. ASIACRYPT 2012: 607-625 |
| c22 |  | Jonathan Ben-Nun, Niko Fahri, Morgan Llewellyn, Ben Riva, Alon Rosen, Amnon Ta-Shma, Douglas Wikström: A New Implementation of a Dual (Paper and Cryptographic) Voting System. Electronic Voting 2012: 315-329 |
| c21 | | Björn Terelius, Douglas Wikström: Efficiency Limitations of Σ-Protocols for Group Homomorphisms Revisited. SCN 2012: 461-476 |
| i12 | | Shahram Khazaei, Douglas Wikström: Randomized Partial Checking Revisited. IACR Cryptology ePrint Archive 2012: 63 (2012) |
| i11 | | Shahram Khazaei, Björn Terelius, Douglas Wikström: Cryptanalysis of a Universally Verifiable Efficient Re-encryption Mixnet. IACR Cryptology ePrint Archive 2012: 100 (2012) |
| 2011 | ||
| j1 | | Rafael Pass, Wei-Lung Dustin Tseng, Douglas Wikström: On the Composition of Public-Coin Zero-Knowledge Protocols. SIAM J. Comput. 40(6): 1529-1553 (2011) |
| i10 | | Douglas Wikström: A Commitment-Consistent Proof of a Shuffle. IACR Cryptology ePrint Archive 2011: 168 (2011) |
| 2010 | ||
| c20 | | |
| c19 | | Gunnar Kreitz, Mads Dam, Douglas Wikström: Practical Private Information Aggregation in Large Networks. NordSec 2010: 89-103 |
| c18 | | |
| c17 | | Johan Håstad, Rafael Pass, Douglas Wikström, Krzysztof Pietrzak: An Efficient Parallel Repetition Theorem. TCC 2010: 1-18 |
| i9 | | Bartosz Przydatek, Douglas Wikström: Group Message Authentication. IACR Cryptology ePrint Archive 2010: 587 (2010) |
| 2009 | ||
| c16 | | |
| c15 | | Rafael Pass, Wei-Lung Dustin Tseng, Douglas Wikström: On the Composition of Public-Coin Zero-Knowledge Protocols. CRYPTO 2009: 160-176 |
| i8 | | Douglas Wikström: An Efficient Concurrent Repetition Theorem. IACR Cryptology ePrint Archive 2009: 347 (2009) |
| 2008 | ||
| c14 | | |
| 2007 | ||
| c13 | | |
| c12 | | Krzysztof Pietrzak, Douglas Wikström: Parallel Repetition of Computationally Sound Protocols Revisited. TCC 2007: 86-102 |
| c11 | | |
| c10 | | |
| i7 | | |
| 2006 | ||
| c9 | | Douglas Wikström, Jens Groth: An Adaptively Secure Mix-Net Without Erasures. ICALP (2) 2006: 276-287 |
| i6 | | Douglas Wikström: Designated Confirmer Signatures Revisited. IACR Cryptology ePrint Archive 2006: 123 (2006) |
| i5 | | Douglas Wikström: Simplified Submission of Inputs to Protocols. IACR Cryptology ePrint Archive 2006: 259 (2006) |
| 2005 | ||
| c8 | | |
| c7 | | |
| c6 | | |
| i4 | | Douglas Wikström: A Sender Verifiable Mix-Net and a New Proof of a Shuffle. IACR Cryptology ePrint Archive 2005: 137 (2005) |
| i3 | | Ben Adida, Douglas Wikström: How to Shuffle in Public. IACR Cryptology ePrint Archive 2005: 394 (2005) |
| 2004 | ||
| c5 | | Douglas Wikström: Universally Composable DKG with Linear Number of Exponentiations. SCN 2004: 263-277 |
| c4 | | |
| i2 | | Douglas Wikström: Universally Composable DKG with Linear Number of Exponentiations. IACR Cryptology ePrint Archive 2004: 124 (2004) |
| i1 | | Mårten Trolin, Douglas Wikström: Hierarchical Group Signatures. IACR Cryptology ePrint Archive 2004: 311 (2004) |
| 2003 | ||
| c3 | | Douglas Wikström: Five Practical Attacks for "Optimistic Mixing for Exit-Polls". Selected Areas in Cryptography 2003: 160-175 |
| 2002 | ||
| c2 | | |
| c1 | | Douglas Wikström: The Security of a Mix-Center Based on a Semantically Secure Cryptosystem. INDOCRYPT 2002: 368-381 |
Colors in the list of coauthors
Last update Sun May 19 00:44:17 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page