| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Michael Backes, Fabian Bendun, Dominique Unruh |
Computational Soundness of Symbolic Zero-knowledge Proofs: Weaker Assumptions and Mechanized Verification.  |
IACR Cryptology ePrint Archive  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Dominique Unruh |
Everlasting Quantum Security. |
IACR Cryptology ePrint Archive |
2012 |
DBLP BibTeX RDF |
|
| 1 | Dominique Schröder, Dominique Unruh |
Security of Blind Signatures Revisited. |
Public Key Cryptography |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominique Unruh |
Quantum Proofs of Knowledge. |
EUROCRYPT |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominique Schröder, Dominique Unruh |
Round Optimal Blind Signatures. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Dominique Schröder, Dominique Unruh |
Security of Blind Signatures Revisited. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Dominique Unruh |
Termination-Insensitive Computational Indistinguishability (and Applications to Computational Soundness). |
CSF |
2011 |
DBLP DOI BibTeX RDF |
Security definitions, indistinguishability, computational soundness |
| 1 | Dominique Unruh |
Concurrent Composition in the Bounded Quantum Storage Model. |
EUROCRYPT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjam Garg, Vanishree Rao, Amit Sahai, Dominique Schröder, Dominique Unruh |
Round Optimal Blind Signatures. |
CRYPTO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Backes, Dominique Unruh |
Computational soundness of symbolic zero-knowledge proofs. |
Journal of Computer Security |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominique Unruh |
Quantum Proofs of Knowledge. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Dominique Unruh |
Termination-Insensitive Computational Indistinguishability (and applications to computational soundness). |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Dominique Unruh |
Concurrent composition in the bounded quantum storage model. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Dominique Unruh |
The impossibility of computationally sound XOR. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Michael Backes, Matteo Maffei, Dominique Unruh |
Computationally Sound Verification of Source Code. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Jörn Müller-Quade, Dominique Unruh |
Long-Term Security and Universal Composability. |
J. Cryptology |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominique Unruh |
Universally Composable Quantum Multi-party Computation. |
EUROCRYPT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominique Unruh, Jörn Müller-Quade |
Universally Composable Incoercibility. |
CRYPTO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Backes, Matteo Maffei, Dominique Unruh |
Computationally sound verification of source code. |
ACM Conference on Computer and Communications Security |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh |
Polynomial runtime in simulatability definitions. |
Journal of Computer Security |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominique Unruh, Jörn Müller-Quade |
Universally Composable Incoercibility. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Dennis Hofheinz, Dominique Unruh, Jörn Müller-Quade |
Polynomial Runtime and Composability. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Michael Backes, Dennis Hofheinz, Dominique Unruh |
CoSP: A General Framework For Computational Soundness Proofs. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Michael Backes, Dennis Hofheinz, Dominique Unruh |
CoSP: a general framework for computational soundness proofs. |
ACM Conference on Computer and Communications Security |
2009 |
DBLP DOI BibTeX RDF |
security, verification, theory |
| 1 | Michael Backes, Peter Druschel, Andreas Haeberlen, Dominique Unruh |
CSAR: A Practical and Provable Technique to Make Randomized Systems Accountable. |
NDSS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Michael Backes, Dominique Unruh |
Computational soundness of symbolic zero-knowledge proofs. |
IACR Cryptology ePrint Archive |
2008 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
optical emanations, Security |
| 1 | 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 |
DBLP DOI BibTeX RDF |
zero-knowledge, Language-based security, automated verification, applied pi-calculus |
| 1 | Michael Backes, Matthias Berg, Dominique Unruh |
A Formal Language for Cryptographic Pseudocode. |
LPAR |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Backes, Dominique Unruh |
Computational Soundness of Symbolic Zero-Knowledge Proofs Against Active Attackers. |
CSF |
2008 |
DBLP DOI BibTeX RDF |
Formal methods, zero-knowledge proofs, computational soundness |
| 1 | Michael Backes, Dominique Unruh |
Limits of Constructive Security Proofs. |
ASIACRYPT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Backes, Markus Dürmuth, Dominique Unruh |
OAEP Is Secure under Key-Dependent Messages. |
ASIACRYPT |
2008 |
DBLP DOI BibTeX RDF |
Key-dependent message security, RSA-OAEP, chosen ciphertext attacks |
| 1 | Dennis Hofheinz, Dominique Unruh |
Towards Key-Dependent Message Security in the Standard Model. |
EUROCRYPT |
2008 |
DBLP DOI BibTeX RDF |
Key-dependent message security, symmetric encryption schemes, security proofs |
| 1 | Dominique Unruh |
Random Oracles and Auxiliary Input. |
IACR Cryptology ePrint Archive |
2007 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Michael Backes, Dominique Unruh |
On the Security of Protocols with Logarithmic Communication Complexity. |
IACR Cryptology ePrint Archive |
2007 |
DBLP BibTeX RDF |
|
| 1 | Dennis Hofheinz, Dominique Unruh |
Towards Key-Dependent Message Security in the Standard Model. |
IACR Cryptology ePrint Archive |
2007 |
DBLP BibTeX RDF |
|
| 1 | Dominique Unruh |
Quantum Programs With Classical Output Streams: (Extended Abstract). |
Electr. Notes Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Backes, Markus Dürmuth, Dominique Unruh |
Information Flow in the Peer-Reviewing Process. |
IEEE Symposium on Security and Privacy |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Jörn Müller-Quade, Dominique Unruh |
Long-Term Security and Universal Composability. |
TCC |
2007 |
DBLP DOI BibTeX RDF |
long-term security, commitment, zero-knowledge, Universal Composability |
| 1 | Michael Backes, Jörn Müller-Quade, Dominique Unruh |
On the Necessity of Rewinding in Secure Multiparty Computation. |
TCC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominique Unruh |
Random Oracles and Auxiliary Input. |
CRYPTO |
2007 |
DBLP DOI BibTeX RDF |
auxiliary input, proof techniques, Random oracles, foundations |
| 1 | Dominique Unruh |
Quantum programming languages. |
Inform., Forsch. Entwickl. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Backes, Jörn Müller-Quade, Dominique Unruh |
On the Necessity of Rewinding in Secure Multiparty Computation. |
IACR Cryptology ePrint Archive |
2006 |
DBLP BibTeX RDF |
|
| 1 | Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh |
On the (Im-)Possibility of Extending Coin Toss. |
IACR Cryptology ePrint Archive |
2006 |
DBLP BibTeX RDF |
|
| 1 | Jörn Müller-Quade, Dominique Unruh |
Long-term Security and Universal Composability. |
IACR Cryptology ePrint Archive |
2006 |
DBLP BibTeX RDF |
|
| 1 | Dennis Hofheinz, Dominique Unruh |
Simulatable Security and Polynomially Bounded Concurrent Composition. |
IACR Cryptology ePrint Archive |
2006 |
DBLP BibTeX RDF |
|
| 1 | Dominique Unruh |
Protokollkomposition und Komplexität. |
|
2006 |
RDF |
|
| 1 | Dennis Hofheinz, Dominique Unruh |
Simulatable Security and Polynomially Bounded Concurrent Composability. |
IEEE Symposium on Security and Privacy |
2006 |
DBLP DOI BibTeX RDF |
Reactive Simulatability, Universal Composability, concurrent composition |
| 1 | Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh |
On the (Im-)Possibility of Extending Coin Toss. |
EUROCRYPT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dennis Hofheinz, Dominique Unruh |
On the Notion of Statistical Security in Simulatability Definitions. |
IACR Cryptology ePrint Archive |
2005 |
DBLP BibTeX RDF |
|
| 1 | Michael Backes, Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh |
On Fairness in Simulatability-based Cryptographic Systems. |
IACR Cryptology ePrint Archive |
2005 |
DBLP BibTeX RDF |
|
| 1 | Dominique Unruh |
Relations amount Statistical Security Notions - or - Why Exponential Adversaries are Unlimited. |
IACR Cryptology ePrint Archive |
2005 |
DBLP BibTeX RDF |
|
| 1 | Dennis Hofheinz, Dominique Unruh |
On the Notion of Statistical Security in Simulatability Definitions. |
ISC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh |
Polynomial Runtime in Simulatability Definitions. |
CSFW |
2005 |
DBLP DOI BibTeX RDF |
reactive simulatability, universal composability, multi-party computation |
| 1 | Dennis Hofheinz, Dominique Unruh |
Comparing Two Notions of Simulatability. |
TCC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Backes, Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh |
On fairness in simulatability-based cryptographic systems. |
FMSE |
2005 |
DBLP DOI BibTeX RDF |
scheduling, fairness, cryptographic protocols, simulatability |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")