D. Boneh and X. Boyen, Secure identity based encryption without random oracles, LNCS, vol.3152, pp.443-459, 2004.

D. Boneh and X. Boyen, Short signatures without random oracles and the SDH assumption in bilinear groups, Journal of Cryptology, vol.21, issue.2, p.19, 2008.

J. Bootle and J. Groth, Efficient batch zero-knowledge arguments for low degree polynomials, PKC 2018, Part II, vol.10770, pp.561-588, 2018.

J. Camenisch, R. Chaabouni, and . Shelat, Efficient protocols for set membership and range proofs, LNCS, vol.5350, p.40, 2005.

R. Canetti, Y. Lindell, R. Ostrovsky, and A. Sahai, Universally composable twoparty and multi-party secure computation, 34th ACM STOC, pp.494-503, 2002.

N. Chandran, J. Groth, and A. Sahai, Ring signatures of sub-linear size without random oracles, LNCS, vol.4596, pp.423-434, 2007.

G. Danezis, C. Fournet, J. Groth, and M. Kohlweiss, Square span programs with applications to succinct NIZK arguments, ASI-ACRYPT 2014, Part I, vol.8873, p.19, 2006.

A. Escala and J. Groth, Fine-tuning Groth-Sahai proofs, LNCS, vol.8383, p.10, 2005.

A. Escala, G. Herold, E. Kiltz, C. Ràfols, and J. Villar, An algebraic framework for Diffie-Hellman assumptions, CRYPTO 2013, Part II, vol.8043, pp.129-147, 2013.

P. Fauzi, H. Lipmaa, J. Siim, and M. Zajac, An efficient pairing-based shuffle argument, Part, vol.II, pp.97-127, 2004.

R. Gennaro, C. Gentry, B. Parno, and M. Raykova, Quadratic span programs and succinct NIZKs without PCPs, LNCS, vol.7881, p.19, 2006.

C. Gentry and D. Wichs, Separating succinct non-interactive arguments from all falsifiable assumptions, 43rd ACM STOC, pp.99-108, 2002.

A. González, A ring signature of size O( 3 ? n) without random oracles. Cryptology ePrint Archive, 2017.

A. González, A. Hevia, and C. Ràfols, QA-NIZK arguments in asymmetric groups: New tools and new constructions, ASI-ACRYPT 2015, Part I, volume 9452 of LNCS, vol.40, p.42, 2015.

A. González and C. Ràfols, New techniques for non-interactive shuffle and range arguments, LNCS, vol.16, p.28, 2016.

J. Groth, Short pairing-based non-interactive zero-knowledge arguments, ASIACRYPT 2010, vol.6477, pp.321-340

. Springer, , vol.2, p.5, 2010.

J. Groth, On the size of pairing-based non-interactive arguments, EUROCRYPT 2016, Part II, vol.9666, p.6, 2005.

J. Groth and S. Lu, A non-interactive shuffle with pairing based verifiability, LNCS, vol.4833, pp.51-67, 2004.

J. Groth, R. Ostrovsky, and A. Sahai, New techniques for noninteractive zeroknowledge, J. ACM, vol.59, issue.3, p.3, 2012.

J. Groth and A. Sahai, Efficient non-interactive proof systems for bilinear groups, LNCS, vol.4965, p.10, 2008.

J. Groth and A. Sahai, Efficient noninteractive proof systems for bilinear groups, SIAM J. Comput, vol.41, issue.5, pp.1193-1232, 2012.

C. S. Jutla and A. Roy, Shorter quasi-adaptive NIZK proofs for linear subspaces, ASIACRYPT 2013, Part I, vol.8269, p.41, 2006.

C. S. Jutla and A. Roy, Switching lemma for bilinear tests and constant-size NIZK proofs for linear subspaces, CRYPTO 2014, Part II, vol.8617, p.11, 2004.

E. Kiltz and H. Wee, Quasi-adaptive NIZK for linear subspaces revisited, EUROCRYPT 2015, Part II, vol.9057, p.11, 2002.
URL : https://hal.archives-ouvertes.fr/hal-01220192

B. Libert, T. Peters, M. Joye, and M. Yung, Non-malleability from malleability: Simulation-sound quasi-adaptive NIZK proofs and CCA2-secure encryption from homomorphic signatures, LNCS, vol.8441, issue.6, pp.514-532, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00983147

H. Lipmaa, Progression-free sets and sublinear pairing-based non-interactive zeroknowledge arguments, LNCS, vol.7194, pp.169-189, 2006.

H. Lipmaa, Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes, ASI-ACRYPT 2013, Part I, vol.8269, pp.41-60, 2013.

P. Morillo, C. Ràfols, and J. L. Villar, The kernel matrix Diffie-Hellman assumption, ASIACRYPT 2016, Part I, volume 10031 of LNCS, pp.729-758, 2008.

M. Naor, On cryptographic assumptions and challenges (invited talk), LNCS, vol.2729, pp.96-109, 2002.

C. Ràfols, Stretching groth-sahai: NIZK proofs of partial satisfiability, TCC 2015, Part II, vol.9015, pp.247-276, 1920.

A. Rial, M. Kohlweiss, and B. Preneel, Universally composable adaptive priced oblivious transfer, LNCS, vol.5671, p.41, 2006.

J. L. Villar, Optimal reductions of some decisional problems to the rank problem, LNCS, vol.7658, p.42, 2012.