Public-Key Steganography
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
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?
Provably covert secure key exchange can be facilitated if public key infrastructure exists.
“von Ahn & Hopper (2004) first showed that provably covert secure key exchange can be facilitated if public key infrastructure (PKI) exists (Diffie & Hellman, 2006;Rivest et al., 1978).”
From Open Challenges in Multi-Agent Security: Towards Secure Systems of Interacting AI Agents (2025) · cites this paper as von Ahn & Hopper, 2004
If public key infrastructure is available to the agents, covert communications can be further hardened against spoofing or other man-in-the-middle or elicitation attacks as agents can authenticate their hidden communications.
“If public key infrastructure is available to the agents, covert communications can be further hardened against spoofing or other man-in-the-middle or elicitation attacks as agents can authenticate their hidden communications (von Ahn & Hopper, 2004).”
From Open Challenges in Multi-Agent Security: Towards Secure Systems of Interacting AI Agents (2025) · cites this paper as von Ahn & Hopper, 2004
Cited by
Sorted by citations
Open Challenges in Multi-Agent Security: Towards Secure Systems of Interacting AI Agents
de Witt, C. S., Krawiecka, K., Krawczuk, I., Hagag, B., Anderson, W. L., Belcak, P., Bucknall, B., Cai, X., Chopra, A., Cohen, D., et al. (2025) · arXiv · doi:10.48550/arxiv.2505.02077 · Cited by 2 · see citing works
- Authors
- von Ahn, L., & Hopper, N. J.
- Affiliations
- Carnegie Mellon University (US)
- ORCID
- Hopper, Nicholas J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2004
- Pages
- 323-341
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1878459630
- Cited by
- 147
- References
- 0
- Citations by year
- 2026: 2 · 2025: 13 · 2024: 10 · 2023: 8 · 2022: 6 · 2021: 7 · 2020: 2 · 2019: 5 · 2018: 4 · 2017: 2 · 2016: 8 · 2015: 2 · 2014: 6 · 2013: 10 · 2012: 8
- FWCI
- 5.83
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- 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
- computational security, random oracle model, adaptive chosen ciphertext attack, provable security
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
