Upper and Lower Bounds on Black-Box Steganography-Reference-Cited by-同舟云学术

Upper and Lower Bounds on Black-Box Steganography

Published:2008-04-08 Issue:3 Volume:22 Page:365-394
ISSN:0933-2790
Container-title:Journal of Cryptology
language:en
Short-container-title:J Cryptol

Author:

Dedić Nenad,Itkis Gene,Reyzin Leonid,Russell Scott

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,Software

Link

http://link.springer.com/content/pdf/10.1007/s00145-008-9020-3.pdf

Reference18 articles.

1. Lecture Notes in Computer Science;M. Backes,1995

2. B. Bloom, Space/time tradeoffs in hash coding with allowable errors. Commun. ACM 13(7), 422–426 (1970)

3. A. Broder, M. Mitzenmacher, Network applications of bloom filters: A survey, in Proceedings of the Fortieth Annual Allerton Conference on Communication, Control and Computing, 2002

4. Lecture Notes in Computer Science;C. Cachin,1998

5. Lecture Notes in Computer Science;N. Dedić,1995

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Two-Stage Optimal Hypotheses Testing for a Model of Stegosystem with an Active Adversary;JUCS - Journal of Universal Computer Science;2023-11-28

2. Stealth Key Exchange and Confined Access to the Record Protocol Data in TLS 1.3;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15

3. EBDL: Effective blockchain-based covert storage channel with dynamic labels;Journal of Network and Computer Applications;2023-01

4. What Did You Add to My Additive Manufacturing Data?: Steganographic Attacks on 3D Printing Files;24th International Symposium on Research in Attacks, Intrusions and Defenses;2021-10-06

5. On the universal steganography of optimal rate;Information and Computation;2020-12