当前位置: X-MOL 学术Int. J. Intell. Syst. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
New proofs of ownership for efficient data deduplication in the adversarial conspiracy model
International Journal of Intelligent Systems ( IF 7 ) Pub Date : 2021-03-12 , DOI: 10.1002/int.22400
Meixia Miao 1, 2 , Guohua Tian 2 , Willy Susilo 3
Affiliation  

The primitive of proofs of ownership (PoWs) enables a prover to efficiently convince a verifier that he/she indeed owns a certain message in a knowledge‐proof manner. As a result, it can prevent an adversary who only has a short information of the message from accessing the whole one. We argue that the existing PoWs based on Merkle hash tree and specific encodings are not much efficient if the size of message is sufficiently huge. In this paper, we first propose a new PoW protocol based on the chameleon hash function without key exposure. Interestingly, it is equivalent to having the prover compute a new collision of chameleon hashing as the proof in our construction. Therefore, the proposed protocol is much efficient since the computation and storage overhead of proof is independent of the size of the message. Moreover, we utilize the proposed PoWs to design a deduplication scheme over ciphertext.

中文翻译:

在对抗性阴谋模型中进行有效重复数据删除的新所有权证明

所有权证明(PoW)的原语使证明者可以有效地说服验证者,他/她确实以知识证明的方式拥有特定的消息。结果,它可以防止仅具有消息的简短信息的对手访问整个消息。我们认为,如果消息的大小足够大,则基于Merkle哈希树和特定编码的现有PoW效率不高。在本文中,我们首先提出了一种基于变色龙散列函数的新的PoW协议,该协议没有密钥公开。有趣的是,这等效于让证明者计算变色龙哈希的新碰撞作为我们构造中的证明。因此,所提出的协议非常有效,因为证明的计算和存储开销与消息的大小无关。而且,
更新日期:2021-04-27
down
wechat
bug