CEF-Log achieves 0.99 F1 on CSIC 2010 logs with four examples via expert-methodology prompting and introduces ForenWebLog dataset for explainable forensic detection.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.CR 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A Merkle tree pipeline with adaptive chunking provides tamper-evident log verification for IoT edge devices, achieving over 130,000 logs/s throughput, 22 ms verification latency, and perfect tampering detection on synthetic data without blockchain.
citing papers explorer
-
Sample-Efficient LLM-Based Detection of Malicious Web Server Logs with Forensically Explainable Reasoning
CEF-Log achieves 0.99 F1 on CSIC 2010 logs with four examples via expert-methodology prompting and introduces ForenWebLog dataset for explainable forensic detection.
-
Lightweight Tamper-Evident Log Integrity Verification for IoT Edge Environments: A Merkle Tree Pipeline with Adaptive Chunking
A Merkle tree pipeline with adaptive chunking provides tamper-evident log verification for IoT edge devices, achieving over 130,000 logs/s throughput, 22 ms verification latency, and perfect tampering detection on synthetic data without blockchain.