Hash-based key-dependent filtering of covert carriers improves detection resistance in network storage and timing covert channels with low processing overhead.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A survey of LLMs for graph computation introduces a role-based taxonomy of executors versus planners and concludes that current models suit simple small-scale tasks but remain unreliable for large-scale exact computation.
citing papers explorer
-
Hiding the Trees in the Forest: Building Network Covert Channels with Hash-Based Covert Carrier Filtering
Hash-based key-dependent filtering of covert carriers improves detection resistance in network storage and timing covert channels with low processing overhead.
-
Are Large Language Models Suitable for Graph Computation? Progress and Prospects
A survey of LLMs for graph computation introduces a role-based taxonomy of executors versus planners and concludes that current models suit simple small-scale tasks but remain unreliable for large-scale exact computation.