A. Akavia, S. Goldwasser, and V. Vaikuntanathan, Simultaneous Hardcore Bits and Cryptography against Memory Attacks, LNCS, vol.17, issue.2, pp.474-495, 2009.
DOI : 10.1109/SFCS.1982.45
URL : https://link.springer.com/content/pdf/10.1007%2F978-3-642-00457-5_28.pdf

G. Argyros and A. Kiayias, I forgot your password: Randomness attacks against php applications, Proceedings of the 21st USENIX Conference on Security Symposium, Security'12 USENIX Association. 21 [And13] Some SecureRandom Thoughts, pp.6-6, 2013.

J. Aumasson, S. Neves, Z. Wilcox-o-'hearn, and C. Winnerlein, BLAKE2: Simpler, Smaller, Fast as MD5, LNCS, vol.13, issue.7954, pp.119-135, 2013.
DOI : 10.1007/978-3-642-38980-1_8

R. Bost and M. Cornejo, Implementation of some (Verifiable) SSE schemes

R. Bost, P. Fouque, D. Barak, and S. Halevi, Verifiable dynamic symmetric searchable encryption: Optimality and forward security A model and architecture for pseudo-random generation with applications to /dev/random, ACM CCS 05, pp.203-212, 2005.

A. Bagherzandi, S. Jarecki, N. Saxena, and Y. Lu, Password-protected secret sharing, Proceedings of the 18th ACM conference on Computer and communications security, CCS '11, pp.433-444, 2011.
DOI : 10.1145/2046707.2046758
URL : http://eprint.iacr.org/2010/561.pdf

]. G. Bla79, G. R. Blakley, C. Blakley, and . Meadows, Safeguarding cryptographic keys Security of ramp schemes, Proceedings of AFIPS 1979 National Computer Conference, pp.313-317, 1979.

M. Steven, M. Bellovin, and . Merritt, Encrypted key exchange: Password-based protocols secure against dictionary attacks The one-more- RSA-inversion problems and the security of Chaum's blind signature scheme, IEEE Symposium on Security and PrivacyBNPS03] Mihir Bellare, Chanathip Namprempre, David Pointcheval, and Michael Semanko, pp.72-84185, 1992.

M. Bellare, D. Pointcheval, and P. Rogaway, Authenticated Key Exchange Secure against Dictionary Attacks, LNCS, vol.1807, issue.51, pp.139-155, 2000.
DOI : 10.1007/3-540-45539-6_11
URL : http://seclab.cs.ucdavis.edu/papers/Rogaway/dict.pdf

[. Bishop, V. Pastro, R. Rajaraman, and D. Wichs, Essentially optimal robust secret sharing with maximal corruptions. Cryptology ePrint Archive, 2015.
DOI : 10.1007/978-3-662-49890-3_3

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

M. Bellare and P. Rogaway, Entity Authentication and Key Distribution, CRYPTO'93, pp.232-249, 1994.
DOI : 10.1007/3-540-48329-2_21
URL : http://www-cse.ucsd.edu/users/mihir/papers/eakd.pdf

M. Bellare and P. Rogaway, Provably secure session key distribution, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing , STOC '95, pp.57-66, 1995.
DOI : 10.1145/225058.225084

M. Bellare and P. Rogaway, The security of triple encryption and a framework for codebased game-playing proofs, LNCS, vol.4004, issue.17, pp.409-426, 2006.

C. Blundo, A. D. Santis, and U. Vaccaro, Efficient sharing of many secrets, Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science, STACS '93, pp.692-703, 1993.
DOI : 10.1007/3-540-56503-5_68

[. Canetti, Universally composable security: a new paradigm for cryptographic protocols, Proceedings 2001 IEEE International Conference on Cluster Computing, pp.136-145, 2001.
DOI : 10.1109/SFCS.2001.959888

A. Cevallos, S. Fehr, R. Ostrovsky, Y. Curtmola, J. A. Garay et al., Unconditionally-secure robust secret sharing with compact shares Searchable symmetric encryption: improved definitions and efficient constructions, EURO- CRYPT 2012 ACM CCS 06, pp.195-208, 2006.

[. Cash, P. Grubbs, J. Perry, and T. Ristenpart, Leakage-Abuse Attacks Against Searchable Encryption, Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, CCS '15, pp.668-679
DOI : 10.14722/ndss.2014.23298

M. Cheraghchi, Nearly optimal robust secret sharing Cryptology ePrint Archive, 2015.
DOI : 10.1109/isit.2016.7541751
URL : http://eprint.iacr.org/2015/951.pdf

P. Camacho, A. Hevia, M. A. Kiwi, and R. Opazo, Strong accumulators from collision-resistant hashing, LNCS, vol.5222, pp.471-486, 2008.
DOI : 10.1007/s10207-012-0169-2

D. Cash, S. Jarecki, C. S. Jutla, H. Krawczyk, M. Rosu et al., Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries, CRYPTO 2013, pp.353-373, 2013.
DOI : 10.1007/978-3-642-40041-4_20
URL : http://eprint.iacr.org/2013/169.pdf

D. Cash, J. Jaeger, S. Jarecki, C. S. Jutla, H. Krawczyk et al., Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation, Proceedings 2014 Network and Distributed System Security Symposium, pp.74-87
DOI : 10.14722/ndss.2014.23264

J. Camenisch, A. Lehmann, A. Lysyanskaya, and G. Neven, Memento: How to Reconstruct Your Secrets from a Single Password in a Hostile Environment, Garay and Gennaro [GG14], pp.256-275
DOI : 10.1007/978-3-662-44381-1_15

J. Camenisch, A. Lysyanskaya, and G. Neven, Practical yet universally composable two-server password-authenticated secret sharing, Proceedings of the 2012 ACM conference on Computer and communications security, CCS '12, pp.525-536
DOI : 10.1145/2382196.2382252
URL : http://cs.brown.edu/~anna/papers/cln12.pdf

J. Camenisch, A. Lehmann, and G. Neven, Optimal Distributed Password Verification, Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, CCS '15, pp.182-194
DOI : 10.1007/978-3-540-30574-3_16

[. Chang and M. Mitzenmacher, Privacy Preserving Keyword Searches on Remote Encrypted Data, ACNS 05, pp.442-455, 2005.
DOI : 10.1007/11496137_30
URL : http://eprint.iacr.org/2004/051.ps.gz

R. Cramer and V. Shoup, A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack, CRYPTO'98, pp.13-25, 1998.
DOI : 10.1007/BFb0055717
URL : http://www.mathmagic.cn/crypt1998-2003/papers/1462/14620013.pdf

R. Cramer and V. Shoup, Signature schemes based on the strong RSA assumption, ACM CCS 99, pp.46-51, 1999.

L. Dorrendorf, Z. Gutterman, and B. Pinkas, Cryptanalysis of the random number generator of the Windows operating system, ACM Transactions on Information and System Security, vol.13, issue.1, pp.1-1032, 1921.
DOI : 10.1145/1609956.1609966

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

A. Desai, A. Hevia, and Y. Lisa-yin, A Practice-Oriented Treatment of Pseudorandom Number Generators, LNCS, vol.2332, issue.23, pp.368-383, 1920.
DOI : 10.1007/3-540-46035-7_24

G. Di-crescenzo, Y. Ishai, and R. Ostrovsky, Non-interactive and non-malleable commitment, Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, pp.141-150, 1948.
DOI : 10.1145/276698.276722

D. Dodis, S. Pointcheval, D. Ruhault, D. Vergnaud, A. Dodis et al., Security analysis of pseudo-random number generators with input, Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, CCS '13, pp.647-658, 2000.
DOI : 10.1145/2508859.2516653
URL : https://hal.archives-ouvertes.fr/hal-00864431

T. Elgamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transactions on Information Theory, vol.31, issue.4, pp.469-472, 1985.
DOI : 10.1109/TIT.1985.1057074

Ú. Erlingsson, Foundations of Security Analysis and Design IV: FOSAD, Level Software Security: Attacks and Defenses, pp.92-134, 2006.

M. J. Freedman, Y. Ishai, B. Pinkas, O. Ford, B. S. Kaliski et al., Keyword search and oblivious pseudorandom functions Server-assisted generation of a strong secret from a password, Proceedings of the 9th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, pp.303-324, 2000.

J. Pierre-alain-fouque, J. Stern, and . Wackers, Cryptocomputing with rationals, LNCS, vol.2357, pp.136-146, 2002.

. A. Ben, B. Fisch, F. Vo, A. Krell, V. Kumarasubramanian et al., Malicious-client security in blind seer: A scalable private DBMS, 2015 IEEE Symposium on Security and Privacy, pp.395-410, 2015.

O. Goldreich, S. Goldwasser, and S. Micali, How to construct random functions, Journal of the ACM, vol.33, issue.4, pp.792-807, 1986.
DOI : 10.1145/6490.6503
URL : http://dl.acm.org/ft_gateway.cfm?id=6503&type=pdf

[. Garg, P. Mohassel, and C. Papamanthou, TWORAM: Round-optimal oblivious RAM with applications to searchable encryption. Cryptology ePrint Archive, Secure indexes. Cryptology ePrint Archive, pp.90-71, 1010.
DOI : 10.1007/978-3-662-53015-3_20

O. Goldreich, Foundations of cryptography, p.77, 2004.

Z. Gutterman, B. Pinkas, and T. Reinman, Analysis of the Linux random number generator, 2006 IEEE Symposium on Security and Privacy (S&P'06), pp.371-385, 1921.
DOI : 10.1109/SP.2006.5

P. Golle, J. Staddon, and B. R. Waters, Secure Conjunctive Keyword Search over Encrypted Data, ACNS 04, pp.31-45, 2004.
DOI : 10.1007/978-3-540-24852-1_3
URL : http://www.cs.princeton.edu/~bwaters/research/acnsSub17.pdf

S. Gueron, A memory encryption engine suitable for general purpose processors. Cryptology ePrint Archive, p.95, 2016.
DOI : 10.1109/msp.2016.124

P. Heninger, Z. Durumeric, E. Wustrow, and J. A. Halderman, Software generation of practically strong random numbers USENIX Association Mining your ps and qs: Detection of widespread weak keys in network devices, Proceedings of the 7th Conference on USENIX Security Symposium SSYM'98 Proceedings of the 21st USENIX Conference on Security Symposium, Security'12, pp.19-19, 1998.

J. Hoffstein, J. Pipher, and J. H. Silverman, An Introduction to Mathematical Cryptography http://www.cigital.com/justice-league- blog Sunar. Fine grain cross-vm attacks on xen and vmware, IBM14] Recent Fixes in IBM SecureRandom Big Data and Cloud Computing (BdCloud), 2014 IEEE Fourth International Conference on, pp.15-38, 2008.
DOI : 10.1007/978-1-4939-1711-2

M. Saiful-islam, M. Kuzu, and M. Kantarcioglu, Access pattern disclosure on searchable encryption: Ramification, attack and mitigation, NDSS 2012, p.72, 2012.

Y. Ishai, J. Kilian, K. Nissim, and E. Petrank, Extending Oblivious Transfers Efficiently, LNCS, vol.2729, pp.145-161, 2003.
DOI : 10.1007/978-3-540-45146-4_9
URL : https://link.springer.com/content/pdf/10.1007%2F978-3-540-45146-4_9.pdf

R. Impagliazzo, L. A. Levin, and M. Luby, Pseudo-random generation from one-way functions (extended abstracts), 21st ACM STOC, pp.12-24, 1989.
DOI : 10.1145/73007.73009
URL : http://www.nada.kth.se/%7Ejohanh/prgfromowf.pdf

P. David, . Jablon-editor, and . Ct-rsa, Password authentication using multiple servers, LNCS, vol.2020, pp.344-360, 2001.

[. Java, Platform Debugger Architecture (JPDA) http://docs.oracle.com, p.41

S. Jarecki, A. Kiayias, and H. Krawczyk, Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model, ASIACRYPT 2014, Part II, pp.233-253, 2014.
DOI : 10.1007/978-3-662-45608-8_13

[. Jarecki, A. Kiayias, H. Krawczyk, and J. Xu, Highly-Efficient and Composable Password-Protected Secret Sharing, Cryptology ePrint Archive, vol.144, issue.13, pp.47-58, 2016.
DOI : 10.1109/eurosp.2016.30

M. Prasad, J. , and R. Safavi-naini, Unconditionally-secure robust secret sharing with minimum share size, FC 2013, pp.96-110, 2013.

S. Burton and J. Kaliski, Ieee p1363: A standard for rsa, diffie-hellman, and elliptic-curve cryptography (abstract), Proceedings of the International Workshop on Security Protocols, pp.117-118, 1997.

D. Soo-hyeon-kim, D. Han, Y. Kurosawa, Y. Kurosawa, and . Ohtaki, Predictability of android OpenSSL's pseudo random number generator UC-secure searchable symmetric encryption How to update documents verifiably in searchable symmetric encryption Dynamic searchable symmetric encryption, Yu et al. [YDG12], pp.659-668, 2012.

J. Kilian and P. Rogaway, How to Protect DES Against Exhaustive Key Search (an Analysis of DESX), Journal of Cryptology, vol.14, issue.1, pp.17-35, 2001.
DOI : 10.1007/s001450010015

J. Kelsey, B. Schneier, D. Wagner, and C. Hall, Cryptanalytic Attacks on Pseudorandom Number Generators, LNCS, vol.1372, issue.98, pp.168-188
DOI : 10.1007/3-540-69710-1_12
URL : https://link.springer.com/content/pdf/10.1007%2F3-540-69710-1_12.pdf

A. Bishop, L. , and V. Pastro, Robust secret sharing schemes against local adversaries. Cryptology ePrint Archive, p.49, 2014.
DOI : 10.1007/978-3-662-49387-8_13
URL : http://eprint.iacr.org/2014/909.pdf

K. Michaelis, C. Meyer, J. Schwenk, ]. R. Mceliece, and D. V. Sarwate, Randomly failed! The state of randomness in current java implementations On sharing secrets and reed-solomon codes, CT-RSA 2013, pp.129-144, 1981.

J. Maitin-shepard, M. Tibouchi, and D. F. Aranha, Elliptic Curve Multiset Hash. arXiv, pp.90-104, 2014.
DOI : 10.1093/comjnl/bxw053
URL : http://arxiv.org/pdf/1601.06502

M. Naor and O. Reingold, Number-theoretic constructions of efficient pseudo-random functions, 38th FOCS, pp.458-467, 1997.

S. Obana, Almost Optimum t-Cheater Identifiable Secret Sharing Schemes, LNCS, vol.6632, pp.284-302, 2011.
DOI : 10.1007/978-3-642-20465-4_17
URL : https://link.springer.com/content/pdf/10.1007%2F978-3-642-20465-4_17.pdf

T. Okamoto and D. Pointcheval, The gap-problems: A new class of problems for the security of cryptographic schemes 48 [Ope13] OpenSSL PRNG Is Not (Really) Fork-safeopenssl-prng-is-not-really-fork-safe/. 29 [Orc] Orchid is a Tor client implementation and library written in pure Java, LNCS, vol.0821, pp.104-118, 1992.

P. Paillier, Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, EUROCRYPT'99PTT09] Charalampos Papamanthou, Roberto Tamassia, and Nikos Triandopoulos. Cryptographic accumulators for authenticated hash tables. Cryptology ePrint Archive, pp.223-238, 1999.
DOI : 10.1007/3-540-48910-X_16
URL : http://www.mathmagic.cn/crypt1998-2003/papers/1592/15920223.pdf

L. Ren, C. Fletcher, X. Yu, M. Van-dijk, and S. Devadas, Integrity verification for path Oblivious-RAM, 2013 IEEE High Performance Extreme Computing Conference (HPEC), p.90, 2013.
DOI : 10.1109/HPEC.2013.6670339
URL : http://people.csail.mit.edu/devadas/pubs/integrity-hpec13.pdf

R. L. Rivest, A. Shamir, and L. M. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol.21, issue.2, pp.120-126, 1978.
DOI : 10.1145/359340.359342

[. Ristenpart, E. Tromer, H. Shacham, and S. Savage, Hey, you, get off of my cloud, Proceedings of the 16th ACM conference on Computer and communications security, CCS '09, pp.199-212, 2009.
DOI : 10.1145/1653662.1653687

]. C. Sha49 and . Shannon, Communication theory of secrecy systems, Bell System Technical Journal, vol.28, issue.10, pp.656-715, 1949.

A. Shamir, Secure hash standard. National Institute of Standards and Technology, NIST FIPS PUB 180-1, U.S. Department of Commerce [Sho01] Victor Shoup. OAEP reconsidered Practical dynamic searchable encryption with small leakage SoK: Eternal war in memory Practical techniques for searches on encrypted data, Communications of the Association for Computing Machinery NDSS 2014 [NDS14]. 71 2013 IEEE Symposium on Security and Privacy IEEE Symposium on Security and Privacy, pp.612-613, 1971.

[. Trevisan, Extractors and pseudorandom generators, Journal of the ACM, vol.48, issue.4, pp.860-879, 2001.
DOI : 10.1145/502090.502099
URL : http://dimacs.rutgers.edu/~dieter/Seminar/Papers/trevisan-extractor.ps

R. Tamassia and N. Triandopoulos, Computational Bounds on Hierarchical Data Processing with Applications to Information Security, LNCS, vol.3580, issue.87, pp.153-165, 2005.
DOI : 10.1007/11523468_13
URL : http://www.cs.bu.edu/~nikos/papers/cbhdp.pdf

M. Tompa and H. Woll, How to share a secret with cheaters, Journal of Cryptology, vol.22, issue.11, pp.133-138, 1988.
DOI : 10.1007/BF02252871

N. Victor-van-der-veen, L. Dutt-sharma, H. Cavallaro, and . Bos, Memory Errors: The Past, the Present, and the Future, Proceedings of the 15th International Symposium on Research in Attacks, Intrusions, and Defenses (RAID), p.19, 2012.
DOI : 10.1007/978-3-642-33338-5_5

J. Von-neumann and A. H. Taub, John von Neumann : collected works : design of computers, theory of automata and numerical analysis, 1961.

X. S. Wang, K. Nayak, C. Liu, T. Chan, E. Shi et al., Oblivious Data Structures, Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, CCS '14, pp.215-226, 2014.
DOI : 10.1145/1037947.1024403

X. Yi, F. Hao, L. Chen, and J. K. Liu, Practical Threshold Password-Authenticated Secret Sharing Protocol, ESORICS 2015, pp.347-365, 2015.
DOI : 10.1007/978-3-319-11212-1_15