EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A Core Calculus for Equational Proofs of Cryptographic Protocols

Joshua Gancher, Kristina Sojakova, Xiong Fan, Elaine Shi, Greg Morrisett

Proceedings of the ACM on Programming Languages · 09.01.2023 · 7 (POPL) · 866-892

DOI: 10.1145/3571223 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the ACM on Programming Languages, online erschienen am 11.01.2023. Verfasst von Joshua Gancher und 4 weiteren Autor:innen. Die Arbeit wurde bisher 10-mal zitiert (Crossref) und nennt 36 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Many proofs of interactive cryptographic protocols (e.g., as in Universal Composability) operate by proving the protocol at hand to be observationally equivalent to an idealized specification. While pervasive, formal tool support for observational equivalence of cryptographic protocols is still a nascent area of research. Current mechanization efforts tend to either focus on diff-equivalence, which establishes observational equivalence between protocols with identical control structures, or require an explicit witness for the observational equivalence in the form of a bisimulation relation. Our goal is to simplify proofs for cryptographic protocols by introducing a core calculus, IPDL, for cryptographic observational equivalences. Via IPDL, we aim to address a number of theoretical issues for cryptographic proofs in a simple manner, including probabilistic behaviors, distributed message-passing, and resource-bounded adversaries and simulators. We demonstrate IPDL on a number of case studies, including a distributed coin toss protocol, Oblivious Transfer, and the GMW multi-party computation protocol. All proofs of case studies are mechanized via an embedding of IPDL into the Coq proof assistant.

Zitieren

APA

Gancher, J., Sojakova, K., Fan, X., Shi, E., & Morrisett, G. (2023). A Core Calculus for Equational Proofs of Cryptographic Protocols. Proceedings of the ACM on Programming Languages, 7(POPL), 866-892. https://doi.org/10.1145/3571223

Vancouver

Gancher J, Sojakova K, Fan X, Shi E, Morrisett G. A Core Calculus for Equational Proofs of Cryptographic Protocols. Proceedings of the ACM on Programming Languages. 2023;7(POPL):866-892. doi:10.1145/3571223

BibTeX
@article{Gancher2023,
  author = {Gancher, Joshua and Sojakova, Kristina and Fan, Xiong and Shi, Elaine and Morrisett, Greg},
  title = {A Core Calculus for Equational Proofs of Cryptographic Protocols},
  journal = {Proceedings of the ACM on Programming Languages},
  year = {2023},
  volume = {7},
  number = {POPL},
  pages = {866--892},
  doi = {10.1145/3571223}
}
Kostenlos starten →