Randomness Efficient Steganography
暂无分享,去创建一个
Aggelos Kiayias | Alexander Russell | Narasimha Shashidhar | A. Kiayias | A. Russell | N. Shashidhar
[1] Jaikumar Radhakrishnan,et al. Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators , 2000, SIAM J. Discret. Math..
[2] Thomas Mittelholzer,et al. An Information-Theoretic Approach to Steganography and Watermarking , 1999, Information Hiding.
[3] Noam Nisan,et al. Extracting Randomness: A Survey and New Constructions , 1999, J. Comput. Syst. Sci..
[4] Victor Shoup,et al. A computational introduction to number theory and algebra , 2005 .
[5] Avi Wigderson,et al. Extracting Randomness via Repeated Condensing , 2006, SIAM J. Comput..
[6] Noam Nisan,et al. Extracting randomness: how and why. A survey , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).
[7] Aggelos Kiayias,et al. Efficient Steganography with Provable Security Guarantees , 2005, Information Hiding.
[8] Gustavus J. Simmons,et al. The Prisoners' Problem and the Subliminal Channel , 1983, CRYPTO.
[9] Christian Cachin,et al. An information-theoretic model for steganography , 2004, Inf. Comput..
[10] Hannes Federrath,et al. Modeling the Security of Steganographic Systems , 1998, Information Hiding.
[11] Ronen Shaltiel,et al. Recent Developments in Explicit Constructions of Extractors , 2002, Bull. EATCS.
[12] Ran Raz,et al. Extracting all the randomness and reducing the error in Trevisan's extractors , 1999, STOC '99.
[13] John Langford,et al. Provably Secure Steganography , 2009, IEEE Trans. Computers.
[14] Nicholas Hopper,et al. Public-Key Steganography , 2003, EUROCRYPT.
[15] Noam Nisan,et al. Randomness is Linear in Space , 1996, J. Comput. Syst. Sci..