One-way indexing separates a published file into encrypted content blocks (indexed by hash1(block)), a content manifest (indexed by hash2(keyword)), and a key manifest (indexed by hash3(keyword)), so a storer holding all content chunks cannot recover the plaintext or keywords without inverting a cryptographic one-way function. Using distinct hash functions for each manifest type also minimizes the probability that a single node stores both manifests, preventing correlation.
From 2012-vasserman-one-way — One-way indexing for plausible deniability in censorship resistant storage
· §3.1
· 2012
· Free and Open Communications on the Internet
Implications
Partition file content, metadata, and decryption keys under separate cryptographic hash namespaces so honest intermediate storers have plausible deniability — no single stored component reveals plaintext or search terms.
Use three independent hash functions (one per component type) when assigning DHT storage IDs to minimize the probability that any one node can correlate all components needed for decryption.