Search the dblp DataBase

Publications of Author

1. Michael Backes, Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh
   On fairness in simulatability-based cryptographic systems. [Citation Graph (0, 0)][DBLP]
   FMSE, 2005, pp:13-22 [Conf]
   
2. Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh
   Polynomial Runtime in Simulatability Definitions. [Citation Graph (0, 0)][DBLP]
   CSFW, 2005, pp:156-169 [Conf]
   
3. Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh
   On the (Im-)Possibility of Extending Coin Toss. [Citation Graph (0, 0)][DBLP]
   EUROCRYPT, 2006, pp:504-521 [Conf]
   
4. Dennis Hofheinz, Dominique Unruh
   On the Notion of Statistical Security in Simulatability Definitions. [Citation Graph (0, 0)][DBLP]
   ISC, 2005, pp:118-133 [Conf]
   
5. Dennis Hofheinz, Dominique Unruh
   Simulatable Security and Polynomially Bounded Concurrent Composability. [Citation Graph (0, 0)][DBLP]
   S&P, 2006, pp:169-183 [Conf]
   
6. Michael Backes, Markus Dürmuth, Dominique Unruh
   Information Flow in the Peer-Reviewing Process. [Citation Graph (0, 0)][DBLP]
   IEEE Symposium on Security and Privacy, 2007, pp:187-191 [Conf]
   
7. Michael Backes, Jörn Müller-Quade, Dominique Unruh
   On the Necessity of Rewinding in Secure Multiparty Computation. [Citation Graph (0, 0)][DBLP]
   TCC, 2007, pp:157-173 [Conf]
   
8. Jörn Müller-Quade, Dominique Unruh
   Long-Term Security and Universal Composability. [Citation Graph (0, 0)][DBLP]
   TCC, 2007, pp:41-60 [Conf]
   
9. Dennis Hofheinz, Dominique Unruh
   Comparing Two Notions of Simulatability. [Citation Graph (0, 0)][DBLP]
   TCC, 2005, pp:86-103 [Conf]
   
10. Dominique Unruh
    Quantum Programs With Classical Output Streams: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:170, n:, pp:165-184 [Journal]
    
11. Dominique Unruh
    Quantum programming languages. [Citation Graph (0, 0)][DBLP]
    Inform., Forsch. Entwickl., 2006, v:21, n:1-2, pp:55-63 [Journal]
    
12. Dominique Unruh
    Random Oracles and Auxiliary Input. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:205-223 [Conf]
    
13. 
    OAEP Is Secure under Key-Dependent Messages. [Citation Graph (, )][DBLP]
    
    
14. 
    Limits of Constructive Security Proofs. [Citation Graph (, )][DBLP]
    
    
15. 
    CoSP: a general framework for computational soundness proofs. [Citation Graph (, )][DBLP]
    
    
16. 
    Universally Composable Incoercibility. [Citation Graph (, )][DBLP]
    
    
17. 
    Computational Soundness of Symbolic Zero-Knowledge Proofs Against Active Attackers. [Citation Graph (, )][DBLP]
    
    
18. 
    Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol. [Citation Graph (, )][DBLP]
    
    
19. 
    Towards Key-Dependent Message Security in the Standard Model. [Citation Graph (, )][DBLP]
    
    
20. 
    Universally Composable Quantum Multi-party Computation. [Citation Graph (, )][DBLP]
    
    
21. 
    A Formal Language for Cryptographic Pseudocode. [Citation Graph (, )][DBLP]
    
    
22. 
    CSAR: A Practical and Provable Technique to Make Randomized Systems Accountable. [Citation Graph (, )][DBLP]
    
    
23. 
    Compromising Reflections-or-How to Read LCD Monitors around the Corner. [Citation Graph (, )][DBLP]
    
    
24. 
    Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol. [Citation Graph (, )][DBLP]