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