Name
Abstract | ||
|---|---|---|
Game-playing proofs constitute a powerful framework for classical 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 Zhandryu0027s compressed quantum oracles [Zha18] can be used to do quantum lazy sampling from non-uniform function distributions. Second, we observe how Unruhu0027s one-way-to-hiding lemma [Unr14] 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 or a random permutation. Our results upgrade post-quantum security of SHA-3 to the same level that is proven against classical adversaries. |
Year | Venue | Field |
|---|---|---|
2019 | IACR Cryptology ePrint Archive | Discrete mathematics,Quantum,Fundamental lemma,Cryptography,Generalization,Random permutation,Theoretical computer science,Mathematical proof,Sampling (statistics),Mathematics,Lemma (mathematics) |
DocType | Citations | PageRank |
Journal | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jan Czajkowski | 1 | 3 | 1.78 |
| Christian Majenz | 2 | 0 | 0.34 |
| Christian Schaffner | 3 | 15 | 2.77 |
| Sebastian Zur | 4 | 0 | 0.34 |