Visible to the public Efficient tamper-evident logging of distributed systems via concurrent authenticated tree

TitleEfficient tamper-evident logging of distributed systems via concurrent authenticated tree
Publication TypeConference Paper
Year of Publication2017
AuthorsNing, F., Wen, Y., Shi, G., Meng, D.
Conference Name2017 IEEE 36th International Performance Computing and Communications Conference (IPCCC)
KeywordsAnalytical models, audit logs, authentication, Cats, Chameleon hash, chameleon hashing, composability, Concurrency, concurrency control, concurrent authenticated tree, Concurrent Authentication, concurrent large-scale log streams, cryptographic hashing, cryptography, Cyber-physical systems, data integrity, data structure, data structures, digital signatures, discrete log, distributed processing, distributed system, forward security, highly concurrent scale log streams, History, integrity, integrity verification, large-scale distributed applications, large-scale distributed systems, log data, log management tools, logarithmic number, Merkle history tree, Merkle-tree approach, Metrics, program verification, providing security, pubcrawl, public verifiability, resilience, Resiliency, resource-constrained systems, secure audit logging schemes, Secure logging, secure logging system, security, security community, Servers, space-efficiency, system monitoring, tamper-evident logging, Tools, tree data structures, untrusted machine
AbstractSecure logging as an indispensable part of any secure system in practice is well-understood by both academia and industry. However, providing security for audit logs on an untrusted machine in a large distributed system is still a challenging task. The emergence and wide availability of log management tools prompted plenty of work in the security community that allows clients or auditors to verify integrity of the log data. Most recent solutions to this problem focus on the space-efficiency or public verifiability of forward security. Unfortunately, existing secure audit logging schemes have significant performance limitations that make them impractical for realtime large-scale distributed applications: Existing cryptographic hashing is computationally expensive for logging in task intensive or resource-constrained systems especially to prove individual log events, while Merkle-tree approach has fundamental limitations when face with highly concurrent, large-scale log streams due to its serially appending feature. The verification step of Merkle-tree based approach requiring a logarithmic number of hash computations is becoming a bottleneck to improve the overall performance. There is a huge gap between the flux of log streams collected and the computational efficiency of integrity verification in the large-scale distributed systems. In this work, we develop a novel scheme, performance of which favorably compares with the existing solutions. The performance guarantees that we achieve stem from a novel data structure called concurrent authenticated tree, which allows log events concurrently appending and removes the need to wait for append operations to complete sequentially. We implement a prototype using chameleon hashing based on discrete log and Merkle history tree. A comprehensive experimental evaluation of the proposed and existing approaches is used to validate the analytical models and verify our claims. The results demonstrate that our proposed scheme verifying in a concurrent way is significantly more efficient than the previous tree-based approach.
Citation Keyning_efficient_2017