M. Abe and S. Fehr, Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography, Crypto'04, pp.317-334, 2004.
DOI : 10.1007/978-3-540-28628-8_20
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.331.1042

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.
DOI : 10.1007/978-3-642-14623-7_12

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

J. Almansa, I. Damgård, and J. Nielsen, Simplified Threshold RSA with Adaptive and Proactive Security, Eurocrypt'06, pp.593-611, 2006.
DOI : 10.1007/11761679_35

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, C. Namprempre, and G. Neven, Unrestricted Aggregate Signatures, ICALP'07, pp.411-422, 2007.
DOI : 10.1007/978-3-540-73420-8_37

M. Bellare and T. Ristenpart, Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters??? IBE Scheme, Eurocrypt'09, pp.407-424, 2009.
DOI : 10.1007/11426639_7

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

A. Boldyreva, Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme, Public-Key Cryptography 2003 (PKC'03), LNCS 2567, pp.31-46, 2003.
DOI : 10.1007/3-540-36288-6_3

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, Efficient Generation of Shared RSA Keys, Crypto'97, pp.425-439, 1924.

D. Boneh, C. Gentry, B. Lynn, and H. Shacham, Aggregate and Verifiably Encrypted Signatures from Bilinear Maps, Eurocrypt'03, pp.416-432, 2003.
DOI : 10.1007/3-540-39200-9_26
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.459

D. Boneh, B. Lynn, and H. Shacham, Short Signatures from the Weil Pairing, Earlier version in Asiacrypt'01, pp.297-319, 2001.

C. Boyd, Digital Multisignatures, pp.241-246, 1989.

R. Canetti, R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Adaptive Security for Threshold Cryptosystems, Crypto'99, pp.98-115, 1999.
DOI : 10.1007/3-540-48405-1_7

R. Canetti and S. Goldwasser, An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract), Eurocrypt'99, pp.90-106, 1999.
DOI : 10.1007/3-540-48910-X_7

J. Chen, H. Lim, S. Ling, H. Wang, and H. Wee, Shorter IBE and Signatures via Asymmetric Pairings, Pairing 2012, pp.122-140, 2012.
DOI : 10.1007/978-3-642-36334-4_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.303.9299

J. Coron, On the Exact Security of Full Domain Hash, Crypto'00, pp.229-235, 2000.
DOI : 10.1007/3-540-44598-6_14

V. Cortier, D. Galindo, S. Glondu, and M. Izabachène, Distributed ElGamaì a la Pedersen: Application to Helios, WPES 2013, pp.131-142, 2013.

R. Cramer, M. Franklin, B. Schoenmakers, and M. Yung, Multi-Autority Secret-Ballot Elections with Linear Work, Eurocrypt'96, pp.72-83, 1996.
DOI : 10.1007/3-540-68339-9_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.3309

R. Cramer, R. Gennaro, and B. Schoenmakers, A Secure and Optimally Efficient Multi-Authority Election Scheme, Eurocrypt'97, pp.103-118, 1997.
DOI : 10.1007/3-540-69053-0_9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.8654

R. Cramer, I. Damgård, and J. Nielsen, Multiparty Computation from Threshold Homomorphic Encryption, Eurocrypt'01, pp.280-299, 2001.
DOI : 10.1007/3-540-44987-6_18
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.5028

R. Cramer, I. Damgård, S. Dziembowski, M. Hirt, and T. Rabin, Efficient Multi-Party Computations Secure Against an Adaptive Adversary, Eurocrypt'99, pp.311-326, 1999.
DOI : 10.1007/3-540-48910-x_22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.1522

I. Damgård and G. Mikkelsen, Efficient, Robust and Constant-Round Distributed RSA Key Generation, TCC'10, pp.183-200, 2010.
DOI : 10.1145/359168.359176

A. Dent, A Note On Game-Hopping Proofs. Cryptology ePrint Archive, Report, vol.260, 2006.

A. De-santis, Y. Desmedt, Y. Frankel, and M. Yung, How to share a function securely, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing , STOC '94, pp.522-533, 1994.
DOI : 10.1145/195058.195405

Y. Desmedt, Society and Group Oriented Cryptography: a New Concept, Crypto'87, pp.120-127, 1987.
DOI : 10.1007/3-540-48184-2_8

Y. Desmedt and Y. , Threshold Cryptosystems, Crypto'89, p.307
DOI : 10.1007/3-540-57220-1_47

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

P. Fouque and J. Stern, Fully Distributed Threshold RSA under Standard Assumptions, Asiacrypt'01, pp.310-330, 2001.
DOI : 10.1007/3-540-45682-1_19
URL : https://hal.archives-ouvertes.fr/inria-00565271

Y. Frankel, P. Mackenzie, and M. Yung, Robust Efficient Distributed RSA-Key Generation, STOC'98, pp.663-672, 1998.
DOI : 10.1145/277697.277779

Y. Frankel, P. Mackenzie, and M. Yung, Adaptively-Secure Distributed Public-Key Systems, ESA'99, pp.4-27, 1999.
DOI : 10.1007/3-540-48481-7_2
URL : http://dx.doi.org/10.1016/s0304-3975(01)00260-2

Y. Frankel, P. Mackenzie, and M. Yung, Adaptively-Secure Optimal-Resilience Proactive RSA, Asiacrypt'99, pp.180-194, 1999.
DOI : 10.1007/978-3-540-48000-6_15

Y. Frankel, P. Gemmell, P. Mackenzie, and M. Yung, Optimal-resilience proactive public-key cryptosystems, Proceedings 38th Annual Symposium on Foundations of Computer Science, pp.384-393, 1997.
DOI : 10.1109/SFCS.1997.646127
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.6651

D. Freeman, Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups, Eurocrypt'10, pp.44-61, 2010.
DOI : 10.1007/978-3-642-13190-5_3

R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Robust Threshold DSS Signatures, Eurocrypt'96, pp.354-371, 1996.
DOI : 10.1006/inco.2000.2881
URL : http://doi.org/10.1006/inco.2000.2881

R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Robust and Efficient Sharing of RSA Functions, Crypto'96, pp.157-172, 1996.

R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Secure Distributed Key Generation for Discrete-Log Based Cryptosystems, Eurocrypt'99, pp.295-310, 1999.
DOI : 10.1007/s00145-006-0347-3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.6445

R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Secure Applications of Pedersen???s Distributed Key Generation Protocol, CT-RSA'03, pp.373-390, 2003.
DOI : 10.1007/3-540-36563-X_26

R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Secure Distributed Key Generation for Discrete-Log Based Cryptosystems, Journal of Cryptology, vol.20, issue.1, pp.51-83, 2007.
DOI : 10.1007/s00145-006-0347-3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.6445

R. Gennaro, S. Halevi, H. Krawczyk, and T. Rabin, Threshold RSA for Dynamic and Ad-Hoc Groups, Eurocrypt'08, pp.88-107, 2008.
DOI : 10.1007/978-3-540-78967-3_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.8882

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. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung, Proactive Secret Sharing Or: How to Cope With Perpetual Leakage, Crypto '95, pp.339-352, 1995.
DOI : 10.1007/3-540-44750-4_27

A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, and M. Yung, Proactive public key and signature systems, Proceedings of the 4th ACM conference on Computer and communications security , CCS '97, pp.100-110, 1997.
DOI : 10.1145/266420.266442
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.2085

J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton et al., OceanStore: An Architecture for Global-Scale Persistent Storage, ASPLOS, pp.190-201, 2000.

S. Jarecki and A. Lysyanskaya, Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures, Eurocrypt'00, pp.221-242, 2000.
DOI : 10.1007/3-540-45539-6_16

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, Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting, Eurocrypt 2012, pp.318-351, 2012.
DOI : 10.1007/978-3-642-29011-4_20

B. Libert, T. Peters, M. Joye, and M. Yung, Linearly Homomorphic Structure-Preserving Signatures and their Applications, Crypto 2013, pp.289-307, 2013.
DOI : 10.1007/s10623-015-0079-1

B. Libert and M. Yung, Adaptively secure non-interactive threshold cryptosystems, ICALP 2011, pp.76-100, 2011.
DOI : 10.1016/j.tcs.2013.01.001

B. Libert and M. Yung, Non-Interactive CCA2-Secure Threshold Cryptosystems with Adaptive Security: New Framework and Constructions, TCC 2012, pp.75-93, 2012.
DOI : 10.1007/978-3-642-28914-9_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.308.3960

A. Lysyanskaya and C. Peikert, Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes, Asiacrypt'01, pp.331-350, 2001.
DOI : 10.1007/3-540-45682-1_20

T. Malkin, I. Teranishi, Y. Vahlis, and M. Yung, Signatures Resilient to Continual Leakage on Memory and Computation, TCC'11, pp.89-106, 2011.
DOI : 10.1007/978-3-642-19571-6_7

M. Naor and O. Reingold, Number-theoretic constructions of efficient pseudo-random functions, FOCS'97, pp.458-467, 1997.
DOI : 10.1145/972639.972643

T. Okamoto, Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes, Crypto'92, pp.31-53, 2011.
DOI : 10.1007/3-540-48071-4_3

R. Ostrovksy and M. Yung, How to Withstand Mobile Virus Attacks, PODC'91, pp.51-59, 1991.

T. Pedersen, A Threshold Cryptosystem without a Trusted Party, Eurocrypt'91, pp.522-526, 1991.
DOI : 10.1007/3-540-46416-6_47

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

T. Rabin, A simplified approach to threshold and proactive RSA, Crypto'98, pp.89-104, 1998.
DOI : 10.1007/BFb0055722

S. Rhea, P. Eaton, D. Geels, H. Weatherspoon, B. Zhao et al., Pond: The OceanStore Prototype, USENIX Workshop on File and Storage Technologies, 2003.

M. Scott, Authenticated ID-based Key Exchange and remote log-in with simple token and PIN number. Cryptology ePrint Archive, Report, vol.164, 2002.

A. Shamir, How to share a secret, Communications of the ACM, vol.22, issue.11, pp.612-613, 1979.
DOI : 10.1145/359168.359176

V. Shoup, Practical Threshold Signatures, Eurocrypt, pp.207-220, 2000.
DOI : 10.1007/3-540-45539-6_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.7629

H. Wee, Threshold and Revocation Cryptosystems via Extractable Hash Proofs, Eurocrypt'11, pp.589-609, 2011.
DOI : 10.1007/978-3-642-20465-4_32

Z. Wang, H. Qian, and Z. Li, Adaptively Secure Threshold Signature Scheme in the Standard Model, In Informatica, vol.20, issue.4, pp.591-612, 2009.

B. Waters, Efficient Identity-Based Encryption Without Random Oracles, Eurocrypt'05, 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, pp.619-636, 2009.
DOI : 10.1007/978-3-642-03356-8_36
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.1659