Cryptology ePrint Archive: Report 2021/1218

Algebraic Adversaries in the Universal Composability Framework

Michel Abdalla and Manuel Barbosa and Jonathan Katz and Julian Loss and Jiayu Xu

Abstract: The algebraic-group model (AGM), which lies between the generic group model and the standard model of computation, provides a means by which to analyze the security of cryptosystems against so-called algebraic adversaries. We formalize the AGM within the framework of universal composability, providing formal definitions for this setting and proving an appropriate composition theorem. This extends the applicability of the AGM to more-complex protocols, and lays the foundations for analyzing algebraic adversaries in a composable~fashion. Our results also clarify the meaning of composing proofs in the AGM with other proofs and they highlight a natural form of independence between idealized groups that seems inherent to the AGM and has not been made formal before---these insights also apply to the composition of game-based proofs in the AGM. We show the utility of our model by proving several important protocols universally composable for algebraic adversaries, specifically: (1) the Chou-Orlandi protocol for oblivious transfer, and (2) the SPAKE2 and CPace protocols for password-based authenticated key exchange.

Category / Keywords: foundations / Universal Composability, Algebraic Group Model

Original Publication (with major differences): IACR-ASIACRYPT-2021

Date: received 17 Sep 2021, last revised 22 Sep 2021

Contact author: mbb at fc up pt

Available format(s): PDF | BibTeX Citation

Note: Biblio fixed.

Version: 20210922:213017 (All versions of this report)

Short URL: ia.cr/2021/1218


[ Cryptology ePrint archive ]