International Association for Cryptologic Research

International Association
for Cryptologic Research


Algebraic Adversaries in the Universal Composability Framework

Michel Abdalla , École Normale Supérieure, CNRS, PSL University, Paris, France
Manuel Barbosa , University of Porto (FCUP) and INESC TEC
Jonathan Katz , University of Maryland College Park, USA
Julian Loss , CISPA Helmholtz Center for Information Security, Germany
Jiayu Xu , Algorand
DOI: 10.1007/978-3-030-92078-4_11
Search ePrint
Search Google
Conference: ASIACRYPT 2021
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.
Video from ASIACRYPT 2021
  title={Algebraic Adversaries in the Universal Composability Framework},
  author={Michel Abdalla and Manuel Barbosa and Jonathan Katz and Julian Loss and Jiayu Xu},