Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Dominique Unruh
2010 – today
- 2013
[j6]Dennis Hofheinz, Dominique Unruh, Jörn Müller-Quade: Polynomial Runtime and Composability. J. Cryptology 26(3): 375-441 (2013)- [c30]Michael Backes, Fabian Bendun, Dominique Unruh: Computational Soundness of Symbolic Zero-Knowledge Proofs: Weaker Assumptions and Mechanized Verification. POST 2013: 206-225
- [i27]Florian Böhl, Dominique Unruh: Symbolic Universal Composability. IACR Cryptology ePrint Archive 2013: 62 (2013)
- 2012
- [c29]Michael Backes, Ankit Malik, Dominique Unruh: Computational soundness without protocol restrictions. ACM Conference on Computer and Communications Security 2012: 699-711
- [c28]
- [c27]Dominique Schröder, Dominique Unruh: Security of Blind Signatures Revisited. Public Key Cryptography 2012: 662-679
- [i26]Michael Backes, Fabian Bendun, Dominique Unruh: Computational Soundness of Symbolic Zero-knowledge Proofs: Weaker Assumptions and Mechanized Verification. IACR Cryptology ePrint Archive 2012: 81 (2012)
- [i25]
- [i24]Dominique Unruh: Programmable encryption and key-dependent messages. IACR Cryptology ePrint Archive 2012: 423 (2012)
- [i23]Michael Backes, Ankit Malik, Dominique Unruh: Computational Soundness without Protocol Restrictions. IACR Cryptology ePrint Archive 2012: 486 (2012)
- 2011
- [c26]Sanjam Garg, Vanishree Rao, Amit Sahai, Dominique Schröder, Dominique Unruh: Round Optimal Blind Signatures. CRYPTO 2011: 630-648
- [c25]Dominique Unruh: Termination-Insensitive Computational Indistinguishability (and Applications to Computational Soundness). CSF 2011: 251-265
- [c24]Dominique Unruh: Concurrent Composition in the Bounded Quantum Storage Model. EUROCRYPT 2011: 467-486
- [i22]Dominique Schröder, Dominique Unruh: Round Optimal Blind Signatures. IACR Cryptology ePrint Archive 2011: 264 (2011)
- [i21]Dominique Schröder, Dominique Unruh: Security of Blind Signatures Revisited. IACR Cryptology ePrint Archive 2011: 316 (2011)
- 2010
- [j5]Michael Backes, Dominique Unruh: Computational soundness of symbolic zero-knowledge proofs. Journal of Computer Security 18(6): 1077-1155 (2010)
- [j4]Jörn Müller-Quade, Dominique Unruh: Long-Term Security and Universal Composability. J. Cryptology 23(4): 594-671 (2010)
- [c23]Michael Backes, Matteo Maffei, Dominique Unruh: Computationally sound verification of source code. ACM Conference on Computer and Communications Security 2010: 387-398
- [c22]
- [c21]
- [i20]
- [i19]Dominique Unruh: Concurrent composition in the bounded quantum storage model. IACR Cryptology ePrint Archive 2010: 229 (2010)
- [i18]Dominique Unruh: The impossibility of computationally sound XOR. IACR Cryptology ePrint Archive 2010: 389 (2010)
- [i17]Michael Backes, Matteo Maffei, Dominique Unruh: Computationally Sound Verification of Source Code. IACR Cryptology ePrint Archive 2010: 416 (2010)
- [i16]Dominique Unruh: Termination-Insensitive Computational Indistinguishability (and applications to computational soundness). IACR Cryptology ePrint Archive 2010: 505 (2010)
2000 – 2009
- 2009
- [j3]Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh: Polynomial runtime in simulatability definitions. Journal of Computer Security 17(5): 703-735 (2009)
- [c20]Michael Backes, Dennis Hofheinz, Dominique Unruh: CoSP: a general framework for computational soundness proofs. ACM Conference on Computer and Communications Security 2009: 66-78
- [c19]Michael Backes, Peter Druschel, Andreas Haeberlen, Dominique Unruh: CSAR: A Practical and Provable Technique to Make Randomized Systems Accountable. NDSS 2009
- [i15]Dennis Hofheinz, Dominique Unruh, Jörn Müller-Quade: Polynomial Runtime and Composability. IACR Cryptology ePrint Archive 2009: 23 (2009)
- [i14]Michael Backes, Dennis Hofheinz, Dominique Unruh: CoSP: A General Framework For Computational Soundness Proofs. IACR Cryptology ePrint Archive 2009: 80 (2009)
- [i13]Dominique Unruh, Jörn Müller-Quade: Universally Composable Incoercibility. IACR Cryptology ePrint Archive 2009: 520 (2009)
- 2008
- [c18]
- [c17]Michael Backes, Markus Dürmuth, Dominique Unruh: OAEP Is Secure under Key-Dependent Messages. ASIACRYPT 2008: 506-523
- [c16]Michael Backes, Dominique Unruh: Computational Soundness of Symbolic Zero-Knowledge Proofs Against Active Attackers. CSF 2008: 255-269
- [c15]Dennis Hofheinz, Dominique Unruh: Towards Key-Dependent Message Security in the Standard Model. EUROCRYPT 2008: 108-126
- [c14]Michael Backes, Matthias Berg, Dominique Unruh: A Formal Language for Cryptographic Pseudocode. LPAR 2008: 353-376
- [c13]Michael Backes, Markus Dürmuth, Dominique Unruh: Compromising Reflections-or-How to Read LCD Monitors around the Corner. IEEE Symposium on Security and Privacy 2008: 158-169
- [c12]Michael Backes, Matteo Maffei, Dominique Unruh: Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol. IEEE Symposium on Security and Privacy 2008: 202-215
- [i12]Michael Backes, Dominique Unruh: Computational soundness of symbolic zero-knowledge proofs. IACR Cryptology ePrint Archive 2008: 152 (2008)
- 2007
- [j2]Dominique Unruh: Quantum Programs With Classical Output Streams: (Extended Abstract). Electr. Notes Theor. Comput. Sci. 170: 165-184 (2007)
- [c11]
- [c10]Michael Backes, Matteo Maffei, Dominique Unruh: Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol. Formal Protocol Verification Applied 2007
- [c9]Michael Backes, Markus Dürmuth, Dominique Unruh: Information Flow in the Peer-Reviewing Process. IEEE Symposium on Security and Privacy 2007: 187-191
- [c8]
- [c7]Michael Backes, Jörn Müller-Quade, Dominique Unruh: On the Necessity of Rewinding in Secure Multiparty Computation. TCC 2007: 157-173
- [i11]Dominique Unruh: Random Oracles and Auxiliary Input. IACR Cryptology ePrint Archive 2007: 168 (2007)
- [i10]Michael Backes, Dominique Unruh: On the Security of Protocols with Logarithmic Communication Complexity. IACR Cryptology ePrint Archive 2007: 169 (2007)
- [i9]Michael Backes, Matteo Maffei, Dominique Unruh: Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol. IACR Cryptology ePrint Archive 2007: 289 (2007)
- [i8]Dennis Hofheinz, Dominique Unruh: Towards Key-Dependent Message Security in the Standard Model. IACR Cryptology ePrint Archive 2007: 333 (2007)
- 2006
- [b1]Dominique Unruh: Protokollkomposition und Komplexität. Logos 2006, pp. 1-326
- [j1]
- [c6]Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh: On the (Im-)Possibility of Extending Coin Toss. EUROCRYPT 2006: 504-521
- [c5]Dennis Hofheinz, Dominique Unruh: Simulatable Security and Polynomially Bounded Concurrent Composability. IEEE Symposium on Security and Privacy 2006: 169-183
- [i7]Dennis Hofheinz, Dominique Unruh: Simulatable Security and Polynomially Bounded Concurrent Composition. IACR Cryptology ePrint Archive 2006: 130 (2006)
- [i6]Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh: On the (Im-)Possibility of Extending Coin Toss. IACR Cryptology ePrint Archive 2006: 177 (2006)
- [i5]Michael Backes, Jörn Müller-Quade, Dominique Unruh: On the Necessity of Rewinding in Secure Multiparty Computation. IACR Cryptology ePrint Archive 2006: 315 (2006)
- [i4]Jörn Müller-Quade, Dominique Unruh: Long-term Security and Universal Composability. IACR Cryptology ePrint Archive 2006: 422 (2006)
- 2005
- [c4]Michael Backes, Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh: On fairness in simulatability-based cryptographic systems. FMSE 2005: 13-22
- [c3]Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh: Polynomial Runtime in Simulatability Definitions. CSFW 2005: 156-169
- [c2]Dennis Hofheinz, Dominique Unruh: On the Notion of Statistical Security in Simulatability Definitions. ISC 2005: 118-133
- [c1]
- [i3]Dennis Hofheinz, Dominique Unruh: On the Notion of Statistical Security in Simulatability Definitions. IACR Cryptology ePrint Archive 2005: 32 (2005)
- [i2]Michael Backes, Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh: On Fairness in Simulatability-based Cryptographic Systems. IACR Cryptology ePrint Archive 2005: 294 (2005)
- [i1]Dominique Unruh: Relations amount Statistical Security Notions - or - Why Exponential Adversaries are Unlimited. IACR Cryptology ePrint Archive 2005: 406 (2005)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-08 02:31 CEST by the dblp team