Towards a Classification of Non-interactive Computational Assumptions in Cyclic Groups

We study non-interactive computational intractability assumptions in prime-order cyclic groups. We focus on the broad class of computational assumptions which we call target assumptions where the adversary’s goal is to compute concrete group elements.

[1]  Brent Waters,et al.  Identity-Based Encryption Secure against Selective Opening Attack , 2011, TCC.

[2]  Melissa Chase,et al.  Deja Q: Using Dual Systems to Revisit q-Type Assumptions , 2014, IACR Cryptol. ePrint Arch..

[3]  Dongyoung Roh,et al.  The square root Diffie–Hellman problem , 2012, Des. Codes Cryptogr..

[4]  Brent Waters,et al.  Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys , 2005, CRYPTO.

[5]  Georg Fuchsbauer,et al.  Structure-Preserving Signatures on Equivalence Classes and Constant-Size Anonymous Credentials , 2018, Journal of Cryptology.

[6]  M. Kasahara,et al.  A New Traitor Tracing , 2002, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[7]  Yael Tauman Kalai,et al.  Cryptographic Assumptions: A Position Paper , 2016, TCC.

[8]  Gilles Barthe,et al.  Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model , 2016, EUROCRYPT.

[9]  BonehDan,et al.  Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups , 2008 .

[10]  Ueli Maurer,et al.  Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms , 1994, CRYPTO.

[11]  Kenneth G. Paterson,et al.  Pairings for Cryptographers , 2008, IACR Cryptol. ePrint Arch..

[12]  Ueli Maurer,et al.  Diffie-Hellman Oracles , 1996, CRYPTO.

[13]  Tibor Jager,et al.  On the Analysis of Cryptographic Assumptions in the Generic Ring Model , 2009, Journal of Cryptology.

[14]  Robert H. Deng,et al.  Variations of Diffie-Hellman Problem , 2003, ICICS.

[15]  Masahiro Mambo,et al.  Complexity Analysis of the Cryptographic Primitive Problems through Square-Root Exponent , 2004 .

[16]  Xavier Boyen,et al.  The Uber-Assumption Family , 2008, Pairing.

[17]  Brent Waters,et al.  Full-Domain Subgroup Hiding and Constant-Size Group Signatures , 2007, Public Key Cryptography.

[18]  Melissa Chase,et al.  Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions , 2016, ASIACRYPT.

[19]  Jorge Luis Villar,et al.  An Algebraic Framework for Diffie–Hellman Assumptions , 2015, Journal of Cryptology.

[20]  Mihir Bellare,et al.  The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols , 2004, CRYPTO.

[21]  Ueli Maurer,et al.  Abstract Models of Computation in Cryptography , 2005, IMACC.

[22]  Emmanuel Bresson,et al.  A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness , 2007, CRYPTO.

[23]  Dan Boneh,et al.  Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups , 2008, Journal of Cryptology.

[24]  Ahmad-Reza Sadeghi,et al.  Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference , 2001, EUROCRYPT.

[25]  Alfred Menezes,et al.  Another look at generic groups , 2007, Adv. Math. Commun..

[26]  Bert den Boer.  Diffie-Hellman is as Strong as Discrete Log for Certain Primes , 1988, CRYPTO.

[27]  Gilles Barthe,et al.  Automated Analysis of Cryptographic Assumptions in Generic Group Models , 2014, IACR Cryptol. ePrint Arch..

[28]  Emmanuel Bresson,et al.  The Group Diffie-Hellman Problems , 2002, Selected Areas in Cryptography.

[29]  Eike Kiltz,et al.  A Tool Box of Cryptographic Functions Related to the Diffie-Hellman Function , 2001, INDOCRYPT.

[30]  Alexander W. Dent,et al.  Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model , 2002, ASIACRYPT.

[31]  Craig Gentry,et al.  Quadratic Span Programs and Succinct NIZKs without PCPs , 2013, IACR Cryptol. ePrint Arch..

[32]  Moni Naor,et al.  On Cryptographic Assumptions and Challenges , 2003, CRYPTO.

[33]  Paz Morillo,et al.  The Kernel Matrix Diffie-Hellman Assumption , 2016, ASIACRYPT.

[34]  Dan Boneh,et al.  Hierarchical Identity Based Encryption with Constant Size Ciphertext , 2005, EUROCRYPT.

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

[36]  Antoine Joux,et al.  Security Ranking Among Assumptions Within the Uber Assumption Framework , 2013, ISC.

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

[38]  Jung Hee Cheon,et al.  Security Analysis of the Strong Diffie-Hellman Problem , 2006, EUROCRYPT.

[39]  Fabrice Benhamouda,et al.  An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security , 2015, CRYPTO.