CAJ | 학술논문

在云存储服务中，为使第三方可以验证存储服务提供者持有(保存)用户数据的正确性，且用户的数据不会泄露给第三方，提出一种基于同态哈希函数的隐私保护性公钥审计算法。通过在文件的线性组合中插入一个随机向量的方法，实现用户数据隐私保护，并可同时对多个不同身份标识的文件进行数据持有性证明。分析结果表明，在计算性Diffie-Hellman困难问题假设下，该算法能够抵抗服务器伪造攻击，用户数据的隐私安全依赖于离散对数困难问题，在用户签名和服务器产生证据阶段，算法的计算效率较高。
재운존저복무중，위사제삼방가이험증존저복무제공자지유(보존)용호수거적정학성，차용호적수거불회설로급제삼방，제출일충기우동태합희함수적은사보호성공약심계산법。통과재문건적선성조합중삽입일개수궤향량적방법，실현용호수거은사보호，병가동시대다개불동신빈표식적문건진행수거지유성증명。분석결과표명，재계산성Diffie-Hellman곤난문제가설하，해산법능구저항복무기위조공격，용호수거적은사안전의뢰우리산대수곤난문제，재용호첨명화복무기산생증거계단，산법적계산효솔교고。
In cloud storage, in order to allow Third Party Auditor(TPA) verifying that the storage service providers store the user’s data intactly, while consider the user data information not to be leaked to auditors, a privacy protectiveness public key auditing algorithm based on homomorphic Hash function is proposed. To achieve privacy-preserving public auditing, this paper uniquely integrates the homomorphic linear authenticator with random vector masking to hide linear combination of the data files. It allows a TPA to verify the integrity of data coming from multiple files with different identifier. Analysis results show that under the assumption of hardness of the computation Diffie-Hellman(CDH) problem, this algorithm is proved to be secure against the untrusted server forging attack. It is private against third party under the Discrete Logarithm(DL) problem assumption. This algorithm has a higher computational efficiency in server and the user signature evidence stage.