维普中文期刊产品整合服务
4篇 您的检索式:作者名="Heekuck Oh"
    题名 作者 年代 出处 被引量
1A Designated Query Protocol for Serverless Mobile RFID Systems with Reader and Tag Privacy显示文摘Recently, a new type of Radio Frequency IDentification (RFID) system with mobile readers is introduced. In such a system, it is more desirable for mobile readers to identify tags without a back-end server, and thus it is frequently referred as a serverless mobile RFID system. In this paper, we formalize a serverless mobile RFID system model and propose a new encryption-based system that preserves the privacy of both tags and readers in the model. In addition, we define a new adversary model for the system model and show the security of the proposed system. Throughout comparisons between ours and the other alternatives, we show that our proposed system provides a stronger reader privacy and robustness against a reader forgery attack than the competitors.Jiwhan Lim Sangjin Kim Heekuck Oh Donghyun Kim 2012Tsinghua Science and Technology2012,17,5:4
2Conditional priva- cy preserving security protocol for NFC applications 显示文摘Hasoo Eun Hoonjung Lee Heekuck Oh 2013IEEE Transactions on Consumer Electronics2013,59,1:1
3Efficient anonymous cash using the hash chain 显示文摘Sangjin Kim Heekuck Oh 2003IEICE Transactions on Communications2003,86,3:1
43-Multi ranked encryption with enhanced security in cloud computing显示文摘Searchable Encryption(SE)enables data owners to search remotely stored ciphertexts selectively.A practical model that is closest to real life should be able to handle search queries with multiple keywords and multiple data owners/users,and even return the top-k most relevant search results when requested.We refer to a model that satisfies all of the conditions a 3-multi ranked search model.However,SE schemes that have been proposed to date use fully trusted trapdoor generation centers,and several methods assume a secure connection between the data users and a trapdoor generation center.That is,they assume the trapdoor generation center is the only entity that can learn the information regarding queried keywords,but it will never attempt to use it in any other manner than that requested,which is impractical in real life.In this study,to enhance the security,we propose a new 3-multi ranked SE scheme that satisfies all conditions without these security assumptions.The proposed scheme uses randomized keywords to protect the interested keywords of users from both outside adversaries and the honest-but-curious trapdoor generation center,thereby preventing attackers from determining whether two different queries include the same keyword.Moreover,we develop a method for managing multiple encrypted keywords from every data owner,each encrypted with a different key.Our evaluation demonstrates that,despite the trade-off overhead that results from the weaker security assumption,the proposed scheme achieves reasonable performance compared to extant schemes,which implies that our scheme is practical and closest to real life.YeEun Kim Junggab Son Reza M.Parizi Gautam Srivastava Heekuck Oh 2023Digital Communications and Networks2023,9,2:0
返回顶部 每页显示:
共1页 首页 上一页 第1页 下一页 末页 /1 跳转

网站首页 | 关于我们 | 联系我们 | 产品服务 | 客服中心 | 广告服务 | 版权声明 | 网站联盟 | 友情链接 | 售卡网点

版权所有© 渝B2-20050021-1 渝公网安备 50019002500403号 违法和不良信息举报中心

互联网出版许可证 新出网证(渝)字10号 全国400电话 - 免长途话费