Dominique Unruh

According to our database1, Dominique Unruh authored at least 73 papers between 2005 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Compressed Permutation Oracles (And the Collision-Resistance of Sponge/SHA3).
IACR Cryptol. ePrint Arch., 2021

2020
Post-Quantum Verification of Fujisaki-Okamoto.
IACR Cryptol. ePrint Arch., 2020

How to Base Security on the Perfect/Statistical Binding Property of Quantum Bit Commitment?
IACR Cryptol. ePrint Arch., 2020

On quantum indistinguishability under chosen plaintext attack.
IACR Cryptol. ePrint Arch., 2020

Local Variables and Quantum Relational Hoare Logic.
CoRR, 2020

Banach-Steinhaus Theorem.
Arch. Formal Proofs, 2020

2019
Quantum relational Hoare logic.
Proc. ACM Program. Lang., 2019

Quantum Relational Hoare Logic with Expectations.
CoRR, 2019

Quantum Hoare Logic with Ghost Variables.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2018
Quantum collision-resistance of non-uniformly distributed functions: upper and lower bounds.
Quantum Inf. Comput., 2018

Everlasting Multi-party Computation.
J. Cryptol., 2018

On the (Im-)Possibility of Extending Coin Toss.
J. Cryptol., 2018

Generic Authenticated Key Exchange in the Quantum Random Oracle Model.
IACR Cryptol. ePrint Arch., 2018

On Quantum Indifferentiability.
IACR Cryptol. ePrint Arch., 2018

Quantum security proofs using semi-classical oracles.
IACR Cryptol. ePrint Arch., 2018

2017
Security of Blind Signatures Revisited.
J. Cryptol., 2017

Post-Quantum Security of Fiat-Shamir.
IACR Cryptol. ePrint Arch., 2017

Collapsing sponges: Post-quantum security of the sponge construction.
IACR Cryptol. ePrint Arch., 2017

Post-quantum security of the sponge construction.
IACR Cryptol. ePrint Arch., 2017

2016
An adaptive attack on Wiesner's quantum money.
Quantum Inf. Comput., 2016

Collapse-binding quantum commitments without random oracles.
IACR Cryptol. ePrint Arch., 2016

Quantum Collision-Resistance of Non-Uniformly Distributed Functions.
IACR Cryptol. ePrint Arch., 2016

Post-quantum Security of the CBC, CFB, OFB, CTR, and XTS Modes of Operation.
IACR Cryptol. ePrint Arch., 2016

Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

2015
Revocable Quantum Timed-Release Encryption.
J. ACM, 2015

Computationally binding quantum commitments.
IACR Cryptol. ePrint Arch., 2015

Quantum Security of the Fujisaki-Okamoto and OAEP Transforms.
IACR Cryptol. ePrint Arch., 2015

2014
Non-interactive zero-knowledge proofs in the quantum random oracle model.
IACR Cryptol. ePrint Arch., 2014

Quantum position verification in the random oracle model.
IACR Cryptol. ePrint Arch., 2014

Quantum Attacks on Classical Proof Systems - The Hardness of Quantum Rewinding.
IACR Cryptol. ePrint Arch., 2014

The Synergy Between Programming Languages and Cryptography (Dagstuhl Seminar 14492).
Dagstuhl Reports, 2014

2013
On using probabilistic Turing machines to model participants in cryptographic protocols.
Theor. Comput. Sci., 2013

Polynomial Runtime and Composability.
J. Cryptol., 2013

Symbolic Universal Composability.
IACR Cryptol. ePrint Arch., 2013

2012
Programmable encryption and key-dependent messages.
IACR Cryptol. ePrint Arch., 2012

Everlasting Quantum Security.
IACR Cryptol. ePrint Arch., 2012

Computational Soundness without Protocol Restrictions.
IACR Cryptol. ePrint Arch., 2012

Computational Soundness of Symbolic Zero-knowledge Proofs: Weaker Assumptions and Mechanized Verification.
IACR Cryptol. ePrint Arch., 2012

2011
Round Optimal Blind Signatures.
IACR Cryptol. ePrint Arch., 2011

Round Optimal Blind Signatures.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2010
Long-Term Security and Universal Composability.
J. Cryptol., 2010

Termination-Insensitive Computational Indistinguishability (and applications to computational soundness).
IACR Cryptol. ePrint Arch., 2010

The impossibility of computationally sound XOR.
IACR Cryptol. ePrint Arch., 2010

Concurrent composition in the bounded quantum storage model.
IACR Cryptol. ePrint Arch., 2010

Quantum Proofs of Knowledge.
IACR Cryptol. ePrint Arch., 2010

Computationally Sound Verification of Source Code.
IACR Cryptol. ePrint Arch., 2010

Universally Composable Quantum Multi-party Computation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

2009
Polynomial runtime in simulatability definitions.
J. Comput. Secur., 2009

Universally Composable Incoercibility.
IACR Cryptol. ePrint Arch., 2009

CoSP: A General Framework For Computational Soundness Proofs.
IACR Cryptol. ePrint Arch., 2009

CSAR: A Practical and Provable Technique to Make Randomized Systems Accountable.
Proceedings of the Network and Distributed System Security Symposium, 2009

2008
Computational soundness of symbolic zero-knowledge proofs.
IACR Cryptol. ePrint Arch., 2008

Compromising Reflections-or-How to Read LCD Monitors around the Corner.
Proceedings of the 2008 IEEE Symposium on Security and Privacy (S&P 2008), 2008

A Formal Language for Cryptographic Pseudocode.
Proceedings of the Logic for Programming, 2008

Computational Soundness of Symbolic Zero-Knowledge Proofs Against Active Attackers.
Proceedings of the 21st IEEE Computer Security Foundations Symposium, 2008

Limits of Constructive Security Proofs.
Proceedings of the Advances in Cryptology, 2008

OAEP Is Secure under Key-Dependent Messages.
Proceedings of the Advances in Cryptology, 2008

2007
Random Oracles and Auxiliary Input.
IACR Cryptol. ePrint Arch., 2007

Towards Key-Dependent Message Security in the Standard Model.
IACR Cryptol. ePrint Arch., 2007

On the Security of Protocols with Logarithmic Communication Complexity.
IACR Cryptol. ePrint Arch., 2007

Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol.
IACR Cryptol. ePrint Arch., 2007

Quantum Programs With Classical Output Streams: (Extended Abstract).
Electron. Notes Theor. Comput. Sci., 2007

Information Flow in the Peer-Reviewing Process.
Proceedings of the 2007 IEEE Symposium on Security and Privacy (S&P 2007), 2007

2006
Quantum programming languages.
Inform. Forsch. Entwickl., 2006

Simulatable Security and Polynomially Bounded Concurrent Composition.
IACR Cryptol. ePrint Arch., 2006

On the Necessity of Rewinding in Secure Multiparty Computation.
IACR Cryptol. ePrint Arch., 2006

Simulatable Security and Polynomially Bounded Concurrent Composability.
Proceedings of the 2006 IEEE Symposium on Security and Privacy (S&P 2006), 2006

Protokollkomposition und Komplexität.
Proceedings of the Ausgezeichnete Informatikdissertationen 2006, 2006

Protokollkomposition und Komplexität.
PhD thesis, 2006

2005
Relations amount Statistical Security Notions - or - Why Exponential Adversaries are Unlimited.
IACR Cryptol. ePrint Arch., 2005

On the Notion of Statistical Security in Simulatability Definitions.
IACR Cryptol. ePrint Arch., 2005

On Fairness in Simulatability-based Cryptographic Systems.
IACR Cryptol. ePrint Arch., 2005

Comparing Two Notions of Simulatability.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005


  Loading...