Vinod Vaikuntanathan and Or Zamir claim pseudorandom noise-resilient key exchange lets AI agents establish covert communication without a shared secret while producing transcripts indistinguishable from honest interaction, making transcript auditing alone insufficient to rule out hidden coordination.

Open article · Retrieved 2026-09-23T14:28:02.409264+00:00

# Computer Science > Cryptography and Security

**arXiv:2604.04757** (cs)

[Submitted on 6 Apr 2026]

# Title:Undetectable Conversations Between AI Agents via Pseudorandom Noise-Resilient Key Exchange

Authors:[Vinod Vaikuntanathan](https://arxiv.org/search/cs?searchtype=author&query=Vaikuntanathan,+V), [Or Zamir](https://arxiv.org/search/cs?searchtype=author&query=Zamir,+O)

View a PDF of the paper titled Undetectable Conversations Between AI Agents via Pseudorandom Noise-Resilient Key Exchange, by Vinod Vaikuntanathan and 1 other authors

[View PDF](https://arxiv.org/pdf/2604.04757)
[HTML (experimental)](https://arxiv.org/html/2604.04757v1)
> Abstract:AI agents are increasingly deployed to interact with other agents on behalf of users and organizations. We ask whether two such agents, operated by different entities, can carry out a parallel secret conversation while still producing a transcript that is computationally indistinguishable from an honest interaction, even to a strong passive auditor that knows the full model descriptions, the protocol, and the agents' private contexts. Building on recent work on watermarking and steganography for LLMs, we first show that if the parties possess an interaction-unique secret key, they can facilitate an optimal-rate covert conversation: the hidden conversation can exploit essentially all of the entropy present in the honest message distributions.
>   
> Our main contributions concern extending this to the keyless setting, where the agents begin with no shared secret. We show that covert key exchange, and hence covert conversation, is possible even when each model has an arbitrary private context, and their messages are short and fully adaptive, assuming only that sufficiently many individual messages have at least constant min-entropy. This stands in contrast to previous covert communication works, which relied on the min-entropy in each individual message growing with the security parameter. To obtain this, we introduce a new cryptographic primitive, which we call pseudorandom noise-resilient key exchange: a key-exchange protocol whose public transcript is pseudorandom while still remaining correct under constant noise. We study this primitive, giving several constructions relevant to our application as well as strong limitations showing that more naive variants are impossible or vulnerable to efficient attacks.
>   
> These results show that transcript auditing alone cannot rule out covert coordination between AI agents, and identify a new cryptographic theory that may be of independent interest.

|  |  |
| --- | --- |
| Subjects: | Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI); Machine Learning (cs.LG) |
| Cite as: | [arXiv:2604.04757](https://arxiv.org/abs/2604.04757) [cs.CR] |
|  | (or  [arXiv:2604.04757v1](https://arxiv.org/abs/2604.04757v1) [cs.CR] for this version) |
|  | <https://doi.org/10.48550/arXiv.2604.04757> Focus to learn more  arXiv-issued DOI via DataCite |

## Submission history

From: Or Zamir [[view email](https://arxiv.org/show-email/0c0af685/2604.04757)]

Full-text links:

## Access Paper:

View a PDF of the paper titled Undetectable Conversations Between AI Agents via Pseudorandom Noise-Resilient Key Exchange, by Vinod Vaikuntanathan and 1 other authors

- [View PDF](https://arxiv.org/pdf/2604.04757)
- [HTML (experimental)](https://arxiv.org/html/2604.04757v1)
- [TeX Source](https://arxiv.org/src/2604.04757)

[license icon](http://creativecommons.org/licenses/by-nc-nd/4.0/ "Rights to this article")

### Current browse context:

cs.CR

[< prev](https://arxiv.org/prevnext?id=2604.04757&function=prev&context=cs.CR "previous in cs.CR (accesskey p)")
  |   
[next >](https://arxiv.org/prevnext?id=2604.04757&function=next&context=cs.CR "next in cs.CR (accesskey n)")

[new](https://arxiv.org/list/cs.CR/new)
 | 
[recent](https://arxiv.org/list/cs.CR/recent)
 | [2026-04](https://arxiv.org/list/cs.CR/2026-04)

Change to browse by:

[cs](https://arxiv.org/abs/2604.04757?context=cs)  
[cs.AI](https://arxiv.org/abs/2604.04757?context=cs.AI)  
[cs.LG](https://arxiv.org/abs/2604.04757?context=cs.LG)

### References & Citations

- [NASA ADS](https://ui.adsabs.harvard.edu/abs/arXiv:2604.04757)
- [Google Scholar](https://scholar.google.com/scholar_lookup?arxiv_id=2604.04757)
- [Semantic Scholar](https://api.semanticscholar.org/arXiv:2604.04757)

export BibTeX citation
Loading...

## BibTeX formatted citation

×

loading...

Data provided by:

### Bookmark

[BibSonomy](http://www.bibsonomy.org/BibtexHandler?requTask=upload&url=https://arxiv.org/abs/2604.04757&description=Undetectable Conversations Between AI Agents via Pseudorandom Noise-Resilient Key Exchange "Bookmark on BibSonomy")
[Reddit](https://reddit.com/submit?url=https://arxiv.org/abs/2604.04757&title=Undetectable Conversations Between AI Agents via Pseudorandom Noise-Resilient Key Exchange "Bookmark on Reddit")



Bibliographic Tools

# Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer *([What is the Explorer?](https://info.arxiv.org/labs/showcase.html#arxiv-bibliographic-explorer))*

Connected Papers Toggle

Connected Papers *([What is Connected Papers?](https://www.connectedpapers.com/about))*

Litmaps Toggle

Litmaps *([What is Litmaps?](https://www.litmaps.co/))*

scite.ai Toggle

scite Smart Citations *([What are Smart Citations?](https://www.scite.ai/))*

Code, Data, Media

# Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv *([What is alphaXiv?](https://alphaxiv.org/))*

Links to Code Toggle

CatalyzeX Code Finder for Papers *([What is CatalyzeX?](https://www.catalyzex.com))*

DagsHub Toggle

DagsHub *([What is DagsHub?](https://dagshub.com/))*

GotitPub Toggle

Gotit.pub *([What is GotitPub?](http://gotit.pub/faq))*

Huggingface Toggle

Hugging Face *([What is Huggingface?](https://huggingface.co/huggingface))*

ScienceCast Toggle

ScienceCast *([What is ScienceCast?](https://sciencecast.org/welcome))*

Demos

# Demos

Replicate Toggle

Replicate *([What is Replicate?](https://replicate.com/docs/arxiv/about))*

Spaces Toggle

Hugging Face Spaces *([What is Spaces?](https://huggingface.co/docs/hub/spaces))*

Spaces Toggle

TXYZ.AI *([What is TXYZ.AI?](https://txyz.ai))*

Related Papers

# Recommenders and Search Tools

Link to Influence Flower

Influence Flower *([What are Influence Flowers?](https://influencemap.cmlab.dev/))*

Core recommender toggle

CORE Recommender *([What is CORE?](https://core.ac.uk/services/recommender))*

- Author
- Venue
- Institution
- Topic


About arXivLabs

# arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? [**Learn more about arXivLabs**](https://info.arxiv.org/labs/index.html).

[Which authors of this paper are endorsers?](https://arxiv.org/auth/show-endorsers/2604.04757) |
Disable MathJax ([What is MathJax?](https://info.arxiv.org/help/mathjax.html))