Douglas Wikström

Available identifiers

Publication	Date of Publication	Type
Simplified universal composability framework	2016-03-23	Paper
A mix-net from any CCA2 secure cryptosystem	2013-03-19	Paper
Randomized partial checking revisited	2013-03-18	Paper
Efficiency limitations of \(\Sigma \)-protocols for group homomorphisms revisited	2012-09-25	Paper
Parallel repetition of computationally sound protocols revisited	2012-05-23	Paper
On the composition of public-coin zero-knowledge protocols	2012-03-15	Paper
Group message authentication	2010-09-10	Paper
Proofs of Restricted Shuffles	2010-05-04	Paper
An efficient parallel repetition theorem	2010-02-24	Paper
On the Composition of Public-Coin Zero-Knowledge Protocols	2009-10-20	Paper
A Commitment-Consistent Proof of a Shuffle	2009-06-25	Paper
Theory of Cryptography	2009-05-14	Paper
Simplified Submission of Inputs to Protocols	2008-11-20	Paper
A Sender Verifiable Mix-Net and a New Proof of a Shuffle	2008-03-18	Paper
Offline/Online Mixing	2007-11-28	Paper
An Adaptively Secure Mix-Net Without Erasures	2007-09-11	Paper
How to Shuffle in Public	2007-08-30	Paper
Designated Confirmer Signatures Revisited	2007-08-30	Paper
Parallel Repetition of Computationally Sound Protocols Revisited	2007-08-30	Paper
Security in Communication Networks	2006-10-10	Paper
Automata, Languages and Programming	2006-01-10	Paper
Automata, Languages and Programming	2006-01-10	Paper
Selected Areas in Cryptography	2005-12-27	Paper
https://portal.mardi4nfdi.de/entity/Q4417420	2003-07-29	Paper
https://portal.mardi4nfdi.de/entity/Q4417405	2003-07-29	Paper

This page was built for person: Douglas Wikström