The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
정보 중심 네트워킹을 구현하기 위해 IPFS(InterPlanetary File System)는 콘텐츠 자체에 암호화 해시를 적용하여 각 콘텐츠에 대한 고유한 ContentID를 생성합니다. 위조 등의 공격에 대한 보안을 강화할 수 있지만, ContentID의 근접성에는 콘텐츠의 유사성이 반영되지 않기 때문에 IPFS 프레임워크에서는 유사성 검색을 구현하기가 어렵습니다. 이를 극복하기 위해 IPFS에 저장된 인덱스의 키인 콘텐츠에서 추출된 특징 벡터에 LSH(Locality Sensitive Hash)를 적용하는 방법을 제안합니다. 저장된 내용에 해당하는 무작위 포인트 10,000개를 대상으로 실험을 수행한 결과, 무작위로 주어진 쿼리의 절반 이상이 유사성 검색에 대해 비어 있지 않은 결과를 반환하고 일반적인 플러딩의 σ 신뢰구간을 벗어나는 정확한 결과를 산출하는 것으로 나타났습니다. 기반 방법. 이러한 무작위 포인트 모음은 제안된 방식의 최악의 시나리오에 해당합니다. 포인트와 쿼리가 고르지 않은 분포를 따를 때 유사성 검색 성능이 향상될 수 있기 때문입니다.
Satoshi FUJITA
Hiroshima University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Satoshi FUJITA, "Similarity Search in InterPlanetary File System with the Aid of Locality Sensitive Hash" in IEICE TRANSACTIONS on Information,
vol. E104-D, no. 10, pp. 1616-1623, October 2021, doi: 10.1587/transinf.2020EDP7198.
Abstract: To realize an information-centric networking, IPFS (InterPlanetary File System) generates a unique ContentID for each content by applying a cryptographic hash to the content itself. Although it could improve the security against attacks such as falsification, it makes difficult to realize a similarity search in the framework of IPFS, since the similarity of contents is not reflected in the proximity of ContentIDs. To overcome this issue, we propose a method to apply a locality sensitive hash (LSH) to feature vectors extracted from contents as the key of indexes stored in IPFS. By conducting experiments with 10,000 random points corresponding to stored contents, we found that more than half of randomly given queries return a non-empty result for the similarity search, and yield an accurate result which is outside the σ confidence interval of an ordinary flooding-based method. Note that such a collection of random points corresponds to the worst case scenario for the proposed scheme since the performance of similarity search could improve when points and queries follow an uneven distribution.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2020EDP7198/_p
부
@ARTICLE{e104-d_10_1616,
author={Satoshi FUJITA, },
journal={IEICE TRANSACTIONS on Information},
title={Similarity Search in InterPlanetary File System with the Aid of Locality Sensitive Hash},
year={2021},
volume={E104-D},
number={10},
pages={1616-1623},
abstract={To realize an information-centric networking, IPFS (InterPlanetary File System) generates a unique ContentID for each content by applying a cryptographic hash to the content itself. Although it could improve the security against attacks such as falsification, it makes difficult to realize a similarity search in the framework of IPFS, since the similarity of contents is not reflected in the proximity of ContentIDs. To overcome this issue, we propose a method to apply a locality sensitive hash (LSH) to feature vectors extracted from contents as the key of indexes stored in IPFS. By conducting experiments with 10,000 random points corresponding to stored contents, we found that more than half of randomly given queries return a non-empty result for the similarity search, and yield an accurate result which is outside the σ confidence interval of an ordinary flooding-based method. Note that such a collection of random points corresponds to the worst case scenario for the proposed scheme since the performance of similarity search could improve when points and queries follow an uneven distribution.},
keywords={},
doi={10.1587/transinf.2020EDP7198},
ISSN={1745-1361},
month={October},}
부
TY - JOUR
TI - Similarity Search in InterPlanetary File System with the Aid of Locality Sensitive Hash
T2 - IEICE TRANSACTIONS on Information
SP - 1616
EP - 1623
AU - Satoshi FUJITA
PY - 2021
DO - 10.1587/transinf.2020EDP7198
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E104-D
IS - 10
JA - IEICE TRANSACTIONS on Information
Y1 - October 2021
AB - To realize an information-centric networking, IPFS (InterPlanetary File System) generates a unique ContentID for each content by applying a cryptographic hash to the content itself. Although it could improve the security against attacks such as falsification, it makes difficult to realize a similarity search in the framework of IPFS, since the similarity of contents is not reflected in the proximity of ContentIDs. To overcome this issue, we propose a method to apply a locality sensitive hash (LSH) to feature vectors extracted from contents as the key of indexes stored in IPFS. By conducting experiments with 10,000 random points corresponding to stored contents, we found that more than half of randomly given queries return a non-empty result for the similarity search, and yield an accurate result which is outside the σ confidence interval of an ordinary flooding-based method. Note that such a collection of random points corresponds to the worst case scenario for the proposed scheme since the performance of similarity search could improve when points and queries follow an uneven distribution.
ER -