Abstract
Attackers try to forge or delete personal information access records to hide traces of their attacks. As personal information access records can be used to analyze infringement accidents or as legal evidence in the event of malicious attacks, maintaining their integrity is very important. This article presents measures to efficiently prove the integrity of distributed personal information access records. To construct a reliable log system, diversified security requirements are established, and mechanisms such as a hash chain, message authentication code, and Merkle tree are incorporated. Moreover, as integrity is proved through a third-party verification institution, attacks by external as well as internal attackers can be detected. During the validation process, existing log record protection methods fail to detect forgery or deletion of certain data or have difficulty identifying the time of attack, but such drawbacks are addressed by the proposed integrity verification process, with only a minor increase in computational load.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Ambient Intelligence and Humanized Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.