- Bacelar Almeida, Firsov, Oliveira, Unruh. Leakage-Free Probabilistic Jasmin Programs (report, 2023) [more info | eprint]
- Firsov, Unruh. Zero-Knowledge in EasyCrypt (CSF 2023) [more info | eprint]
- Bacelar Almeida, Firsov, Oliveira, Unruh. Schnorr protocol in Jasmin (report, 2023) [more info | eprint]
- Unruh. Towards compressed permutation oracles (Asiacrypt 2023) [more info | eprint | official]
- Duman, Hövelmanns, Kiltz, Lyubashevsky, Seiler, Unruh. A Thorough Treatment of Highly-Efficient NTRU Instantiations (PKC 2023) [more info | eprint]
- Yan, Unruh, Fang, Zhou. How to Base Security on the Perfect/Statistical Binding Property of Quantum Bit Commitment? (ISAAC 2022) [more info | eprint | official]
- Unruh. Quantum relational Hoare logic, towards a formalization (PLanQC) [more info]
- Unruh. The quantum random oracle model (IPAM Graduate Summer School on Post-quantum and Quantum Cryptography, 2022) [more info]
- Magri, Malavolta, Schröder, Unruh. Everlasting UC Commitments from Fully Malicious PUFs (J Cryptology, 2022) [more info | eprint | official]
- Xu, Ying, Valiron, Unruh. Reasoning about Parameterized Recursive Quantum Programs with Ancilla Data and Probabilistic Control: a unified assertion logic for verifying both classical and quantum programs (Transactions on Computational Logic, 2022) [more info]
- Firsov, Unruh. Reflection, Rewinding, and Coin-Toss in EasyCrypt (CPP 2022) [more info | eprint | official]
- Carstens, Ebrahimi, Tabia, Unruh. Relationships between quantum IND-CPA notions (TCC 2021) [more info | eprint | official]
- Unruh. Quantum and Classical Registers (Archive of Formal Proofs,, 2021) [more info | official]
- Unruh. Quantum rewinding (Quiques, 2021) [more info]
- Caballero, Unruh. Complex Bounded Operators (Archive of Formal Proofs,, 2021) [more info | official]
- Li, Unruh. Quantum Relational Hoare Logic with Expectations (ICALP 2021, track B) [more info | eprint | official]
- Unruh. Quantum and classical registers (PlanQC 2021) [more info | eprint]
- Unruh. Compressed Permutation Oracles (And the Collision-Resistance of Sponge/SHA3) (report, 2021) [more info | eprint]
- Unruh. Recording quantum queries – explained (report, 2020) [more info | eprint]
- Unruh. Post-Quantum Verification of Fujisaki-Okamoto (AsiaCrypt 2020) [more info | eprint | official]
- Unruh. Local Variables and Quantum Relational Hoare Logic (report, 2020) [more info | eprint]
- Hövelmanns, Kiltz, Schäge, Unruh. Generic Authenticated Key Exchange in the Quantum Random Oracle Model (PKC 2020) [more info | eprint | official]
- Caballero, Unruh. Banach-Steinhaus Theorem (Archive of Formal Proofs,, 2020) [more info | official]
- Ambainis, Hamburg, Unruh. Quantum Security Proofs Using Semi-classical Oracles (Crypto 2019) [more info | eprint | official]
- Unruh. Quantum Hoare Logic with Ghost Variables (LICS 2019) [more info | eprint | official]
- Unruh. Quantum Relational Hoare Logic (POPL 2019) [more info | eprint | official]
- Targhi, Unruh. Quantum Collision-Resistance of Non-uniformly Distributed Functions: Upper and Lower Bounds (QIC, 2018) [more info | eprint | official]
- Hofheinz, Müller-Quade, Unruh. On the (Im-)Possibility of Extending Coin Toss (Journal of Cryptology, 2018) [more info | eprint | official]
- Czajkowski, Groot Bruinderink, Hülsing, Schaffner, Unruh. Post-quantum security of the sponge construction (PQCrypto 2018) [more info | eprint | official]
- Carstens, Ebrahimi, Tabia, Unruh. On Quantum Indifferentiability (report, 2018) [more info | eprint]
- Unruh. Everlasting Multi-Party Computation (Journal of Cryptology, 2018) [more info | eprint | official]
- Unruh. Post-Quantum Security of Fiat-Shamir (Asiacrypt 2017) [more info | eprint | official]
- Schröder, Unruh. Security of Blind Signatures Revisited (Journal of Cryptology, 2017) [more info | eprint | official]
- Unruh. Collapsing sponges: Post-quantum security of the sponge construction (report, 2017) [more info | eprint]
- Targhi, Unruh. Quantum Security of the Fujisaki-Okamoto and OAEP Transforms (TCC 2016-B, part II) [more info | eprint | official]
- Brodutch, Nagaj, Sattath, Unruh. An adaptive attack on Wiesner's quantum money (QIC, 2016) [more info | eprint | official]
- Unruh. Collapse-binding quantum commitments without random oracles (Asiacrypt 2016) [more info | eprint | official]
- Unruh. Computationally binding quantum commitments (Eurocrypt 2016) [more info | eprint | official]
- Böhl, Unruh. Symbolic Universal Composability (J Computer Security, 2016) [more info | eprint | official]
- Targhi, Tabia, Unruh. Quantum Collision-Resistance of Non-Uniformly Distributed Functions (PQCrypto 2016) [more info | eprint | official]
- Anand, Targhi, Tabia, Unruh. Post-Quantum Security of the CBC, CFB, OFB, CTR, and XTS Modes of Operation (PQCrypto 2016) [more info | eprint | official]
- Unruh. Revocable quantum timed-release encryption (Journal of the ACM, 2015) [more info | eprint | official]
- Targhi, Tabia, Unruh. Quantum collision-resistance of non-uniformly distributed functions (QCrypt 2015) [more info | official]
- Targhi, Unruh. Quantum security of the Fujisaki-Okamoto transform (QCrypt 2015) [more info | official]
- Barthe, Hicks, Kerschbaum, Unruh. The Synergy Between Programming Languages and Cryptography (Dagstuhl Seminar 14492) (Dagstuhl Reports, 2015) [more info | official]
- Unruh. Non-interactive zero-knowledge proofs in the quantum random oracle model (Eurocrypt 2015) [more info | eprint | official]
- Ambainis, Rosmanis, Unruh. Quantum Attacks on Classical Proof Systems (The Hardness of Quantum Rewinding) (FOCS 2014) [more info | eprint | official]
- Unruh. Quantum position verification in the random oracle model (Crypto 2014) [more info | eprint | official]
- Unruh. Revocable quantum timed-release encryption (Eurocrypt 2014) [more info | eprint | official]
- Unruh. Everlasting Multi-Party Computation (Crypto 2013) [more info | eprint | official]
- Böhl, Unruh. Symbolic Universal Composability (CSF 2013) [more info | eprint | official]
- Klingler, Steinwandt, Unruh. On using probabilistic Turing machines to model participants in cryptographic protocols (Theoretical Computer Science, 2013) [more info | eprint | official]
- Backes, Bendun, Unruh. Computational Soundness of Symbolic Zero-Knowledge Proofs: Weaker Assumptions and Mechanized Verification (POST 2013) [more info | eprint | official]
- Backes, Malik, Unruh. Computational Soundness without Protocol Restrictions (ACM CCS 2012) [more info | eprint | official]
- Unruh. Programmable encryption and key-dependent messages (report, 2012) [more info | eprint]
- Hofheinz, Unruh, Müller-Quade. Polynomial Runtime and Composability (Journal of Cryptology, 2012) [more info | eprint | official]
- Schröder, Unruh. Security of Blind Signatures Revisited (PKC 2012) [more info | eprint | official]
- Unruh. Quantum Proofs of Knowledge (Eurocrypt 2012) [more info | eprint | official]
- Schröder, Unruh, Garg, Rao, Sahai. Round Optimal Blind Signatures (Crypto 2011) [more info | official]
- Unruh. Termination-Insensitive Computational Indistinguishability (and applications to computational soundness) (CSF 2011) [more info | eprint | official]
- Schröder, Unruh. Round Optimal Blind Signatures (report, 2011) [more info | eprint]
- Unruh. Concurrent composition in the bounded quantum storage model (Eurocrypt 2011) [more info | eprint | official]
- Backes, Maffei, Unruh. Computationally Sound Verification of Source Code (ACM CCS 2010) [more info | eprint | official]
- Backes, Unruh. Computational Soundness of Symbolic Zero-Knowledge Proofs (Journal of Computer Security, 2010) [more info | eprint | official]
- Unruh, Müller-Quade. Universally Composable Incoercibility (Crypto 2010) [more info | eprint | official]
- Unruh. The impossibility of computationally sound XOR (report, 2010) [more info | eprint]
- Unruh. Universally Composable Quantum Multi-Party Computation (Eurocrypt 2010) [more info | eprint | official]
- Backes, Hofheinz, Unruh. CoSP: A general framework for computational soundness proofs (ACM CCS 2009) [more info | eprint | official]
- Hofheinz, Müller-Quade, Unruh. Polynomial Runtime in Simulatability Definitions (Journal of Computer Security, 2009) [more info | eprint | official]
- Müller-Quade, Unruh. Long-term Security and Universal Composability (Journal of Cryptology, 2010) [more info | eprint | official]
- Backes, Druschel, Haeberlen, Unruh. CSAR: A practical and provable technique to make randomized systems accountable (NDSS 2009) [more info | eprint | official]
- Backes, Unruh. Limits of Constructive Security Proofs (Asiacrypt 2008) [more info | eprint | official]
- Backes, Dürmuth, Unruh. OAEP is Secure Under Key-dependent Messages (Asiacrypt 2008) [more info | eprint | official]
- Backes, Berg, Unruh. A Formal Language for Cryptographic Pseudocode (LPAR 2008) [more info | official]
- Backes, Unruh. Computational Soundness of Symbolic Zero-Knowledge Proofs Against Active Attackers (CSF 2008) [more info | eprint | official]
- Backes, Dürmuth, Unruh. Compromising Reflections or How to Read LCD Monitors Around the Corner (IEEE Security and Privacy 2008) [more info | eprint | official]
- Backes, Maffei, Unruh. Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol (IEEE Security and Privacy 2008) [more info | eprint | official]
- Backes, Dürmuth, Unruh. Gespiegelt / Verräterische Reflexionen: Wie Brillengläser Geheimnisse verraten (iX Magazin für Professionelle Informationstechnik, 2008) [more info | official]
- Hofheinz, Unruh. Towards Key-Dependent Message Security in the Standard Model (Eurocrypt 2008) [more info | eprint | official]
- Hofheinz, Müller-Quade, Unruh. Polynomial Runtime in Simulatability Definitions (CSFW 2005) [more info | eprint | official]
- Unruh. Random Oracles and Auxiliary Input (Crypto 2007) [more info | eprint | official]
- Backes, Dürmuth, Unruh. Vorgetäuscht / Böse Textdokumente – Postscript gone wild (iX Magazin für Professionelle Informationstechnik, 2007) [more info | official]
- Unruh. Protokollkomposition und Komplexität (2007) [more info | eprint]
- Backes, Unruh. On the Security of Protocols with Logarithmic Communication Complexity (report, 2007) [more info | eprint]
- Backes, Dürmuth, Unruh. Information Flow in the Peer-Reviewing Process (extended abstract) (IEEE Security and Privacy 2007) [more info | eprint | official]
- Unruh. Quantum Programs with Classical Output Streams (ENTCS, 2007) [more info | eprint | official]
- Müller-Quade, Unruh. Long-term Security and Universal Composability (TCC 2007) [more info | eprint | official]
- Backes, Müller-Quade, Unruh. On the Necessity of Rewinding in Secure Multiparty Computation (TCC 2007) [more info | eprint | official]
- Unruh. Protokollkomposition und Komplexität (2007) [more info | eprint | official]
- Hofheinz, Unruh. An attack on a group-based cryptographic scheme (Algebraic Methods in Cryptography, 2006) [more info | eprint | official]
- Unruh. Quantum Programming Languages (Informatik - Forschung und Entwicklung, 2006) [more info | eprint | official]
- Hofheinz, Müller-Quade, Unruh. A Simple Model of Polynomial Time UC (abstract) (Workshop on Models for Cryptographic Protocols 2006) [more info | eprint]
- Müller-Quade, Unruh. Composable Deniability (abstract) (Workshop on Models for Cryptographic Protocols 2006) [more info | eprint]
- Hofheinz, Müller-Quade, Unruh. On the (Im-)Possibility of Extending Coin Toss (Eurocrypt 2006) [more info | eprint | official]
- Hofheinz, Unruh. Simulatable Security and Polynomially Bounded Concurrent Composition (IEEE Security and Privacy 2006) [more info | eprint | official]
- Unruh. Relations among Statistical Security Notions - or - Why Exponential Adversaries are Unlimited (report, 2005) [more info | eprint]
- Backes, Hofheinz, Müller-Quade, Unruh. On Fairness in Simulatability-based Cryptographic Systems (ACM Workshop Formal Methods in Security Engineering, FMSE 2005) [more info | eprint | official]
- Hofheinz, Unruh. On the Notion of Statistical Security in Simulatability Definitions (ISC'05, 2005) [more info | eprint | official]
- Hofheinz, Unruh, Müller-Quade. Universally Composable Zero-Knowledge Arguments and Commitments from Signature Cards (Moraviacrypt '05, 2007) [more info | eprint | official]
- Müller-Quade, Röhrich, Unruh. Oblivious Transfer is Incomplete for Deniable Protocols (Workshop on The Past, Present and Future of Oblivious Transfer, 2005) [more info | eprint]
- Hofheinz, Unruh. Comparing Two Notions of Simulatability (TCC 2005) [more info | eprint | official]
- Unruh. Simulatable security for quantum protocols (report, 2004) [more info | eprint]
- Unruh. Classical Control in Quantum Programs (QIPC 2004) [more info | eprint]
- Unruh. Zufallsextraktoren für Quellen variierender Qualität (2003) [more info | eprint]
- Unruh. Formal Security in Quantum Cryptology (2002) [more info | eprint]