Completeness theorems for the Abadi–Rogaway language of encrypted expressions1
Daniele Micciancio, Bogdan Warinschi · Journal of Computer Security · 2004
We show that the Abadi–Rogaway logic of indistinguishability for cryptographic expressions is not complete by giving a natural example of a secure encryption function and a pair of expressions, such that the distributions associated to the two expres