T. Acar and L. Nguyen, Revocation for Delegatable Anonymous Credentials, PKC'11, pp.423-440, 2011.
DOI : 10.1007/978-3-642-19379-8_26

M. H. Au, Q. Wu, W. Susilo, and Y. Mu, Compact E-Cash from Bounded Accumulator, CT-RSA 2007, pp.178-195, 2007.
DOI : 10.1007/11967668_12

N. Baric and B. Pfitzmann, Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees, EUROCRYPT 1997, pp.480-494, 1997.

M. Bellare, D. Hofheinz, and S. Yilek, Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening, Eurocrypt'09, pp.1-35, 2009.
DOI : 10.1007/978-3-540-70936-7_23

M. Bellare and P. Rogaway, Random oracles are practical, Proceedings of the 1st ACM conference on Computer and communications security , CCS '93, pp.62-73, 1993.
DOI : 10.1145/168588.168596

J. Benaloh and M. De-mare, One-Way Accumulators: A Decentralized Alternative to Digital Signatures, Eurocrypt'93, pp.274-285, 1993.
DOI : 10.1007/3-540-48285-7_24

S. Benabbas, R. Gennaro, and Y. Vahlis, Verifiable Delegation of Computation over Large Datasets, Crypto 2011, pp.111-131, 2011.
DOI : 10.1007/978-3-642-22792-9_7

M. Blum, Coin Flipping by Telephone, Crypto'81, pp.11-15, 1981.

M. Blum, J. Feldman, and S. Micali, Non-interactive zero-knowledge and its applications, Proceedings of the twentieth annual ACM symposium on Theory of computing , STOC '88, pp.103-112, 1988.
DOI : 10.1145/62212.62222

D. Boneh and X. Boyen, Short Signatures Without Random Oracles, Eurocrypt'04, pp.56-73, 2004.
DOI : 10.1007/978-3-540-24676-3_4

D. Boneh and H. Corrigan-gibbs, Bivariate Polynomials Modulo Composites and Their Applications, ASIACRYPT 2014, Part I, pp.42-62, 2014.
DOI : 10.1007/978-3-662-45611-8_3

D. Boneh, C. Gentry, and B. Waters, Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys, Crypto'05, pp.258-275, 2005.
DOI : 10.1007/11535218_16

D. Boneh, A. Sahai, and B. Waters, Functional Encryption: Definitions and Challenges, TCC'11, pp.253-273, 2011.
DOI : 10.1007/978-3-642-19571-6_16

J. Camenisch, M. Kohlweiss, and C. Soriente, An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials, PKC'09, pp.481-500, 2009.
DOI : 10.1007/978-3-642-00468-1_27

J. Camenisch, M. Kohlweiss, and C. Soriente, Solving Revocation with Efficient Update of Anonymous Credentials, SCN'10, pp.454-471, 2010.
DOI : 10.1007/978-3-642-15317-4_28

J. Camenisch, M. Dubovitskaya, K. Haralambiev, and M. Kohlweiss, Composable and Modular Anonymous Credentials: Definitions and Practical Constructions, Asiacrypt'15, pp.262-288, 2015.
DOI : 10.1007/978-3-662-48800-3_11

J. Camenisch and A. Lysyanskaya, Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials, Crypto'02, pp.61-76, 2002.
DOI : 10.1007/3-540-45708-9_5

D. Catalano and D. Fiore, Vector Commitments and Their Applications, PKC 2013, pp.55-72, 2013.
DOI : 10.1007/978-3-642-36362-7_5

D. Catalano, D. Fiore, and M. Messina, Zero-Knowledge Sets with Short Proofs, Euro- crypt'08, pp.433-450, 2008.
DOI : 10.1007/978-3-540-78967-3_25
URL : https://hal.archives-ouvertes.fr/hal-01110386

S. Canard and A. Gouget, Multiple Denominations in E-cash with Compact Transaction Data, FC 2010, pp.82-97, 2010.
DOI : 10.1007/978-3-642-14577-3_9

B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch, Verifiable secret sharing and achieving simultaneity in the presence of faults, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp.383-395, 1985.
DOI : 10.1109/SFCS.1985.64

M. Chase, A. Healy, A. Lysyanskaya, T. Malkin, and L. Reyzin, Mercurial Commitments with Applications to Zero-Knowledge Sets, Eurocrypt'05, pp.422-439, 2005.

M. Chase and S. Meiklejohn, D??j?? Q: Using Dual Systems to Revisit q-Type Assumptions, Eurocrypt 2014, pp.622-639, 2014.
DOI : 10.1007/978-3-642-55220-5_34

I. Damgård and N. Triandopoulos, Supporting Non-membership Proofs with Bilinear-map Accumulators, Cryptology ePrint Archive, 2008.

D. Derler, C. Hanser, and D. Slamanig, Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives, CT-RSA 2015, pp.127-144, 2015.
DOI : 10.1007/978-3-319-16715-2_7

C. Dwork, M. Naor, O. Reingold, and L. Stockmeyer, Magic Functions, FOCS'99, pp.523-534, 1999.

P. Feldman, A practical scheme for non-interactive verifiable secret sharing, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987), pp.427-437, 1987.
DOI : 10.1109/SFCS.1987.4

S. Gorbunov, V. Vaikuntanathan, and D. Wichs, Leveled Fully Homomorphic Signatures from Standard Lattices, Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC '15, pp.469-477, 2015.
DOI : 10.1145/2746539.2746576

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

M. Izabachène, B. Libert, and D. Vergnaud, Blockwise P-Signatures and Non-Interactive Anonymous Credentials with Efficient Attributes, IMACC 2011, pp.431-450, 2011.

A. Kate, G. Zaverucha, and I. Goldberg, Constant-Size Commitments to Polynomials and Their Applications, Asiacrypt 2010, pp.177-194, 2010.
DOI : 10.1007/978-3-642-17373-8_11

J. Krupp, D. Schröder, M. Simkin, D. Fiore, G. Ateniese et al., Nearly Optimal Verifiable Data Streaming, PKC 2016, pp.417-445, 2016.
DOI : 10.1007/978-3-662-49384-7_16

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

J. Li, N. Li, and R. Xue, Universal Accumulators with Efficient Nonmembership Proofs, ACNS 2007, pp.253-269, 2007.
DOI : 10.1007/978-3-540-72738-5_17

B. Libert and M. Yung, Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs, TCC 2010, pp.499-517, 2010.
DOI : 10.1007/11426639_7

H. Lipmaa, Secure Accumulators from Euclidean Rings without Trusted Setup, ACNS 2012, pp.224-240, 2012.
DOI : 10.1007/978-3-642-31284-7_14

R. C. Merkle, A Certified Digital Signature, LNCS, vol.435, pp.218-238, 1989.
DOI : 10.1007/0-387-34805-0_21

S. Micali, M. Rabin, and J. Kilian, Zero-knowledge sets, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., pp.80-91, 2003.
DOI : 10.1109/SFCS.2003.1238183

S. Micali, M. Rabin, and S. Vadhan, Verifiable random functions, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), pp.120-130, 1999.
DOI : 10.1109/SFFCS.1999.814584

M. Naor, On Cryptographic Assumptions and Challenges, Crypto'03, pp.96-109, 2003.
DOI : 10.1007/978-3-540-45146-4_6

L. Nguyen, Accumulators from Bilinear Pairings and Applications, CT-RSA'05, pp.275-292, 2005.
DOI : 10.1007/978-3-540-30574-3_19

R. Ostrovsky, C. Rackoff, and A. Smith, Efficient Consistency Proofs for Generalized Queries on a Committed Database, ICALP'04, pp.1041-1053, 2004.
DOI : 10.1007/978-3-540-27836-8_87

C. Papamanthou, R. Tamassia, and N. Triandopoulos, Optimal Verification of Operations on Dynamic Sets, Crypto 2011, pp.91-110, 2011.
DOI : 10.1007/978-3-642-22792-9_6

C. Papamanthou, E. Shi, R. Tamassia, and K. Yi, Streaming Authenticated Data Structures, EUROCRYPT 2013, pp.353-370, 2013.
DOI : 10.1007/978-3-642-38348-9_22

T. Pedersen, Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing, Crypto'91, pp.129-140, 1991.
DOI : 10.1007/3-540-46766-1_9

A. Sahai and B. Waters, Fuzzy Identity-Based Encryption, Eurocrypt'05, pp.457-473, 2005.
DOI : 10.1007/11426639_27