{"title":"改进私有Web搜索中的查询延迟","authors":"Cristina Romero-Tris, Alexandre Viejo, Jordi Castellà-Roca","doi":"10.1109/3PGCIC.2011.61","DOIUrl":null,"url":null,"abstract":"The Internet is a huge repository of information. Web search engines are a basic tool for finding and accessing all this information. However, these tools might also be a threat for the privacy of their users. This happens because users frequently reveal private information in their queries. Web search engines gather this personal data, store it during a large period of time and use it to improve their search results and to increase their economical benefits. In order to avoid this situation, it is necessary to provide web search methods that preserve the privacy of the users. Current proposals in the literature increase significantly the query delay. This is the time that users have to wait in order to obtain the search results for their queries. In this paper, we propose a modification of the Useless User Profile (UUP) protocol. The resulting scheme has been tested in an open environment and the results show that it achieves the lowest query delay which has been reported in the literature. In addition to that, it incentivizes users to follow the protocol in order to protect their privacy.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Improving Query Delay in Private Web Search\",\"authors\":\"Cristina Romero-Tris, Alexandre Viejo, Jordi Castellà-Roca\",\"doi\":\"10.1109/3PGCIC.2011.61\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Internet is a huge repository of information. Web search engines are a basic tool for finding and accessing all this information. However, these tools might also be a threat for the privacy of their users. This happens because users frequently reveal private information in their queries. Web search engines gather this personal data, store it during a large period of time and use it to improve their search results and to increase their economical benefits. In order to avoid this situation, it is necessary to provide web search methods that preserve the privacy of the users. Current proposals in the literature increase significantly the query delay. This is the time that users have to wait in order to obtain the search results for their queries. In this paper, we propose a modification of the Useless User Profile (UUP) protocol. The resulting scheme has been tested in an open environment and the results show that it achieves the lowest query delay which has been reported in the literature. In addition to that, it incentivizes users to follow the protocol in order to protect their privacy.\",\"PeriodicalId\":251730,\"journal\":{\"name\":\"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing\",\"volume\":\"56 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/3PGCIC.2011.61\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/3PGCIC.2011.61","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Internet is a huge repository of information. Web search engines are a basic tool for finding and accessing all this information. However, these tools might also be a threat for the privacy of their users. This happens because users frequently reveal private information in their queries. Web search engines gather this personal data, store it during a large period of time and use it to improve their search results and to increase their economical benefits. In order to avoid this situation, it is necessary to provide web search methods that preserve the privacy of the users. Current proposals in the literature increase significantly the query delay. This is the time that users have to wait in order to obtain the search results for their queries. In this paper, we propose a modification of the Useless User Profile (UUP) protocol. The resulting scheme has been tested in an open environment and the results show that it achieves the lowest query delay which has been reported in the literature. In addition to that, it incentivizes users to follow the protocol in order to protect their privacy.