. .. Password-authenticated-key-exchange, , p.91

, Generic Construction of a UC-Secure OT Scheme, p.93

, Very Efficient Oblivious Transfer from QA-NIZK, p.105

S. Agrawal, D. Boneh, and X. Boyen, Efficient lattice (H)IBE in the standard model, LNCS, vol.6110, pp.553-572, 2010.

M. Abdalla, F. Benhamouda, and O. Blazy, SPHF-friendly non-interactive commitments, Kazue Sako and Palash Sarkar, vol.8269, pp.214-234
URL : https://hal.archives-ouvertes.fr/hal-00915542

. Springer, , 2013.

M. Abdalla, D. Catalano, A. Dent, and J. Malone-lee, Identity-based encryption gone wild, Gregory Neven, and Nigel Smart, vol.II, pp.300-311, 2006.

M. Abdalla, C. Chevalier, and D. Pointcheval, Smooth projective hashing for conditionally extractable commitments, LNCS, vol.5677, pp.671-689, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00419145

M. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev, and M. Ohkubo, Structure-preserving signatures and commitments to group elements, CRYPTO 2010, vol.6223, pp.209-236, 2010.

M. Abdalla, E. Kiltz, and G. Neven, Generalized key delegation for hierarchical identity-based encryption, LNCS, vol.4734, pp.139-154, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00918551

N. Attrapadung, Dual system encryption framework in prime-order groups via computational pair encodings, ASIACRYPT 2016, Part II, vol.10032, p.2016

D. Boneh and X. Boyen, Efficient selective-ID secure identity based encryption without random oracles, LNCS, vol.3027, pp.223-238, 2004.

[. Bbc-+-13a]-fabrice-ben, O. Hamouda, C. Blazy, D. Chevalier, D. Pointcheval et al., Efficient UC-secure authenticated key-exchange for algebraic languages, LNCS, vol.7778, pp.272-291, 2013.

[. Bbc-+-13b]-fabrice, O. Benhamouda, C. Blazy, D. Chevalier, D. Pointcheval et al., New techniques for SPHFs and efficient one-round PAKE protocols, CRYPTO 2013, Part I, vol.8042, pp.449-475, 2013.

D. Boneh, X. Boyen, and E. Goh, Hierarchical identity based encryption with constant size ciphertext, LNCS, vol.3494, pp.440-456, 2005.

. Springer, , 2005.

D. Boneh, X. Boyen, and H. Shacham, Short group signatures, LNCS, vol.3152, pp.41-55, 2004.

O. Blazy and C. Chevalier, Generic construction of UCsecure oblivious transfer, LNCS, vol.15, pp.65-86, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01382954

O. Blazy and C. Chevalier, Structure-preserving smooth projective hashing, ASIACRYPT 2016, Part II, vol.10032, pp.339-369, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01382952

O. Blazy, C. Chevalier, and P. Germouty, Adaptive oblivious transfer and generalization, ASIACRYPT 2016, Part II, vol.10032, pp.217-247, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01382953

O. Blazy, C. Chevalier, and P. Germouty, Almost optimal oblivious transfer from QA-NIZK, LNCS, vol.17, pp.579-598, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01610411

O. Blazy, E. Conchon, P. Germouty, and A. Jambert, Efficient id-based designated verifier signature, International Conference on Availability, Reliability and Security, vol.12, issue.44, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01610412

J. Birkett, A. W. Dent, G. Neven, and J. C. Schuldt, Efficient chosen-ciphertext secure identity-based encryption with wildcards, LNCS, vol.4586, pp.274-292, 2007.

D. Boneh and M. K. Franklin, Identity-based encryption from the Weil pairing, LNCS, vol.2139, pp.213-229, 2001.

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

O. Blazy, G. Fuchsbauer, D. Pointcheval, and D. Vergnaud, Signatures on randomizable ciphertexts, LNCS, vol.6571, pp.403-422, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00542643

O. Blazy, E. Kiltz, and J. Pan, Hierarchical) identitybased encryption from affine message authentication, CRYPTO 2014, Part I, vol.8616, pp.408-425, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01239920

M. Bellare, D. Pointcheval, and P. Rogaway, Authenticated key exchange secure against dictionary attacks, LNCS, vol.1807, pp.139-155, 2000.

O. Blazy, D. Pointcheval, and D. Vergnaud, Roundoptimal privacy-preserving protocols with smooth projective hash functions, LNCS, vol.7194, pp.94-111, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00672939

R. Canetti, Universally composable security: A new paradigm for cryptographic protocols, 42nd FOCS, pp.136-145, 2001.

R. Chang, B. Chor, O. Goldreich, J. Hartmanis, J. Hastad et al., The random oracle is false, Journal of Computer and System Sciences, vol.49, issue.1, pp.24-39, 1994.

R. Canetti, A. Cohen, and Y. Lindell, A simpler variant of universally composable security for standard multiparty computation, CRYPTO 2015, Part II, vol.9216, pp.3-22

. Springer, , 2015.

J. Camenisch, M. Dubovitskaya, and G. Neven, Oblivious transfer with access control, ACM CCS 09, pp.131-140, 2009.

R. Canetti, D. Dachman-soled, V. Vaikuntanathan, and H. Wee, Efficient password authenticated key exchange via oblivious transfer, LNCS, vol.7293, pp.449-466, 2012.

Y. Cui, E. Fujisaki, G. Hanaoka, H. Imai, and R. Zhang, Formal security treatments for signatures from identitybased encryption, LNCS, vol.4784, pp.218-227, 2007.

J. Chen, R. Gay, and H. Wee, Improved dual system ABE in prime-order groups via predicate encodings, EUROCRYPT 2015, Part II, vol.9057, pp.595-624, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01220358

R. Canetti, S. Halevi, J. Katz, Y. Lindell, and P. D. Mackenzie, Universally composable password-based key exchange, LNCS, vol.3494, pp.404-421, 2005.

D. Cash, D. Hofheinz, E. Kiltz, and C. Peikert, Bonsai trees, or how to delegate a lattice basis, LNCS, vol.6110, pp.523-552

. Springer, , 2010.

R. Canetti and H. Krawczyk, Universally composable notions of key exchange and secure channels, LNCS, vol.2332, pp.337-351, 2002.

. Springer, , 2002.

J. Seung-geol-choi, H. Katz, H. Wee, and . Zhou, Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS, LNCS, vol.7778, pp.73-88, 2013.

. Springer, , 2013.

C. Cocks, An identity based encryption scheme based on quadratic residues, 8th IMA International Conference on Cryptography and Coding, vol.2260, pp.360-363, 2001.

R. Cramer and V. Shoup, A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack, LNCS, vol.1462, pp.13-25, 1998.

R. Cramer and V. Shoup, Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption, LNCS, vol.2332, pp.45-64, 2002.

N. Döttling and S. Garg, Identity-based encryption from the Diffie-Hellman assumption, CRYPTO 2017, Part I, vol.10401, pp.537-569, 2017.

W. Diffie and M. E. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, vol.22, issue.6, pp.644-654, 1976.

A. Escala, G. Herold, E. Kiltz, C. Ràfols, and J. Villar, An algebraic framework for Diffie-Hellman assumptions, CRYPTO 2013, Part II, vol.8043, pp.129-147, 2013.

T. Elgamal, A public key cryptosystem and a signature scheme based on discrete logarithms, LNCS, vol.84, pp.10-18, 1984.

N. E. Mrabet and M. Joye, Guide to pairing-based cryptography, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01579628

M. Fischlin, Round-optimal composable blind signatures in the common reference string model, LNCS, vol.4117, pp.60-77, 2006.

M. Green and S. Hohenberger, Blind identity-based encryption and simulatable oblivious transfer, LNCS, vol.4833, pp.265-282, 2007.

. Springer, , 2007.

M. Green and S. Hohenberger, Universally composable adaptive oblivious transfer, LNCS, vol.5350, pp.179-197, 2008.

P. Gaborit, A. Hauteville, J. Duong-hieu-phan, and . Tillich, Identity-based encryption from codes with rank metric, Part III, vol.10403, pp.194-224, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01589463

R. Gennaro and Y. Lindell, A framework for passwordbased authenticated key exchange, LNCS, vol.2656, pp.524-543, 2003.

S. Goldwasser, S. Micali, and R. L. Rivest, A digital signature scheme secure against adaptive chosen-message attacks, SIAM Journal on Computing, vol.17, issue.2, pp.281-308, 1988.

S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof systems, SIAM Journal on Computing, vol.18, issue.1, pp.186-208, 1989.

C. Gentry, C. Peikert, and V. Vaikuntanathan, Trapdoors for hard lattices and new cryptographic constructions, 40th ACM STOC, pp.197-206, 2008.

C. Gentry and A. Silverberg, Hierarchical ID-based cryptography, LNCS, vol.2501, pp.548-566, 2002.

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

A. Guillevic, Comparing the pairing efficiency over compositeorder and prime-order elliptic curves, LNCS, vol.13, pp.357-372, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00812960

J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby, A pseudorandom generator from any one-way function, SIAM Journal on Computing, vol.28, issue.4, pp.1364-1396, 1999.

S. Charanjit, A. Jutla, and . Roy, Shorter quasi-adaptive NIZK proofs for linear subspaces, Kazue Sako and Palash Sarkar, editors, ASIACRYPT 2013, Part I, vol.8269, pp.1-20, 2013.

S. Charanjit, A. Jutla, and . Roy, Dual-system simulationsoundness with applications to UC-PAKE and more, ASIACRYPT 2015, Part I, vol.9452, pp.630-655, 2015.

Y. T. Kalai, Smooth projective hashing and two-message oblivious transfer, LNCS, vol.3494, pp.78-95, 2005.

J. Katz and V. Vaikuntanathan, Smooth projective hashing and password-based authenticated key exchange from lattices, LNCS, vol.5912, pp.636-652, 2009.

N. Li, W. Du, and D. Boneh, Oblivious signaturebased envelope, Elizabeth Borowsky and Sergio Rajsbaum, editors, 22nd ACM PODC, pp.182-189, 2003.

Y. Lindell, Highly-efficient universally-composable commitments based on the DDH assumption, LNCS, vol.6632, pp.446-466, 2011.

. Springer, , 2011.

A. B. Lewko and B. Waters, New proof methods for attribute-based encryption: Achieving full security through selective techniques, LNCS, vol.7417, pp.180-198, 2012.

M. Naor and M. Yung, Public-key cryptosystems provably secure against chosen ciphertext attacks, 22nd ACM STOC, pp.427-437, 1990.

T. Okamoto and K. Takashima, Fully secure functional encryption with general relations from the decisional linear assumption, CRYPTO 2010, vol.6223, pp.191-208, 2010.

P. Torben and . Pedersen, Non-interactive and information-theoretic secure verifiable secret sharing, LNCS, vol.576, pp.129-140, 1992.

C. Rackoff and D. R. Simon, Non-interactive zeroknowledge proof of knowledge and chosen ciphertext attack, LNCS, vol.576, pp.433-444, 1992.

R. L. Rivest, A. Shamir, and L. M. Adleman, A method for obtaining digital signature and public-key cryptosystems, Communications of the Association for Computing Machinery, vol.21, issue.2, pp.120-126, 1978.

R. Steinfeld, L. Bull, H. Wang, and J. Pieprzyk, Universal designated-verifier signatures, LNCS, vol.2894, pp.523-542, 2003.

A. Shamir, Identity-based cryptosystems and signature schemes, LNCS, vol.84, pp.47-53, 1984.

A. Sahai and B. R. Waters, Fuzzy identity-based encryption, LNCS, vol.3494, pp.457-473, 2005.

R. Brent and . Waters, Efficient identity-based encryption without random oracles, EUROCRYPT 2005, pp.114-127, 2005.

B. Waters, Dual system encryption: Realizing fully secure IBE and HIBE under simple assumptions, LNCS, vol.5677, pp.619-636, 2009.

Y. Zheng, Digital signcryption or how to achieve cost(signature & encryption) ? cost(signature) + cost(encryption)

, LNCS, vol.1294, pp.165-179, 1997.