Game-playing proofs constitute a powerful framework for non-quantum
cryptographic security arguments, most notably applied in the context of
indifferentiability. An essential ingredient in such proofs is lazy sampling of
random primitives. We develop a quantum game-playing proof framework by
generalizing two recently developed proof techniques. First, we describe how
Zhandry’s compressed quantum oracles~(Crypto’19) can be used to do quantum lazy
sampling of a class of non-uniform function distributions. Second, we observe
how Unruh’s one-way-to-hiding lemma~(Eurocrypt’14) can also be applied to
compressed oracles, providing a quantum counterpart to the fundamental lemma of
game-playing. Subsequently, we use our game-playing framework to prove quantum
indifferentiability of the sponge construction, assuming a random internal
function.

Go to Source of this post
Author Of this post: <a href="http://arxiv.org/find/quant-ph/1/au:+Czajkowski_J/0/1/0/all/0/1">Jan Czajkowski</a>, <a href="http://arxiv.org/find/quant-ph/1/au:+Majenz_C/0/1/0/all/0/1">Christian Majenz</a>, <a href="http://arxiv.org/find/quant-ph/1/au:+Schaffner_C/0/1/0/all/0/1">Christian Schaffner</a>, <a href="http://arxiv.org/find/quant-ph/1/au:+Zur_S/0/1/0/all/0/1">Sebastian Zur</a>

By admin