36 citations · 115 across the 12 of their papers we have counts for
12 papers
A new spin on quantum cryptography: Avoiding trapdoors and embracing public keys
Lawrence M. Ioannou, Michele Mosca
We give new arguments in support of \emph{signed quantum key establishment}, where quantum cryptography is used in a public-key infrastructure that provides the required authentica…
Unconditionally-secure and reusable public-key authentication
Lawrence M. Ioannou, Michele Mosca
We present a quantum-public-key identification protocol and show that it is secure against a computationally-unbounded adversary. This demonstrates for the first time that uncondit…
Deterministic quantum-public-key encryption: forward search attack and randomization
Georgios M. Nikolopoulos, Lawrence M. Ioannou
In the classical setting, public-key encryption requires randomness in order to be secure against a forward search attack, whereby an adversary compares the encryption of a guess o…
Public-key cryptography based on bounded quantum reference frames
Lawrence M. Ioannou, Michele Mosca
We demonstrate that the framework of bounded quantum reference frames has application to building quantum-public-key cryptographic protocols and proving their security. Thus, the f…
Universal quantum computation in a hidden basis
Lawrence M. Ioannou, Michele Mosca
Let $\ket{\0}$ and $\ket{\1}$ be two states that are promised to come from known subsets of orthogonal subspaces, but are otherwise unknown. Our paper probes the question of what c…
Limitations of some simple adiabatic quantum algorithms
Lawrence M. Ioannou, Michele Mosca
Let , , be the Hamiltonian governing an adiabatic quantum algorithm, where is diagonal in the Hadamard basis and is diagonal in…