检索结果-南通市图书馆

FCT: a fully-distributed context-aware trust model for location based service recommendation

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2017年第8期60卷 101-116页

作者： Zhiquan LIU Jianfeng MA Zhongyuan JIANG yinbin miao School of Computer Science and Technology Xidian University School of Cyber Engineering Xidian University

With the popularity of location based service(LBS), a vast number of trust models for LBS recommendation(LBSR) have been proposed. These trust models are centralized in essence, and the trusted third party may collude with malicious service providers or cause the single-point failure problem. This work improves the classic certified reputation(CR) model and proposes a novel fully-distributed context-aware trust(FCT)model for LBSR. Recommendation operations are conducted by service providers directly and the trusted third party is no longer required in our FCT model. Besides, our FCT model also supports the movements of service providers due to its self-certified characteristic. Moreover, for easing the collusion attack and value imbalance attack, we comprehensively consider four kinds of factor weights, namely number, time decay, preference and context weights. Finally, a fully-distributed service recommendation scenario is deployed, and comprehensive experiments and analysis are conducted. The results indicate that our FCT model significantly outperforms the CR model in terms of the robustness against the collusion attack and value imbalance attack, as well as the service recommendation performance in improving the successful trading rates of honest service providers and reducing the risks of trading with malicious service providers.

关键词： trust model fully-distributed context-aware location based service service recommendation

Intersection-policy private mutual authentication from authorized private set intersection

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2020年第2期63卷 116-130页

作者： Yamin WEN Fangguo ZHANG Huaxiong WANG yinbin miao Zheng GONG School of Statistics and Mathematics Guangdong University of Finance and Economics State Key Laboratory of Cryptology School of Data and Computer Science Sun Yat-sen University Guangdong Key Laboratory of Information Security Sun Yat-sen University School of Physical and Mathematical Sciences Nanyang Technological University Department of Cyber Engineering Xidian University School of Computer South China Normal University

Private mutual authentication(PMA) enables two-way anonymous authentication between two users certified by the same trusted group authority. Most existing PMA schemes focus on acquiring a relatively onefold authentication policy that ensures affiliation-hiding or designated single-attribute ***, in practice, users are typically provided with multiple attributes. In addition to the affiliation-hiding requirement, how to effectively achieve a more flexible authentication policy for multi-attribute applications remains a challenging issue. The intersection policy for authentication is also required when the attribute intersection is not an empty set or its cardinality is no less than a threshold value. To solve the above problems, we first propose an optimal authorized private set intersection protocol with forward security based on identity-based encryption and then design a new PMA protocol with intersection-policy called IP-PMA, which provides a simple solution for secret handshakes between two members(holding multiple attributes) from the same organization. Formal security analyses proved that our two proposed protocols are secure in the random oracle model. Empirical tests demonstrated that the IP-PMA protocol is optimized with linear complexity and may be more suitable for resource-constrained applications.

关键词： private mutual authentication secret handshake intersection policy authorized private set intersection multi-attribute matching

Auto-scalable and fault-tolerant load balancing mechanism for cloud computing based on the proof-of-work election

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2022年第1期65卷 131-146页

作者： Xiaoqin FENG Jianfeng MA Shaobin LIU yinbin miao Ximeng LIU School of Cyber Engineering Xidian University State Key Laboratory of Cryptology Shaanxi Key Laboratory of Network and System Security Xidian University College of Mathematics and Computer Science Fuzhou University

Load balancing mechanism in technologies such as cloud computing has provided a huge opportunity for the development of large-scale projects. Although the conventional view is to build mechanisms that adopt a dynamic load balancing strategy, existing strategies cannot automatically scale platform(network) servers(nodes) to adapt for dynamic requests, but only guarantee load balancing for the pre-deployed nodes, thereby increasing resource consumption and decreasing networks’ efficiency. We contend that existing load balancing mechanisms are inadequate for deploying dynamic applications. In this regard, we first adopt both load balancing and cloud computing virtualization technologies to modularly design a load balancing mechanism that provides a dynamically auto-scalable solution for large-scale and dynamic computing scenarios. Furthermore, we adopt the proof-of-work consensus, for a novel use during the lifecycle of master nodes in case of system failure caused by a failed master node, to demonstrate a fault-tolerant load balancing mechanism. We theoretically evaluate the security requirement of our mechanism and analyze its performance. Experimental results show that the mechanism supports auto-scalability and has a better performance compared to existing mechanisms such as the ordinary cluster.

关键词： cloud computing load balancing auto-scalable proof-of-work fault-tolerant

VKSE-MO: verifiable keyword search over encrypted data in multi-owner settings

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2017年第12期60卷 192-206页

作者： yinbin miao Jianfeng MA Ximeng LIU Junwei ZHANG Zhiquan LIU School of Cyber Engineering Xidian University School of Information Systems Singapore Management University

Searchable encryption(SE) techniques allow cloud clients to easily store data and search encrypted data in a privacy-preserving manner, where most of SE schemes treat the cloud server as ***, in practice, the cloud server is a semi-honest-but-curious third-party, which only executes a fraction of search operations and returns a fraction of false search results to save its computational and bandwidth resources. Thus, it is important to provide a results verification method to guarantee the correctness of the search results. Existing SE schemes allow multiple data owners to upload different records to the cloud server,but these schemes have very high computational and storage overheads when applied in a different but more practical setting where each record is co-owned by multiple data owners. To address this problem, we develop a verifiable keyword search over encrypted data in multi-owner settings(VKSE-MO) scheme by exploiting the multisignatures technique. Thus, our scheme only requires a single index for each record and data users are assured of the correctness of the search results in challenging settings. Our formal security analysis proved that the VKSE-MO scheme is secure against a chosen-keyword attack under a random oracle model. In addition, our empirical study using a real-world dataset demonstrated the efficiency and feasibility of the proposed scheme in practice.

关键词： chosen-keywork attack efficiency and feasibility multi-owner settings result verification searchable encryption

Puncturable ciphertext-policy attribute-based encryption scheme for efficient and flexible user revocation

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2023年第7期66卷 130-146页

作者： Dilxat GHOPUR Jianfeng MA Xindi MA yinbin miao Jialu HAO Tao JIANG School of Cyber Engineering Xidian University Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Xi'an Satellite Control Center

With the rapid deployment of storage services, secure and efficient user authorization and revocation data shared through the cloud have become a grand challenge hindering cloud data *** previous direct and indirect user revocation schemes implemented large-scale user revocation, they faced heavy communication and computational costs. To address these challenges, this study presents a new encryption scheme that combines ciphertext-policy attribute-based encryption(CP-ABE) with puncturable encryption to achieve efficient and flexible user revocation. We design a proxy server to reduce the computational overhead in the decryption phase. Because the puncture process is performed on a semi-honest cloud, we use the digital signature method to verify the correctness of its operation. Furthermore, we prove the security of our scheme under the chosen-plaintext attack(CPA), and compare it with other schemes to highlight its advantages. Numerical analysis and experimental simulation results reveal that our scheme is more suitable than other schemes for use in a cloud environment for user revocation.

关键词： ciphertext-policy attribute-based encryption puncturable encryption user revocation outsource decryption digital signature

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

基于边缘计算的支持多密钥的加密图像检索

通信学报 2020年第4期41卷 14-26页

作者：李颖莹马建峰苗银宾西安电子科技大学网络与信息安全学院陕西西安710071 陕西省网络与系统安全重点实验室陕西西安710071

针对现有加密图像检索方案未考虑不同密钥加密图像集的情况,基于局部敏感哈希、安全近邻及代理重加密技术提出了基于边缘计算的支持多密钥的加密图像检索系统(包含基础方案和改进方案)。所提方案不但提高了图像查询效率、精度,而且降低... 详细信息

针对现有加密图像检索方案未考虑不同密钥加密图像集的情况,基于局部敏感哈希、安全近邻及代理重加密技术提出了基于边缘计算的支持多密钥的加密图像检索系统(包含基础方案和改进方案)。所提方案不但提高了图像查询效率、精度,而且降低了查询用户的额外计算开销。安全性分析表明,所提基础方案仅可抵抗已知密文攻击,而所提改进方案可抵抗已知背景攻击。基于实际数据集的实验性能测试表明,所提方案在实际应用场景中是可行的。

关键词：多密钥局部敏感哈希代理重加密已知密文攻击已知背景攻击

在线全文

学校读者我要写书评

暂无评论

高效隐私保护的多用户图像外包检索方案

通信学报 2019年第2期40卷 31-39页

作者：王祥宇马建峰苗银宾西安电子科技大学网络与信息安全学院陕西西安710071 陕西省网络与系统安全重点实验室陕西西安710071

传统的隐私保护的图像检索方案会带来较大的计算量和通信开销,且在多用户场景下无法保护图像特征向量和查询请求的隐私。为此,提出了多用户场景下高效隐私保护的基于内容的图像检索方案。该方案利用隐私保护的欧式距离比较技术对图像特... 详细信息

传统的隐私保护的图像检索方案会带来较大的计算量和通信开销,且在多用户场景下无法保护图像特征向量和查询请求的隐私。为此,提出了多用户场景下高效隐私保护的基于内容的图像检索方案。该方案利用隐私保护的欧式距离比较技术对图像特征向量进行相似度排序并返回top-k结果。同时,设计的高效密钥转换协议允许每一个检索用户使用自身的私钥生成查询请求,并检索不同数据拥有者生成的加密图像。安全分析表明,图像检索过程中,用户个人隐私以及云端数据安全都可以得到保护,且基于实际数据集的性能分析表明提出的图像检索方案在实际应用中是高效可行的。

关键词：基于内容的图像检索多用户隐私保护密钥转换协议

在线全文

学校读者我要写书评

暂无评论

基于云计算平台的物联网加密数据比较方案

通信学报 2018年第4期39卷 167-175页

作者：孟倩马建峰陈克非苗银宾杨腾飞西安电子科技大学通信工程学院陕西西安710071 西安电子科技大学计算机学院陕西西安710071 西安电子科技大学网络与信息安全学院陕西西安710071 杭州师范大学理学院浙江杭州310036

已有的短比较加密(SCE,short comparable encryption)方案能在确保物联网数据安全的前提下通过比较密文数据大小而推出明文数据大小。但SCE方案在密文比较以及生成标签的过程中会引入大量的计算和存储开销。为此,提出一种基于滑动窗口... 详细信息

已有的短比较加密(SCE,short comparable encryption)方案能在确保物联网数据安全的前提下通过比较密文数据大小而推出明文数据大小。但SCE方案在密文比较以及生成标签的过程中会引入大量的计算和存储开销。为此,提出一种基于滑动窗口技术统一开窗的高效短比较加密(SCESW,short comparable encryption based on sliding window)方案。严格的安全分析表明,SCESW方案在标准模型下满足弱不可区分性且保障了数据的完整性和机密性。同时,实验性能分析表明,SCESW方案的存储开销是SCE方案的1(t1)t>且效率高于SCE方案。

关键词：短比较加密滑动窗口标准模型弱不可区分性完整性机密性

在线全文

学校读者我要写书评

暂无评论

基于密钥状态散列树的密钥存储管理方案

通信学报 2018年第5期39卷 94-102页

作者：王祥宇马建峰苗银宾张凯伍祈应西安电子科技大学网络与信息安全学院陕西西安710071

针对密文检索系统中多源数据加密带来的海量密钥存储管理问题,提出了以密钥状态散列树作为密钥派生结构的密钥存储管理方案。该方案借助根密钥及密钥派生树进行密钥计算,且只需要存储根密钥和树结构,大大降低了密钥存储开销;另外,该方... 详细信息

针对密文检索系统中多源数据加密带来的海量密钥存储管理问题,提出了以密钥状态散列树作为密钥派生结构的密钥存储管理方案。该方案借助根密钥及密钥派生树进行密钥计算,且只需要存储根密钥和树结构,大大降低了密钥存储开销;另外,该方案可以根据撤销状态值进行密钥撤销管理,解决了派生树密钥撤销及结构更新难题。安全分析表明,部分数据密钥的泄露并不会泄露其他数据机密性,且基于实际数据集的性能分析表明所提密钥管理方案在实际应用中是可行的。

关键词：密钥存储管理密文检索密钥状态散列树密钥撤销