2012
DOI: 10.1007/978-3-642-32946-3_12
|View full text |Cite
|
Sign up to set email alerts
|

Efficient, Compromise Resilient and Append-Only Cryptographic Schemes for Secure Audit Logging

Abstract: Abstract. Due to the forensic value of audit logs, it is vital to provide compromise resiliency and append-only properties in a logging system to prevent active attackers. Unfortunately, existing symmetric secure logging schemes are not publicly verifiable and cannot address applications that require public auditing (e.g., public financial auditing), besides being vulnerable to certain attacks and dependent on continuous trusted server support. Moreover, Public Key Cryptography (PKC)-based secure logging schem… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
27
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 43 publications
(29 citation statements)
references
References 26 publications
0
27
0
Order By: Relevance
“…They firstly presented FssAgg authentication technique to achieve it. Later, PKC-based secure logging called Log-FAS [19] achieved both forward-security and append-only properties, and improved log integrity auditing efficiency. CloudProof system [8] designed a reliable log named attestation with both forward-security and append-only properties.…”
Section: Reliable Loggingmentioning
confidence: 99%
“…They firstly presented FssAgg authentication technique to achieve it. Later, PKC-based secure logging called Log-FAS [19] achieved both forward-security and append-only properties, and improved log integrity auditing efficiency. CloudProof system [8] designed a reliable log named attestation with both forward-security and append-only properties.…”
Section: Reliable Loggingmentioning
confidence: 99%
“…military and governmental use, where complex hardware and side-channel attacks are reasonable threats. ------Bellare and Yee [3] ------FssAgg [20] ------Logcrypt [13] ------LogFAS [34] ------…”
Section: Requirements Comparisonmentioning
confidence: 99%
“…Such data structures have been used to perform O(1) comparisons, such as between dictionaries [8], hash tables [5], or B-Treaps [10]. Similar data structures have also been used to enforce append-only properties on logs [9,22], including the Bitcoin blockchain itself [15]. Unlike SEQHASH, none of these data structures support O(log n) concatenation of sequences in the face of adversaries choosing the input data.…”
Section: Other Data Structuresmentioning
confidence: 99%