134 citations · 254 across the 10 of their papers we have counts for
6 papers · 1 filter
Quantum Hoare Logic with Ghost Variables
Dominique Unruh
Quantum Hoare logic allows us to reason about quantum programs. We present an extension of quantum Hoare logic that introduces "ghost variables" to extend the expressive power of p…
Quantum Relational Hoare Logic
Dominique Unruh
We present a logic for reasoning about pairs of interactive quantum programs - quantum relational Hoare logic (qRHL). This logic follows the spirit of probabilistic relational Hoar…
Quantum Attacks on Classical Proof Systems - The Hardness of Quantum Rewinding
Andris Ambainis, Ansis Rosmanis, Dominique Unruh
Quantum zero-knowledge proofs and quantum proofs of knowledge are inherently difficult to analyze because their security analysis uses rewinding. Certain cases of quantum rewinding…
An adaptive attack on Wiesner's quantum money
Aharon Brodutch, Daniel Nagaj, Or Sattath +1
Unlike classical money, which is hard to forge for practical reasons (e.g. producing paper with a certain property), quantum money is attractive because its security might be based…
Universally Composable Quantum Multi-Party Computation
Dominique Unruh
The Universal Composability model (UC) by Canetti (FOCS 2001) allows for secure composition of arbitrary protocols. We present a quantum version of the UC model which enjoys the sa…
Simulatable security for quantum protocols
Dominique Unruh
The notion of simulatable security (reactive simulatability, universal composability) is a powerful tool for allowing the modular design of cryptographic protocols (composition of…