default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDouglas Wikström
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Douglas Wikström
:
Special Soundness Revisited. IACR Commun. Cryptol. 1(3): 25 (2024)- [j4]Douglas Wikström:
Special Soundness in the Random Oracle Model. IACR Commun. Cryptol. 1(3): 26 (2024) - 2023
- [j3]Khashayar Etemadi, Nicolas Harrand, Simon Larsén, Haris Adzemovic, Henry Luong Phu, Ashutosh Verma, Fernanda Madeiral, Douglas Wikström, Martin Monperrus:
Sorald: Automatic Patch Suggestions for SonarQube Static Analysis Violations. IEEE Trans. Dependable Secur. Comput. 20(4): 2794-2810 (2023) - 2021
- [i17]Khashayar Etemadi, Nicolas Harrand, Simon Larsén, Haris Adzemovic, Henry Luong Phu, Ashutosh Verma, Fernanda Madeiral, Douglas Wikström, Martin Monperrus:
Sorald: Automatic Patch Suggestions for SonarQube Static Analysis Violations. CoRR abs/2103.12033 (2021) - [i16]Douglas Wikström:
Special Soundness in the Random Oracle Model. IACR Cryptol. ePrint Arch. 2021: 1265 (2021)
2010 – 2019
- 2019
- [i15]Douglas Wikström:
Anomalous Look at Provable Security. IACR Cryptol. ePrint Arch. 2019: 124 (2019) - [i14]Douglas Wikström:
Blackbox Constructions from Mix-Nets. IACR Cryptol. ePrint Arch. 2019: 995 (2019) - 2018
- [i13]Douglas Wikström:
Special Soundness Revisited. IACR Cryptol. ePrint Arch. 2018: 1157 (2018) - 2017
- [c28]Shahram Khazaei, Douglas Wikström:
Return Code Schemes for Electronic Voting Systems. E-VOTE-ID 2017: 198-209 - [c27]Douglas Wikström, Jordi Barrat, Sven Heiberg, Robert Krimmer, Carsten Schürmann:
How Could Snowden Attack an Election? E-VOTE-ID 2017: 280-291 - 2016
- [c26]Douglas Wikström:
Simplified Universal Composability Framework. TCC (A1) 2016: 566-595 - 2015
- [e1]Rolf Haenni, Reto E. Koenig, Douglas Wikström:
E-Voting and Identity - 5th International Conference, VoteID 2015, Bern, Switzerland, September 2-4, 2015, Proceedings. Lecture Notes in Computer Science 9269, Springer 2015, ISBN 978-3-319-22269-1 [contents] - 2013
- [c25]Shahram Khazaei, Douglas Wikström:
Randomized Partial Checking Revisited. CT-RSA 2013: 115-128 - 2012
- [j2]Krzysztof Pietrzak, Douglas Wikström:
Parallel Repetition of Computationally Sound Protocols Revisited. J. Cryptol. 25(1): 116-135 (2012) - [c24]Shahram Khazaei, Tal Moran, Douglas Wikström:
A Mix-Net from Any CCA2 Secure Cryptosystem. ASIACRYPT 2012: 607-625 - [c23]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 - [c22]Björn Terelius, Douglas Wikström:
Efficiency Limitations of Σ-Protocols for Group Homomorphisms Revisited. SCN 2012: 461-476 - [c21]Shahram Khazaei, Björn Terelius, Douglas Wikström:
Cryptanalysis of a Universally Verifiable Efficient Re-encryption Mixnet. EVT/WOTE 2012 - [i12]Shahram Khazaei, Douglas Wikström:
Randomized Partial Checking Revisited. IACR Cryptol. ePrint Arch. 2012: 63 (2012) - [i11]Shahram Khazaei, Björn Terelius, Douglas Wikström:
Cryptanalysis of a Universally Verifiable Efficient Re-encryption Mixnet. IACR Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 2011: 168 (2011) - 2010
- [c20]Björn Terelius, Douglas Wikström:
Proofs of Restricted Shuffles. AFRICACRYPT 2010: 100-113 - [c19]Gunnar Kreitz, Mads Dam, Douglas Wikström:
Practical Private Information Aggregation in Large Networks. NordSec 2010: 89-103 - [c18]Bartosz Przydatek, Douglas Wikström:
Group Message Authentication. SCN 2010: 399-417 - [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 Cryptol. ePrint Arch. 2010: 587 (2010)
2000 – 2009
- 2009
- [c16]Douglas Wikström:
A Commitment-Consistent Proof of a Shuffle. ACISP 2009: 407-421 - [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 Cryptol. ePrint Arch. 2009: 347 (2009) - 2008
- [c14]Douglas Wikström:
Simplified Submission of Inputs to Protocols. SCN 2008: 293-308 - 2007
- [c13]Ben Adida, Douglas Wikström:
Offline/Online Mixing. ICALP 2007: 484-495 - [c12]Krzysztof Pietrzak, Douglas Wikström:
Parallel Repetition of Computationally Sound Protocols Revisited. TCC 2007: 86-102 - [c11]Douglas Wikström:
Designated Confirmer Signatures Revisited. TCC 2007: 342-361 - [c10]Ben Adida, Douglas Wikström:
How to Shuffle in Public. TCC 2007: 555-574 - [i7]Ben Adida, Douglas Wikström:
Offline/Online Mixing. IACR Cryptol. ePrint Arch. 2007: 143 (2007) - 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 Cryptol. ePrint Arch. 2006: 123 (2006) - [i5]Douglas Wikström:
Simplified Submission of Inputs to Protocols. IACR Cryptol. ePrint Arch. 2006: 259 (2006) - 2005
- [b1]Douglas Wikström:
On the security of mix-nets and hierarchical group signatures. Royal Institute of Technology, Stockholm, Sweden, 2005 - [c8]Douglas Wikström:
A Sender Verifiable Mix-Net and a New Proof of a Shuffle. ASIACRYPT 2005: 273-292 - [c7]Mårten Trolin, Douglas Wikström:
Hierarchical Group Signatures. ICALP 2005: 446-458 - [c6]Douglas Wikström:
On the l-Ary GCD-Algorithm in Rings of Integers. ICALP 2005: 1189-1201 - [i4]Douglas Wikström:
A Sender Verifiable Mix-Net and a New Proof of a Shuffle. IACR Cryptol. ePrint Arch. 2005: 137 (2005) - [i3]Ben Adida, Douglas Wikström:
How to Shuffle in Public. IACR Cryptol. ePrint Arch. 2005: 394 (2005) - 2004
- [c5]Douglas Wikström:
Universally Composable DKG with Linear Number of Exponentiations. SCN 2004: 263-277 - [c4]Douglas Wikström:
A Universally Composable Mix-Net. TCC 2004: 317-335 - [i2]Douglas Wikström:
Universally Composable DKG with Linear Number of Exponentiations. IACR Cryptol. ePrint Arch. 2004: 124 (2004) - [i1]Mårten Trolin, Douglas Wikström:
Hierarchical Group Signatures. IACR Cryptol. ePrint Arch. 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]Douglas Wikström:
A Note on the Malleability of the El Gamal Cryptosystem. INDOCRYPT 2002: 176-184 - [c1]Douglas Wikström:
The Security of a Mix-Center Based on a Semantically Secure Cryptosystem. INDOCRYPT 2002: 368-381
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
