References

[Bei11]

Amos Beimel. Secret-sharing schemes: A survey. In Coding and Cryptology - Third International Workshop, IWCC 2011, Qingdao, China, May 30-June 3, 2011. Proceedings, 11–46. 2011. URL: http://dx.doi.org/10.1007/978-3-642-20901-7_2, doi:10.1007/978-3-642-20901-7_2.

[BD07]

Carl Bosley and Yevgeniy Dodis. Does privacy require true randomness? In Theory of Cryptography, 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21-24, 2007, Proceedings, 1–20. 2007. URL: http://dx.doi.org/10.1007/978-3-540-70936-7_1, doi:10.1007/978-3-540-70936-7_1.

[CS15]

Gil Cohen and Igor Shinkar. Zero-fixing extractors for sub-logarithmic entropy. In International Colloquium on Automata, Languages, and Programming, 343–354. Springer, 2015.

[DachmanSoledGKM12]

Dana Dachman-Soled, Rosario Gennaro, Hugo Krawczyk, and Tal Malkin. Computational extractors and pseudorandomness. In Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Taormina, Sicily, Italy, March 19-21, 2012. Proceedings, 383–403. 2012. URL: http://dx.doi.org/10.1007/978-3-642-28914-9_22, doi:10.1007/978-3-642-28914-9_22.

[DOPS04]

Yevgeniy Dodis, Shien Jin Ong, Manoj Prabhakaran, and Amit Sahai. On the (im)possibility of cryptography with imperfect randomness. In 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, 196–205. 2004. URL: http://dx.doi.org/10.1109/FOCS.2004.44, doi:10.1109/FOCS.2004.44.

[DPW14]

Yevgeniy Dodis, Krzysztof Pietrzak, and Daniel Wichs. Key derivation without entropy waste. In Advances in Cryptology - EUROCRYPT 2014 - 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, May 11-15, 2014. Proceedings, 93–110. 2014. URL: http://dx.doi.org/10.1007/978-3-642-55220-5_6, doi:10.1007/978-3-642-55220-5_6.

[KZ06]

Jesse Kamp and David Zuckerman. Deterministic extractors for bit-fixing sources and exposure-resilient cryptography. SIAM Journal on Computing, 36(5):1231–1247, 2006.

[Kra10]

Hugo Krawczyk. Cryptographic extraction and key derivation: the HKDF scheme. In Advances in Cryptology - CRYPTO 2010, 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010. Proceedings, 631–648. 2010. URL: http://dx.doi.org/10.1007/978-3-642-14623-7_34, doi:10.1007/978-3-642-14623-7_34.

[RTaShma97]

Jaikumar Radhakrishnan and Amnon Ta-Shma. Tight bounds for depth-two superconcentrators. In 38th Annual Symposium on Foundations of Computer Science, FOCS ‘97, Miami Beach, Florida, USA, October 19-22, 1997, 585–594. 1997. URL: http://dx.doi.org/10.1109/SFCS.1997.646148, doi:10.1109/SFCS.1997.646148.

[RV13]

Yakir Reshef and Salil Vadhan. On extractors and exposure-resilient functions for sublogarithmic entropy. Random Structures & Algorithms, 42(3):386–401, 2013.