检索结果-内蒙古大学图书馆

Dynamic asymmetric group key agreement protocol with traitor traceability

IET INFORMATION SECURITY 2019年第6期13卷 703-710页

作者： Teng, Jikai Ma, Hongyang Qingdao Univ Technol Sch Sci Qingdao 266003 Shadong Peoples R China

In asymmetric group key agreement (ASGKA) protocols, a group of users establish a common encryption key which is publicly accessible and compute pairwise different decryption keys. It is left as an open problem to design an ASGKA protocol with traitor traceability in Eurocrypt 2009. A one-round dynamic authenticated ASGKA protocol with public traitor traceability is proposed in this study. It provides a black-box tracing algorithm. Ind-CPA security with key compromise impersonation resilience (KCIR) and forward secrecy of ASGKA protocols is formally defined. The proposed protocol is proved to be Ind-CPA secure with KCIR and forward secrecy under D k-HDHE assumption. It is also proved that the proposed protocol resists collusion attack. In Setup algorithm and join algorithm, one communication round is required. In Leave algorithm, no message is required to be transmitted. The proposed protocol adopts log N O(logN)-way asymmetric multilinear map to make the size of public key and the size of ciphertext both achieve O log N (logN), where N is the number of potential group members. This is the first ASGKA protocol with public traitor traceability which is more efficient than trivial construction of ASGKA protocols.

关键词： cryptographic protocols common encryption key dynamic authenticated ASGKA protocol public traitor traceability black-box tracing algorithm Ind-CPA security key compromise impersonation resilience protocol resists collusion attack public key dynamic asymmetric group key agreement protocol asymmetric group key agreement protocols pairwise different decryption key computation Eurocrypt 2009 one-round dynamic authenticated ASGKA protoco KCIR forward secrecy D k-HDHE assumption setup algorithm join algorithm leave algorithm

来源：评论

学校读者我要写书评

暂无评论

Multi-Core, Main-Memory joins: Sort vs. Hash Revisited

引用

PROCEEDINGS OF THE VLDB ENDOWMENT 2013年第1期7卷 85-96页

作者： Balkesen, Cagri Alonso, Gustavo Teubner, Jens Oezsu, M. Tamer ETH Syst Grp Zurich Switzerland TU Dortmund Univ Dortmund Germany Univ Waterloo Waterloo ON Canada

In this paper we experimentally study the performance of main-memory, parallel, multi-core join algorithms, focusing on sort-merge and (radix-) hash join. The relative performance of these two join approaches have been a topic of discussion for a long time. With the advent of modern multicore architectures, it has been argued that sort-merge join is now a better choice than radix-hash join. This claim is justified based on the width of SIMD instructions (sort-merge outperforms radix-hash join once SIMD is sufficiently wide), and NUMA awareness (sort-merge is superior to hash join in NUMA architectures). We conduct extensive experiments on the original and optimized versions of these algorithms. The experiments show that, contrary to these claims, radix-hash join is still clearly superior, and sort-merge approaches to performance of radix only when very large amounts of data are involved. The paper also provides the fastest implementations of these algorithms, and covers many aspects of modern hardware architectures relevant not only for joins but for any parallel data processing operator.

关键词： Computer architecture Data handling Software architecture Hardware architecture join algorithm Large amounts of data Multicore architectures Numa architectures Parallel data processing Relative performance SIMD instructions

来源：评论

学校读者我要写书评

暂无评论

Handling data skew in joins based on cluster cost partitioning for MapReduce

引用

MULTIAGENT AND GRID SYSTEMS 2018年第1期14卷 103-123页

作者： Wang, Yang Zhong, Yong Ma, Qingshan Yang, Guanci Chinese Acad Sci Chengdu Inst Comp Applicat Chengdu Sichuan Peoples R China Univ Chinese Acad Sci Beijing Peoples R China Guizhou Univ Minist Educ Key Lab Adv Mfg Technol Guiyang 550025 Guizhou Peoples R China

Data skew in parallel joins results in poor load balancing which can lead to significantly varying execution times for the reducers in MapReduce. The performance of join operation is severely degraded in the presence of heavy skew in the datasets to be joined. Previous work mainly focuses on either input or output load imbalance among reducers, which is ineffective for load balancing. In this paper, we present a new data skew handling method based on Cluster Cost Partitioning (CCP) for optimizing parallel joins in MapReduce. A new cost model which considers the properties of both input and output is defined to estimate the cost of the parallel join. CCP employs clusters instead of join keys from input relations to create join matrix. Using the cost model, CCP identifies and splits heavy cells in the cluster join matrix. Then CCP assigns a set of non-heavy cells to reducers for join load-balancing. For different applications, the input and output weight values in the cost model could be dynamically adjusted to depict the join costs more precisely. The experimental results demonstrate that CCP achieves a more accurate load balancing result among reducers.

关键词： Data skew load balance join algorithm cluster cost partitioning MapReduce

来源：评论

学校读者我要写书评

暂无评论

FAQ: Questions Asked Frequently 16

FAQ: Questions Asked Frequently

引用

35th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS)

作者： Khamis, Mahmoud Abo Ngo, Hung Q. Rudra, Atri LogicBlox Inc New York NY 10011 USA SUNY Buffalo Buffalo NY 14260 USA SUNY Buffalo Comp Sci & Engn Buffalo NY USA

ISBN: (纸本)9781450341912

We define and study the Functional A ggregate Query (FAQ) problem, which encompasses many frequently asked questions in constraint satisfaction, databases, matrix operations, probabilistic graphical models and logic. This is our main conceptual contribution. We then present a simple algorithm called InsideOut to solve this general problem. InsideOut is a variation of the traditional dynamic programming approach for constraint programming based on variable elimination. Our variation adds a couple of simple twists to basic variable elimination in order to deal with the generality of FAQ, to take full advantage of Grohe and Marx's fractional edge cover framework, and of the analysis of recent worst-case optimal relational join algorithms. As is the case with constraint programming and graphical model inference, to make InsideOut run efficiently we need to solve an optimization problem to compute an appropriate variable ordering. The main technical contribution of this work is a precise characterization of when a variable ordering is 'semantically equivalent' to the variable ordering given by the input FAQ expression. Then, we design an approximation algorithm to find an equivalent variable ordering that has the best 'fractional FAQ-width'. Our results imply a host of known and a few new results in graphical model inference, matrix operations, relational joins, and logic. We also briefly explain how recent algorithms on beyond worst-case analysis for joins and those for solving SAT and #SAT can be viewed as variable elimination to solve FAQ over compactly represented input functions.

关键词： join algorithm Quantified conjunctive query Logic Semiring Probabilistic graphical model Constraint satisfaction

来源：评论

学校读者我要写书评

暂无评论

Effectively decreasing the maintenance overhead of highly dynamic Chord system

Effectively decreasing the maintenance overhead of highly dy...

引用

10th International Conference on Advanced Communication Technology

作者： Ren, Xiao-Jin Gu, Zhi-Min Ding, Xiao-Guang Duan, Zhao-Lei Beijing Inst Technol Sch Comp Sci & Technol Beijing 100081 Peoples R China

ISBN: (纸本)9788955191356

P2P systems are highly dynamic in nature. Nodes may join in or leave the P2P system at any moment. Frequently joining or leaving must increase the maintenance overhead greatly in DHT-based P2P system. The main reason of causing the cost is the lookup cost that nodes build their fingers. In this paper we introduce an iterative join algorithm for Chord that is suitable for highly dynamic environments. Iterative join algorithm builds the finger of node by iterative lookup and by the help of fingers information of nodes in the lookup path. Theory analysis and simulation show that Iterative join algorithm decreases efficiently the maintenance overhead and improve the lookup performance.

关键词： P2P iterative join algorithm

来源：评论

学校读者我要写书评

暂无评论

Integration of Big Data for Connected Cars Applications Based on Tethered Connectivity

Integration of Big Data for Connected Cars Applications Base...

引用

7th International Conference on Emerging Ubiquitous Systems and Pervasive Networks (EUSPN) / 6th International Conference on Current and Future Trends of Information and Communication Technologies in Healthcare (ICTH)

作者： Nkenyereye, Lionel Jang, Jong-wook Dong Eui Univ 176 Eomgwangro Busan 614714 South Korea

The wireless communication technologies built-in or brought in the vehicle enable new in-car telematics services. The development of connected cars emphasizes the use of sophisticated computation framework for gathering, analyzing a large volume of data generated in all aspects of vehicle operations using Big Data technologies. Since these data are essential for many connected cars applications, the design and monitoring of MapReduce algorithms for processing vehicle's data using Hadoop framework will allow to build a hosting of analytics data source. This hosting data source allows different connected cars industry ecosystem to access useful data they need to afford connected cars applications. This paper studies design steps to take in consideration when implementing MapReduce patterns to analyze vehicle's data in order to produce accurate useful data that are hosted at the automakers and connect cars services providers. Experiment results show that MapReduce join algorithm is highly scalable and optimized for distributed computing than Statistical Analysis System (SAS) framework and HiveQL declarative language. (C) 2016 The Authors. Published by Elsevier B.V.

关键词： Connected Car remote on-line vehicle diagnostics system MapReduce framework Hadoop Big data join algorithm

来源：评论

学校读者我要写书评

暂无评论

Integration of Big Data for Connected Cars Applications Based on Tethered Connectivity

引用

Procedia Computer Science 2016年 98卷 554-559页

作者： Lionel Nkenyereye Jong-wook Jang Dong-Eui University 176 EomgwangroBusanjin-Gu Busan614-714 Korea

关键词： Connected Car remote on-line vehicle diagnostics system MapReduce framework Hadoop Big data join algorithm

来源：评论

学校读者我要写书评

暂无评论

A Cloud-based Storage and Retrieval Solution for RDF Data

A Cloud-based Storage and Retrieval Solution for RDF Data

引用

作者： Sun Yuxiang Yongju Lee School of Computer Science and Engineering Kyungpook National University

In recent years,RDF(Resource Description Framework) has been widely recognized as a standard data storage *** is a real issue that how to store and retrieve RDF data efficiently,because it is the foundation of all semantic-based application *** this paper,we propose a novel storage and retrieval solution based on cloud and R*-*** to existing approaches,we use cloud-based storage approach to compress RDF data,meanwhile R*-tree is adapted to retrieve compressed *** advantage is that it not only reduces the local storage pressure but also improves the retrieval performance compare to existing *** we separate the storage and retrieval and adapt dictionary-based compression approaches,in terms of security and flexibility,our solution is better than existing approaches.

关键词： Cloud-based Storage RDF Compression Linked Data Indexed Approach join algorithm R*-tree Sorted Lists

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：