Efficient simulation of ideal ciphers in the quantum setting

Establish whether the ideal-cipher simulation procedures of Grinko–Yoshida and Foxman et al. are efficient, thereby determining whether they can serve as efficient quantum ideal functionalities in the UC framework.

Background

To formulate UC security for protocols using quantum-accessible ideal ciphers, an efficient ideal functionality is needed. The paper states that recent procedures can perfectly simulate a broad class of oracles including ideal ciphers, but that the efficiency of these simulations depends on an unresolved computational transformation.