Rohan: A Stateless Zero-Knowledge Trust Gateway for Privacy-Preserving Agentic Workflows via Streamable HTTP

The rapid advance of autonomous Multi-Agent Systems (MAS) across enterprise workflows, AI infrastructure increasingly transitions toward cloud-native, scale-to-zero environments and browser-native execution runtimes. However, production deployment remains severely constrained by data leakage risks inherent to the Model Context Protocol (MCP), which frequently exchanges sensitive credentials, system prompts, and negotiation constraints in plaintext. Furthermore, legacy security boundaries enforce persistent network tunnels (e.g., Server-Sent Events, WebSockets) that break serverless scalability. This paper introduces the Rohan Protocol, a stateless Zero-Knowledge (ZK) trust gateway that decouples execution data flow from cryptographic trust verification. By compiling zero-knowledge circuits into universal WebAssembly (WASM) components via WASI Preview 2 and browser WebWorkers, Rohan generates client-side proofs of validity (~580 Bytes) transmitted over a novel Streamable HTTP transport standard. Rohan integrates deterministic RAM sanitation via zeroize, an in-line semantic firewall to neutralize indirect prompt injection, and browser DOM shielding for WebMCP. We demonstrate that Rohan eliminates persistent socket overhead, guarantees privacy-by-architecture, and ensures GDPR/HIPAA compliance within highly distributed machine-to-machine (M2M) economies.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-13
DOI
https://doi.org/10.5281/zenodo.22730239
Primary Topic
Security and Verification in Computing
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Rohan: A Stateless Zero-Knowledge Trust Gateway for Privacy-Preserving Agentic Workflows via Streamable HTTP

Julian von Bordelius
Zenodo (CERN European Organization for Nuclear Research)
Security and Verification in Computing
preprint

Rohan: A Stateless Zero-Knowledge Trust Gateway for Privacy-Preserving Agentic Workflows via Streamable HTTP

Julian von Bordelius
preprint en

Abstract

The rapid advance of autonomous Multi-Agent Systems (MAS) across enterprise workflows, AI infrastructure increasingly transitions toward cloud-native, scale-to-zero environments and browser-native execution runtimes. However, production deployment remains severely constrained by data leakage risks inherent to the Model Context Protocol (MCP), which frequently exchanges sensitive credentials, system prompts, and negotiation constraints in plaintext. Furthermore, legacy security boundaries enforce persistent network tunnels (e.g., Server-Sent Events, WebSockets) that break serverless scalability. This paper introduces the Rohan Protocol, a stateless Zero-Knowledge (ZK) trust gateway that decouples execution data flow from cryptographic trust verification. By compiling zero-knowledge circuits into universal WebAssembly (WASM) components via WASI Preview 2 and browser WebWorkers, Rohan generates client-side proofs of validity (~580 Bytes) transmitted over a novel Streamable HTTP transport standard. Rohan integrates deterministic RAM sanitation via zeroize, an in-line semantic firewall to neutralize indirect prompt injection, and browser DOM shielding for WebMCP. We demonstrate that Rohan eliminates persistent socket overhead, guarantees privacy-by-architecture, and ensures GDPR/HIPAA compliance within highly distributed machine-to-machine (M2M) economies.

Zenodo (CERN European Organization for Nuclear Research)
Industry, innovation and infrastructure
Security and Verification in Computing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.