Efficient log authentication for forensic computing

N. Kawaguchi, N. Obata, S. Ueda, Y. Azuma, H. Shigeno, K. Okada
{"title":"Efficient log authentication for forensic computing","authors":"N. Kawaguchi, N. Obata, S. Ueda, Y. Azuma, H. Shigeno, K. Okada","doi":"10.1109/IAW.2005.1495955","DOIUrl":null,"url":null,"abstract":"In this paper, an efficient log authentication scheme for forensic computing is proposed. To conduct reliable forensic computing, it is required that the logs as digital evidences be verified. To verify them, digital signatures issued by authorities are needed. However, if many logging hosts connect to the server that issues the signatures, the traffic of the server will increase. Therefore, the authors proposed an efficient log authentication scheme for forensic computing. The scheme reduces the traffic of the sign server, which signs the logs of the logging hosts, by using distributed Merkle tree algorithm among the logging hosts. The scheme's effectiveness was shown through evaluation experiments.","PeriodicalId":252208,"journal":{"name":"Proceedings from the Sixth Annual IEEE SMC Information Assurance Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings from the Sixth Annual IEEE SMC Information Assurance Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IAW.2005.1495955","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In this paper, an efficient log authentication scheme for forensic computing is proposed. To conduct reliable forensic computing, it is required that the logs as digital evidences be verified. To verify them, digital signatures issued by authorities are needed. However, if many logging hosts connect to the server that issues the signatures, the traffic of the server will increase. Therefore, the authors proposed an efficient log authentication scheme for forensic computing. The scheme reduces the traffic of the sign server, which signs the logs of the logging hosts, by using distributed Merkle tree algorithm among the logging hosts. The scheme's effectiveness was shown through evaluation experiments.
用于取证计算的高效日志身份验证
提出了一种用于取证计算的高效日志认证方案。为了进行可靠的取证计算,需要对作为数字证据的日志进行验证。为了验证它们,需要当局颁发的数字签名。但是,如果许多日志主机连接到发出签名的服务器,则服务器的流量将增加。为此,作者提出了一种高效的取证计算日志认证方案。该方案通过在日志主机之间使用分布式默克尔树算法,减少了对日志主机的日志进行签名的签名服务器的流量。通过评价实验验证了该方案的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信