Provably Secure Steganography
Open accessThe claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
If a benign group of K accounts appears in a week with probability π > 0, and when it appears its accounts' queries have the same joint law as the colluders' and are independent of the rest of the week, then every test with false-alarm rate at most α has power at most α/π.
“Proposition 1 (Law matching) . If a benign group of K accounts appears in a week with probability π > 0 , and when it appears its accounts' queries have the same joint law as the colluders' and are independent of the rest of the week, then every test with false-alarm rate at most α has power at most α/π .”
From The Limits of Query Monitoring against Distributed Model Extraction (2026) · cites this paper as Hopper et al., 2002
Split into 2 atoms — 0 confirmed, 1 partially supported, 0 disputed, 0 misattributed, 1 unverifiable. Expand the claim to see per-atom verdicts.
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
No references could be resolved yet.
Research works printed but not linked: 8
- Ross J. Anderson and Fabien A. P. Petitcolas. On The Limits of Steganography. IEEE Journal of Selected Areas in Communications, 16(4). May 1998.
- C. Cachin. An Information-Theoretic Model for Steganography. In: Information Hiding -Second International Workshop, Preproceedings. April 1998.
- Oded Goldreich, Shafi Goldwasser and Silvio Micali. How to Construct Random Functions. Journal of the ACM, 33(4):792 -807, 1986.
- Johan Hastad, Russell Impagliazzo, Leonid A. Levin, and Michael Luby. A pseu- dorandom generator from any one-way function. SIAM Journal on Computing, 28(4):1364-1396, 1999.
- T. Mittelholzer. An Information-Theoretic Approach to Steganography and Wa- termarking In: Information Hiding -Third International Workshop. 2000.
- J. A. O'Sullivan, P. Moulin, and J. M. Ettinger Information theoretic analysis of Steganography. In: Proceedings ISIT '98. 1998.
- Phillip Rogaway, Mihir Bellare, John Black and Ted Krovetz. OCB: A Block- Cipher Mode of Operation for Efficient Authenticated Encryption. In: Proceedings of the Eight ACM Conference on Computer and Communications Security (CCS- 8). November 2001.
- J Zollner, H.Federrath, H.Klimant, A.Pftizmann, R. Piotraschke, A.Westfield, G.Wicke, G.Wolf. Modeling the security of steganographic systems. In: Information Hiding -Second International Workshop, Preproceedings. April 1998.
Cited by
Sorted by citations
The Limits of Query Monitoring against Distributed Model Extraction
Khilar, S. C. (2026) · arXiv
- Authors
- Hopper, N. J., Langford, J., & von Ahn, L.
- Affiliations
- Carnegie Mellon University (US)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 77-92
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1479681406
- Cited by
- 198
- References
- 0
- Citations by year
- 2026: 8 · 2025: 11 · 2024: 9 · 2023: 8 · 2022: 7 · 2021: 7 · 2020: 7 · 2019: 2 · 2018: 8 · 2017: 9 · 2016: 9 · 2015: 8 · 2014: 8 · 2013: 7 · 2012: 11
- FWCI
- 6.77
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Lecture notes in computer science (publishedVersion)
- Funders
- National Science Foundation (0085982, 0122581)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Steganography and Watermarking Techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
- Keywords
- steganography, one-way functions, computational indistinguishability, covert communication, eavesdropper
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
