Paper 2023/1581
CryptoZoo: A Viewer for Reduction Proofs
Abstract
Cryptographers rely on visualization to effectively communicate cryptographic constructions with one another. Visual frameworks such as constructive cryptography (TOSCA 2011), the joy of cryptography (online book) and state-separating proofs (SSPs, Asiacrypt 2018) are useful to communicate not only the construction, but also their proof visually by representing a cryptographic system as graphs. One SSP core feature is the re-use of code, e.g., a package of code might be used in a game and be part of the description of a reduction as well. Thus, in a proof, the linear structure of a paper either requires the reader to turn pages to find definitions or writers to re-state them, thereby interrupting the visual flow of the game hops that are defined by a sequence of graphs. We present an interactive proof viewer for state-separating proofs (SSPs) which addresses the limitations and perform three case studies: The equivalence between simulation-based and game-based notions for symmetric encryption, the security proof of the Goldreich-Goldwasser-Micali construction of a pseudorandom function from a pseudorandom generator, and Brzuska's and Oechsner's SSP formalization of the proof for Yao's garbling scheme.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. ACNS 2024
- Keywords
- state-separationproof viewerreduction proofstooling
- Contact author(s)
-
chris brzuska @ gmail com
egger @ irif fr
kirthivaasan puniamurthy @ aalto fi - History
- 2023-10-13: approved
- 2023-10-12: received
- See all versions
- Short URL
- https://ia.cr/2023/1581
- License
-
CC BY-NC-ND
BibTeX
@misc{cryptoeprint:2023/1581,
author = {Chris Brzuska and Christoph Egger and Kirthivaasan Puniamurthy},
title = {{CryptoZoo}: A Viewer for Reduction Proofs},
howpublished = {Cryptology {ePrint} Archive, Paper 2023/1581},
year = {2023},
url = {https://eprint.iacr.org/2023/1581}
}