International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Composition with Knowledge Assumptions

Authors:
Thomas Kerber , The University of Edinburgh & IOHK
Aggelos Kiayias , The University of Edinburgh & IOHK
Markulf Kohlweiss , The University of Edinburgh & IOHK
Download:
Search ePrint
Search Google
Presentation: Slides
Conference: CRYPTO 2021
Abstract: Zero-knowledge succinct non-interactive arguments (zk-SNARKs) rely on knowledge assumptions for their security. Meanwhile, as the complexity and scale of cryptographic systems continues to grow, the composition of secure protocols is of vital importance. The current gold standards of composable security, the Universal Composability and Constructive Cryptography frameworks cannot capture knowledge assumptions, as their core proofs of composition prohibit white-box extraction. In this paper, we present a formal model allowing the composition of knowledge assumptions. Despite showing impossibility for the general case, we demonstrate the model’s usefulness when limiting knowledge assumptions to few instances of protocols at a time. We finish by providing the first instance of a simultaneously succinct and composable zk-SNARK, by using existing results within our framework.
Video from CRYPTO 2021
BibTeX
@inproceedings{crypto-2021-31252,
  title={Composition with Knowledge Assumptions},
  publisher={Springer-Verlag},
  author={Thomas Kerber and Aggelos Kiayias and Markulf Kohlweiss},
  year=2021
}