M. Belenkiy, J. Camenisch, M. Chase, M. Kohlweiss, A. Lysyanskaya et al., Randomizable proofs and delegatable anonymous credentials, LNCS, vol.5677, pp.108-125, 2009.

A. Bender, J. Katz, and R. Morselli, Ring signatures: Stronger definitions, and constructions without random oracles, LNCS, vol.3876, pp.60-79, 2006.

D. Boneh and X. Boyen, Short signatures without random oracles, LNCS, vol.3027, pp.56-73, 2004.

P. Bose, D. Das, and C. P. Rangan, Constant size ring signature without random oracle, LNCS, vol.15, pp.230-247, 2015.

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

M. Chase and A. Lysyanskaya, On signatures of knowledge, LNCS, vol.4117, pp.78-96, 2006.

D. Chaum and E. Van-heyst, Group signatures, LNCS, vol.547, pp.257-265, 1991.

G. Danezis, C. Fournet, J. Groth, M. Kohlweiss-;-kaoshiung, and R. O. Taiwan, Square span programs with applications to succinct NIZK arguments, ASIACRYPT 2014, Part I, vol.8873, pp.532-550, 2014.

Y. Dodis, A. Kiayias, A. Nicolosi, and V. Shoup, Anonymous identification in ad hoc groups, LNCS, vol.3027, pp.609-626, 2004.

S. Galbraith, K. Paterson, and N. Smart, Pairings for cryptographers. Cryptology ePrint Archive, 2006.

R. Gennaro, C. Gentry, B. Parno, and M. Raykova, Quadratic span programs and succinct NIZKs without PCPs, EURO-CRYPT 2013, vol.7881, pp.626-645, 2013.

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

S. Goldwasser and Y. T. Kalai, On the (in)security of the Fiat-Shamir paradigm, 44th FOCS, pp.102-115, 2003.

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, vol.9452, pp.605-629, 2015.

A. Gonzlez, Shorter ring signatures from standard assumptions, 2017.

C. Gritti, W. Susilo, and T. Plantard, Logarithmic size ring signatures without random oracles, IET Information Security, vol.10, issue.1, pp.1-7, 2016.

J. Groth, On the size of pairing-based non-interactive arguments, EUROCRYPT 2016, Part II, vol.9666, pp.305-326, 2016.

J. Groth and M. Kohlweiss, One-out-of-many proofs: Or how to leak a secret and spend a coin, EUROCRYPT 2015, Part II, vol.9057, pp.253-280, 2015.

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

J. Groth, R. Ostrovsky, and A. Sahai, Perfect non-interactive zero knowledge for NP, LNCS, vol.4004, pp.339-358, 2006.

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

C. S. Jutla and A. Roy, Improved structure preserving signatures under standard bilinear assumptions. Cryptology ePrint Archive, 2017.

B. Libert, S. Ling, K. Nguyen, and H. Wang, Zero-knowledge arguments for latticebased accumulators: Logarithmic-size ring signatures and group signatures without trapdoors, EUROCRYPT 2016, Part II, vol.9666, pp.1-31, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01314642

G. Malavolta and D. Schröder, Efficient ring signatures in the standard model, LNCS, vol.II, pp.128-157, 2017.

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, 2016.

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

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

R. L. Rivest, A. Shamir, and Y. Tauman, How to leak a secret, LNCS, vol.2248, pp.552-565, 2001.

P. Rogaway and T. Shrimpton, Cryptographic hash-function basics: Definitions, implications, and separations for preimage resistance, second-preimage resistance, and collision resistance, Heidelberg, vol.3017, pp.371-388, 2004.