Up a level |
(2013) Computational Soundness of Symbolic Zero-Knowledge Proofs: Weaker Assumptions and Mechanized Verification.
(2012) Computational Soundness without Protocol Restrictions.
(2012) Computational Soundness of Symbolic Zero-knowledge Proofs: Weaker Assumptions and Mechanized Verification.
(2012) Quantum Proofs of Knowledge.
(2012) Security of Blind Signatures Revisited.
(2011) Concurrent composition in the bounded quantum storage model.
(2011) Round Optimal Blind Signatures.
(2011) Termination-Insensitive Computational Indistinguishability (and applications to computational soundness).
(2010) Computationally Sound Verification of Source Code.
(2010) Universally Composable Incoercibility.
(2010) Universally Composable Quantum Multi-Party Computation.
(2009) CSAR: A practical and provable technique to make randomized systems accountable.
(2009) CoSP: a general framework for computational soundness proofs.
(2008) Compromising Reflections or How to Read LCD Monitors Around the Corner.
(2008) Computational Soundness of Symbolic Zero-Knowledge Proofs Against Active Attackers.
(2008) A Formal Language for Cryptographic Pseudocode.
(2008) Limits of Constructive Security Proofs.
(2008) OAEP is Secure Under Key-dependent Messages.
(2008) Towards Key-Dependent Message Security in the Standard Model.
(2008) Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol.
(2007) Information Flow in the Peer-Reviewing Process (extended abstract).
(2007) Long-term Security and Universal Composability.
(2007) On the Necessity of Rewinding in Secure Multiparty Computation.
(2007) Random Oracles and Auxiliary Input.
(2006) On the (Im-)Possibility of Extending Coin Toss.
(2006) Simulatable Security and Polynomially Bounded Concurrent Composition.
(2006) An attack on a group-based cryptographic scheme.
(2005) Comparing Two Notions of Simulatability.
(2005) On Fairness in Simulatability-based Cryptographic Systems.
(2005) On the Notion of Statistical Security in Simulatability Definitions.
(2005) Polynomial Runtime in Simulatability Definitions.
(2012) Polynomial Runtime and Composability.
(2010) Computational Soundness of Symbolic Zero-Knowledge Proofs.
(2010) Long-term Security and Universal Composability.
(2009) Polynomial Runtime in Simulatability Definitions.
(2007) Quantum Programs with Classical Output Streams.
(2007) Universally Composable Zero-Knowledge Arguments and Commitments from Signature Cards.
(2006) Quantum Programming Languages.
(2007) Protokollkomposition und Komplexität.
(2003) Zufallsextraktoren für Quellen variierender Qualität.
(2002) Formal Security in Quantum Cryptology.
(2007) Protokollkomposition und Komplexität.
(2012) Everlasting Quantum Security.
(2012) Programmable encryption and key-dependent messages.
(2011) Composition in Quantum Cryptography.
(2011) Round Optimal Blind Signatures.
(2010) The impossibility of computationally sound XOR.
(2008) Gespiegelt / Verräterische Reflexionen: Wie Brillengläser Geheimnisse verraten.
(2007) On the Security of Protocols with Logarithmic Communication Complexity.
(2007) Vorgetäuscht / Böse Textdokumente -- Postscript gone wild.
(2006) Composable Deniability (abstract).
(2006) On the Necessity of Rewinding in Secure Multiparty Computation.
(2006) A Simple Model of Polynomial Time UC (abstract).
(2005) Oblivious Transfer is Incomplete for Deniable Protocols.
(2005) Relations among Statistical Security Notions - or - Why Exponential Adversaries are Unlimited.
(2004) Classical Control in Quantum Programs.
(2004) Simulatable security for quantum protocols.