M. Abe, K. Haralambiev, and M. Ohkubo, Signing on Elements in Bilinear Groups for Modular Protocol Design. Cryptology ePrint Archive, 2010.

M. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev, and M. Ohkubo, Structure-Preserving Signatures and Commitments to Group Elements, Crypto'10, pp.209-236, 2010.

M. Abe, M. Chase, B. David, M. Kohlweiss, R. Nishimaki et al., Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions, Asiacrypt'12
DOI : 10.1007/978-3-642-34961-4_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.359.4450

J. Ahn, D. Boneh, J. Camenisch, S. Hohenberger, B. Shelat et al., Computing on Authenticated Data, TCC 2012, pp.1-20, 2012.
DOI : 10.1007/978-3-642-28914-9_1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.229.3111

N. Attrapadung and B. Libert, Homomorphic Network Coding Signatures in the Standard Model, PKC'11, pp.17-34, 2011.
DOI : 10.1007/978-3-642-19379-8_2

P. Barreto and M. Naehrig, Pairing-Friendly Elliptic Curves of Prime Order, SAC'05, pp.319-331, 2005.
DOI : 10.1007/11693383_22

M. Belenkiy, J. Camenisch, M. Chase, M. Kohlweiss, A. Lysyanskaya et al., Randomizable Proofs and Delegatable Anonymous Credentials, Crypto'09, pp.108-125, 2009.
DOI : 10.1007/978-3-642-03356-8_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.4084

M. Bellare and G. Neven, Transitive Signatures Based on Factoring and RSA, Asiacrypt'02, pp.397-414, 2002.
DOI : 10.1007/3-540-36178-2_25

D. Boneh, X. Boyen, and H. Shacham, Short Group Signatures, Crypto'04, pp.41-55, 2004.
DOI : 10.1007/978-3-540-28628-8_3

D. Boneh and M. Franklin, Identity-Based Encryption from the Weil Pairing, Crypto'01, pp.586-615, 2001.
DOI : 10.1137/S0097539701398521

D. Boneh, D. Freeman, J. Katz, and B. Waters, Signing a Linear Subspace: Signature Schemes for Network Coding, PKC'09, pp.68-87, 2009.
DOI : 10.1007/978-3-642-00468-1_5

D. Boneh and D. Freeman, Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures, PKC'11, pp.1-16, 2011.
DOI : 10.1007/978-3-642-19379-8_1

D. Boneh and D. Freeman, Homomorphic Signatures for Polynomial Functions, Eurocrypt'11, pp.149-168, 2011.
DOI : 10.1007/978-3-642-20465-4_10

D. Boneh, E. Shen, and B. Waters, Strongly Unforgeable Signatures Based on Computational Diffie-Hellman, PKC'06, pp.229-240, 2009.
DOI : 10.1007/11745853_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.363.2693

C. Brzuska, H. Busch, O. Dagdelen, M. Fischlin, M. Franz et al., Schröder Redactable Signatures for Tree-Structured Data: Definitions and Constructions, ACNS'10, pp.87-104, 2010.

C. Brzuska, M. Fischlin, T. Freudenreich, A. Lehmann, M. Page et al., Security of Sanitizable Signatures Revisited, PKC'09, pp.317-336, 2009.
DOI : 10.1007/978-3-642-00468-1_18

C. Brzuska, M. Fischlin, A. Lehmann, and D. Schröder, Unlinkability of Sanitizable Signatures, PKC'10, pp.444-461, 2010.
DOI : 10.1007/978-3-642-13013-7_26

D. Catalano, D. Fiore, and B. Warinschi, Adaptive Pseudo-free Groups and Applications, Eurocrypt'11, pp.207-223, 2011.
DOI : 10.1007/978-3-642-20465-4_13
URL : https://hal.archives-ouvertes.fr/hal-01110376

D. Catalano, D. Fiore, and B. Warinschi, Efficient Network Coding Signatures in the Standard Model, PKC'12, pp.680-696, 2012.
DOI : 10.1007/978-3-642-30057-8_40

M. Chase, M. Kohlweiss, A. Lysyanskaya, and S. Meiklejohn, Malleable Proof Systems and Applications, Eurocrypt'12, pp.281-300, 2012.
DOI : 10.1007/978-3-642-29011-4_18
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.259.7214

Y. Desmedt, Computer security by redefining what a computer is, Proceedings on the 1992-1993 workshop on New security paradigms , NSPW '92-93, pp.160-166, 1993.
DOI : 10.1145/283751.283834

D. Freeman, Improved Security for Linearly Homomorphic Signatures: A Generic Framework, PKC'12, pp.697-714, 2012.
DOI : 10.1007/978-3-642-30057-8_41

G. Fuchsbauer, Commuting Signatures and Verifiable Encryption, Eurocrypt'11, pp.224-245, 2011.
DOI : 10.1007/978-3-642-20465-4_14

R. Gennaro, J. Katz, H. Krawczyk, and T. Rabin, Secure Network Coding over the Integers, PKC'10, pp.142-160, 2010.
DOI : 10.1007/978-3-642-13013-7_9

M. Gerbush, A. Lewko, A. O. Neill, and B. Waters, Dual Form Signatures: An Approach for Proving Security from Static Assumptions, Asiacrypt'12
DOI : 10.1007/978-3-642-34961-4_4

C. Gentry, Fully homomorphic encryption using ideal lattices, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, pp.169-178, 2009.
DOI : 10.1145/1536414.1536440
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.362.7592

J. Groth and A. Sahai, Efficient Non-interactive Proof Systems for Bilinear Groups, Eurocrypt'08, pp.415-432, 2008.
DOI : 10.1007/978-3-540-78967-3_24

A. Hevia and D. Micciancio, The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes, Asiacrypt'02, pp.379-396, 2002.
DOI : 10.1007/3-540-36178-2_24

E. Kiltz, A. Mityagin, S. Panjwani, and B. Raghavan, Append-Only Signatures, ICALP'05, pp.434-445, 2005.
DOI : 10.1007/11523468_36

A. Lewko, Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting, Eurocrypt'12, pp.318-335, 2012.
DOI : 10.1007/978-3-642-29011-4_20

A. Lewko, T. Okamoto, A. Sahai, K. Takashima, and B. Waters, Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption, Eurocrypt 2010, pp.62-91, 2010.
DOI : 10.1007/978-3-642-13190-5_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.165.2844

A. Lewko and B. Waters, New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts, TCC 2010, pp.455-479, 2010.
DOI : 10.1007/978-3-540-78967-3_9

A. Lewko and B. Waters, Unbounded HIBE and Attribute-Based Encryption, Eurocrypt'11, pp.149-168, 2011.
DOI : 10.1007/978-3-642-20465-4_30
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.188.4600

R. Johnson, D. Molnar, D. Song, and D. Wagner, Homomorphic Signature Schemes, CT-RSA'02, pp.244-262, 2002.
DOI : 10.1007/3-540-45760-7_17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.126.1944

S. Micali and R. Rivest, Transitive Signature Schemes, CT-RSA'02, pp.236-243, 2002.
DOI : 10.1007/3-540-45760-7_16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.7893

K. Miyazaki, G. Hanaoka, and H. Imai, Digitally signed document sanitizing scheme based on bilinear maps, Proceedings of the 2006 ACM Symposium on Information, computer and communications security , ASIACCS '06, pp.343-354, 2006.
DOI : 10.1145/1128817.1128868

T. Okamoto and K. Takashima, Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption, Crypto'10, pp.191-208, 2010.
DOI : 10.1007/978-3-642-14623-7_11

M. Prabhakaran and M. Rosulek, Homomorphic Encryption with CCA Security, ICALP 2008, pp.667-678, 2008.
DOI : 10.1007/978-3-540-70583-3_54
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.4461

M. Van-dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, Fully Homomorphic Encryption over the Integers, Eurocrypt'10, pp.22-43, 2010.
DOI : 10.1007/978-3-642-13190-5_2

B. Waters, Efficient Identity-Based Encryption Without Random Oracles, Eurocrypt'05, pp.114-127, 2005.
DOI : 10.1007/11426639_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.2190

B. Waters, Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions, Crypto'09, 2009.
DOI : 10.1007/978-3-642-03356-8_36
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.1659