Efficient Cyber-Evidence Sharing Using Zero-Knowledge Proofs

被引:0
作者
Zand, Arman [1 ]
Pfluegel, Eckhard [1 ]
机构
[1] Kingston Univ, Kingston Upon Thames, Surrey, England
来源
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON CYBERSECURITY, SITUATIONAL AWARENESS AND SOCIAL MEDIA, CYBER SCIENCE 2022 | 2023年
关键词
Privacy; Cyber evidence; Information sharing; Zero-Knowledge Proofs; IDENTIFICATION;
D O I
10.1007/978-981-19-6414-5_13
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A common challenge for organisations managing confidential customer information is to respect obligations due to legal requirements while advocating the privacy of their users' data. In the context of digital forensics and cyber security scenarios, we define cyber evidence sharing as the task of verifying that mutual knowledge exists about confidential information or digital evidence, without revealing or disclosing the information itself. An attractive cryptographic solution to this problem is the concept of Zero-Knowledge Proofs (ZKPs). In this paper, we propose a flexible and efficient approach for sharing cyber evidence based on using ZKPs. We present a protocol that allows a verifier to establish the proof of knowledge of hash digest information. This provides computational security and can be implemented efficiently using a Merkle-tree data structure. The protocol has been implemented, the resulting proof-of-concept system is evaluated, and its efficiency is demonstrated. We believe that it could be a valuable tool for use in practical real-world applications.
引用
收藏
页码:229 / 242
页数:14
相关论文
共 13 条
  • [1] Zerocash: Decentralized Anonymous Payments from Bitcoin
    Ben-Sasson, Eli
    Chiesa, Alessandro
    Garmant, Christina
    Green, Matthew
    Miers, Ian
    Tromer, Eran
    Virza, Madars
    [J]. 2014 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP 2014), 2014, : 459 - 474
  • [2] Feige U., 1988, Journal of Cryptology, V1, P77, DOI 10.1007/BF02351717
  • [3] HOW TO PROVE YOURSELF - PRACTICAL SOLUTIONS TO IDENTIFICATION AND SIGNATURE PROBLEMS
    FIAT, A
    SHAMIR, A
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1987, 263 : 186 - 194
  • [4] General N.Y.S.A., AG UND ANN REC 148 M
  • [5] Gennaro R, 2013, LECT NOTES COMPUT SC, V7881, P626, DOI 10.1007/978-3-642-38348-9_37
  • [6] On the Size of Pairing-Based Non-interactive Arguments
    Groth, Jens
    [J]. ADVANCES IN CRYPTOLOGY - EUROCRYPT 2016, PT II, 2016, 9666 : 305 - 326
  • [7] Johnson Chris, 2016, NIST special publication, V800, P150
  • [8] Kirejczyk M., 2020, ETHWORKS REPORT ZERO
  • [9] Pinocchio: Nearly Practical Verifiable Computation
    Parno, Bryan
    Howell, Jon
    Gentry, Craig
    Raykova, Mariana
    [J]. 2013 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP), 2013, : 238 - 252
  • [10] Peretti K., 2015, 2015 CYBERSECURITY I