Algebraic Adversaries in the Universal Composability Framework

[1]  Rafael Dowsley,et al.  TARDIS: A Foundation of Time-Lock Puzzles in UC , 2021, EUROCRYPT.

[2]  Aggelos Kiayias,et al.  Composition with Knowledge Assumptions , 2021, IACR Cryptol. ePrint Arch..

[3]  Stanislaw Jarecki,et al.  Universally Composable Relaxed Password Authenticated Key Exchange , 2020, IACR Cryptol. ePrint Arch..

[4]  Georg Fuchsbauer,et al.  A Classification of Computational Assumptions in the Algebraic Group Model , 2020, IACR Cryptol. ePrint Arch..

[5]  Georg Fuchsbauer,et al.  Blind Schnorr Signatures and Signed ElGamal Encryption in the Algebraic Group Model , 2020, EUROCRYPT.

[6]  M. Naor,et al.  CHIP and CRISP: Compromise Resilient Identity-based Symmetric PAKEs , 2020 .

[7]  Jiayu Xu,et al.  On the Security of Time-Locked Puzzles and Timed Commitments , 2020, IACR Cryptol. ePrint Arch..

[8]  Mary Maller,et al.  Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS , 2020, IACR Cryptol. ePrint Arch..

[9]  Eike Kiltz,et al.  Everybody's a Target: Scalability in Public-Key Encryption , 2020, IACR Cryptol. ePrint Arch..

[10]  Markulf Kohlweiss,et al.  Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings , 2019, IACR Cryptol. ePrint Arch..

[11]  Manuel Barbosa,et al.  Perfect Forward Security of SPAKE2 , 2019, IACR Cryptol. ePrint Arch..

[12]  Stanislaw Jarecki,et al.  Strong Asymmetric PAKE based on Trapdoor CKEM , 2019, IACR Cryptol. ePrint Arch..

[13]  Björn Haase,et al.  AuCPace: Efficient verifier-based PAKE protocol tailored for the IIoT , 2019, IACR Cryptol. ePrint Arch..

[14]  Tommaso Gagliardoni,et al.  The Wonderful World of Global Random Oracles , 2018, IACR Cryptol. ePrint Arch..

[15]  Vincenzo Iovino,et al.  "The Simplest Protocol for Oblivious Transfer" Revisited , 2017, IACR Cryptol. ePrint Arch..

[16]  Eike Kiltz,et al.  The Algebraic Group Model and its Applications , 2018, IACR Cryptol. ePrint Arch..

[17]  Arpita Patra,et al.  Fast and Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security , 2017, IACR Cryptol. ePrint Arch..

[18]  Julian Loss,et al.  Efficient and Universally Composable Protocols for Oblivious Transfer from the CDH Assumption , 2017, IACR Cryptol. ePrint Arch..

[19]  Claudio Orlandi,et al.  The Simplest Protocol for Oblivious Transfer , 2015, IACR Cryptol. ePrint Arch..

[20]  Fabrice Benhamouda,et al.  Security of the J-PAKE Password-Authenticated Key Exchange Protocol , 2015, 2015 IEEE Symposium on Security and Privacy.

[21]  Ran Canetti,et al.  Practical UC security with a Global Random Oracle , 2014, CCS.

[22]  Keisuke Tanaka,et al.  Programmability in the Generic Ring and Group Models , 2011, J. Internet Serv. Inf. Secur..

[23]  Ran Canetti,et al.  Universally Composable Security with Global Setup , 2007, TCC.

[24]  Yehuda Lindell,et al.  Universally Composable Password-Based Key Exchange , 2005, EUROCRYPT.

[25]  David Pointcheval,et al.  Simple Password-Based Encrypted Key Exchange Protocols , 2005, CT-RSA.

[26]  Ran Canetti,et al.  Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[27]  Victor Shoup,et al.  Lower Bounds for Discrete Logarithms and Related Problems , 1997, EUROCRYPT.

[28]  V. Nechaev.  Complexity of a determinate algorithm for the discrete logarithm , 1994 .

[29]  Mihir Bellare,et al.  Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.