D. Abc-+-12.-jae-hyun-ahn, J. Boneh, S. Camenisch, B. Hohenberger, and . Waters, Computing on authenticated data, LNCS, vol.7194, pp.1-20, 2012.

G. Afg-+-10.-masayuki-abe, J. Fuchsbauer, K. Groth, M. Haralambiev, and . Ohkubo, Structure-preserving signatures and commitments to group elements, LNCS, vol.6223, pp.209-236, 2010.

D. Boneh, X. Boyen, and E. Goh, Hierarchical Identity Based Encryption with Constant Size Ciphertext, Lecture Notes in Computer Science, vol.3494, pp.440-456, 2005.

D. Boneh, M. Drijvers, and G. Neven, Compact Multi-signatures for Smaller Blockchains, Lecture Notes in Computer Science, vol.11273, pp.435-464, 2018.

D. Boneh and D. M. Freeman, Homomorphic Signatures for Polynomial Functions, Advances in Cryptology ? EUROCRYPT 2011, vol.6632, pp.149-168, 2011.

D. Boneh and D. M. Freeman, Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures, Public Key Cryptography ? PKC 2011, vol.6571, pp.1-16, 2011.

O. Blazy, G. Fuchsbauer, M. Izabachène, A. Jambert, H. Sibert et al., Batch Groth?Sahai, Applied Cryptography and Network Security, vol.10, pp.218-235, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00577167

D. Boneh, D. Freeman, J. Katz, and B. Waters, Signing a Linear Subspace: Signature Schemes for Network Coding, Public Key Cryptography ? PKC 2009, vol.5443, pp.68-87, 2009.

O. Blazy, G. Fuchsbauer, D. Pointcheval, and D. Vergnaud, Signatures on Randomizable Ciphertexts, Public Key Cryptography ? PKC 2011, vol.6571, pp.403-422, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00542643

S. Bayer and J. Groth, Efficient Zero-Knowledge Argument for Correctness of a Shuffle, Advances in Cryptology ? EUROCRYPT 2012, vol.7237, pp.263-280, 2012.

X. Boyen, The Uber-Assumption Family, Pairing-Based Cryptography ? Pairing 2008, vol.5209, pp.39-56

D. L. Chaum, Untraceable electronic mail, return addresses, and digital pseudonyms, Communications of the ACM, vol.24, issue.2, pp.84-90, 1981.

J. Camenisch, S. Hohenberger, and M. Ø. Pedersen, Batch Verification of Short Signatures, Advances in Cryptology - EUROCRYPT 2007, vol.4515, pp.246-263, 2007.

M. Chase, M. Kohlweiss, A. Lysyanskaya, and S. Meiklejohn, Malleable Proof Systems and Applications, Advances in Cryptology ? EUROCRYPT 2012, vol.7237, pp.281-300, 2012.

V. Cortier and B. Smyth, Attacking and fixing Helios: An analysis of ballot secrecy, Journal of Computer Security, vol.21, issue.1, pp.89-148, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00732899

I. Damgård, Towards Practical Public Key Systems Secure Against Chosen Ciphertext attacks, Advances in Cryptology ? CRYPTO ?91, vol.576, pp.445-456

G. Fuchsbauer, C. Hanser, and D. Slamanig, Structure-Preserving Signatures on Equivalence Classes and Constant-Size Anonymous Credentials, Journal of Cryptology, vol.32, issue.2, pp.498-546, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01870052

P. Fauzi, H. Lipmaa, J. Siim, and M. Zaj?c, An Efficient Pairing-Based Shuffle Argument, Advances in Cryptology ? ASIACRYPT 2017, vol.II, pp.97-127, 2017.

F. David-mandell, Improved security for linearly homomorphic signatures: A generic framework, LNCS, vol.7293, pp.697-714, 2012.

A. Fiat and A. Shamir, How To Prove Yourself: Practical Solutions to Identification and Signature Problems, Advances in Cryptology ? CRYPTO? 86, vol.86, pp.186-194

J. Furukawa and K. Sako, An Efficient Scheme for Proving a Shuffle, Advances in Cryptology ? CRYPTO 2001, vol.2139, pp.368-387, 2001.

J. Groth and Y. Ishai, Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle, Advances in Cryptology ? EUROCRYPT 2008, vol.4965, pp.379-396

J. Groth and S. Lu, A Non-interactive Shuffle with Pairing Based Verifiability, Advances in Cryptology ? ASIACRYPT 2007, vol.4833, pp.51-67

J. Groth, Short Pairing-Based Non-interactive Zero-Knowledge Arguments, Advances in Cryptology - ASIACRYPT 2010, vol.6477, pp.321-340, 2010.

J. Groth and A. Sahai, Efficient Non-interactive Proof Systems for Bilinear Groups, Advances in Cryptology ? EUROCRYPT 2008, vol.4965, pp.415-432

. Hhk-+-17.-gottfried, M. Herold, M. Hoffmann, C. Klooß, A. Ràfols et al., New techniques for structural batch verification in bilinear groups with applications to groth-sahai proofs, ACM CCS 2017, pp.1547-1564, 2017.

S. Hada and T. Tanaka, On the existence of 3-round zero-knowledge protocols, Advances in Cryptology ? CRYPTO '98, vol.98, pp.408-423, 1998.

, Diffie-Hellman Problem