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

k-TEVS: A k-Times E-Voting Scheme on Blockchain With Supervision

IEEE Transactions on Dependable and Secure computing 2025年第3期22卷 2326-2337页

作者： Liu, Yang He, Debiao Luo, Min Wang, Lianhai Peng, Cong Wuhan University School of Cyber Science and Engineering Wuhan430072 China Shenzhen Institute of Information Technology Institute of Information Technology Shenzhen518172 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250014 China Matrix Elements Technologies Shanghai Technology Innovation Centre of Distributed Privacy-Preserving Artificial Intelligence Shanghai200232 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250014 China

Thee-vote is regarded as a waytoexpress the opinion that the voters ask for. Actually, the e-vote could be applied wildly likequestionnaire,***,thecoexistences of efficiency and security as well as transparency and privacy could be considered as building blocks in the e-vote system. The blockchain could provide a public access board to reduce the storagecostsforthefieldconsistedofthevotegroupmanager(GM) with its vote assistants (VA). Particularly the k-times anonymous authentication (k-TAA) could also be a practical approach to pre serve voters’ privacy and reduce the computation costs during the ***,thee-voteschemewithpurek-TAAstrategy could damage either the supervision of voting or the efficiency and consistency of authentication process. What’s more, the impacts of dishonest voters couldn’t be stopped until the vote end. To tackle these problems, we apply the accumulator technology to add or revoke the voters at any time and extend the framework of k-TAA with the update process for the e-vote on blockchain for supervision (k-TEVS). In our scheme, the voter updates his membership witness and proves the fact that he is still a valid member with respective VA under the latest accumulator value. What’s more, this witness update operation is not contained in the authentication process, which means that the authentication process is still constant and efficient. Moreover, our add or delete update process with signature of knowledge needs only one pairing operation. For the security, we prove that the relaxed anonymity still holds in the k-TEVS framework. Finally, We implement k TEVS scheme, the Emura’s work [1] and the Huang’s work [2] for comparison. Then we make time cost and communication cost experiments, which present the feasibility and practicality of this scheme. © 2004-2012 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

ATHENA: An In-vehicle CAN Intrusion Detection Framework Based on Physical Characteristics of Vehicle Systems

arXiv

引用

arXiv 2025年

作者： Wang, Kai Sun, Zhen Wang, Bailing Fan, Qilin Li, Ming Zhang, Hongke School of Computer Science and Technology Harbin Institute of Technology Weihai China Shandong Key Laboratory of Industrial Network Security China School of Big Data and Software Engineering Chongqing University Chongqing China Key Laboratory of Dependable Service Computing in Cyber Physical Society of Ministry of Education Chongqing University Chongqing China Jinan Key Laboratory of Distributed Databases Shandong Inspur Database Technology Co. Ltd Jinan China School of Electronic and Information Engineering Beijing Jiaotong University Beijing China

With the growing interconnection between In-Vehicle networks (IVNs) and external environments, intelligent vehicles are increasingly vulnerable to sophisticated external network attacks. This paper proposes ATHENA, the first IVN intrusion detection framework that adopts a vehicle-cloud integrated architecture to achieve better security performance for the resource-constrained vehicular environment. Specifically, in the cloud with sufficient resources, ATHENA uses the clustering method of multi-distribution mixture model combined with deep data mining technology to generate the raw Payload Rule Bank of IVN CAN messages, and then improves the rule quality with the help of exploitation on the first-principled physical knowledge of the vehicle system, after which the payload rules are periodically sent to the vehicle terminal. At the vehicle terminal, a simple LSTM component is used to generate the Time Rule Bank representing the long-term time series dependencies and the periodic characteristics of CAN messages, but not for any detection tasks as in traditional usage scenarios, where only the generated time rules are the candidates for further IVN intrusion detection tasks. Based on both the payload and time rules generated from cloud and vehicle terminal, ATHENA can achieve efficient intrusion detection capability by simple rule-base matching operations, rather than using complex black-box reasoning of resource-intensive neural network models, which is in fact only used for rule logic generation phase instead of the actual intrusion detection phase in our framework. Comparative experimental results on the ROAD dataset, which is current the most outstanding real-world in-vehicle CAN dataset covering new instances of sophisticated and stealthy masquerade attacks, demonstrate ATHENA significantly outperforms the state-of-the-art IVN intrusion detection methods in detecting complex attacks. We make the code available at https://***/wangkai-tech23/ATHENA. Copyright

关键词： network intrusion

来源：评论

学校读者我要写书评

暂无评论

Dash: A resource browser and help system 91

Dash: A resource browser and help system

引用

19th Annual ACM SIGUCCS Conference on User Services, SIGUCCS 1991

作者： Van Haren, Christopher J. Distributed Computing and Network Services - Applications Group Massachusetts Institute of Technology 1 Amherst Street CambridgeMA02139 United States

ISBN: (纸本)0897914546

Stand-alone Unix workstations are hard to navigate. Ten's, if not hundred's of megabyte of programs are sitting right on your desk. As you add network connectivity and the availability of more services, more applications software, more educational software, and more information resources, it becomes even more difficult to find what you're looking for, or even what types of information are available. DASH was designed to simultaneously provide help and easy access to the growing number of resources available to users of MIT's Project Athena. © 1991 Association for computing Machinery. All rights reserved.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

A New Pipeline for Knowledge Graph Reasoning Enhanced by Large Language Models Without Fine-Tuning

A New Pipeline for Knowledge Graph Reasoning Enhanced by Lar...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Chen, Zhongwu Bai, Long Li, Zixuan Huang, Zhen Jin, Xiaolong Dou, Yong National Key Laboratory of Parallel and Distributed Computing National University of Defense Technology China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9798891761643

Conventional Knowledge Graph Reasoning (KGR) models learn the embeddings of KG components over the structure of KGs, but their performances are limited when the KGs are severely incomplete. Recent LLM-enhanced KGR models input KG structural information into LLMs. However, they require fine-tuning on open-source LLMs and are not applicable to closed-source LLMs. Therefore, in this paper, to leverage the knowledge in LLMs without fine-tuning to assist and enhance conventional KGR models, we propose a new three-stage pipeline, including knowledge alignment, KG reasoning and entity reranking. Specifically, in the alignment stage, we propose three strategies to align the knowledge in LLMs to the KG schema by explicitly associating unconnected nodes with semantic relations. Based on the enriched KGs, we train structure-aware KGR models to integrate aligned knowledge to original knowledge existing in KGs. In the reranking stage, after obtaining the results of KGR models, we rerank the top-scored entities with LLMs to recall correct answers further. Experiments show our pipeline can enhance the KGR performance in both incomplete and general situations. © 2024 Association for Computational Linguistics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Predicting cement compressive strength using double-layer multi-expression programming

Predicting cement compressive strength using double-layer mu...

引用

4th International Conference on Computational and Information Sciences, ICCIS 2012

作者： Zhang, Qingke Yang, Bo Wang, Lin Zhu, Fuxiang Shandong Province Key Laboratory of Network Based Intelligent Computing University of Jinan Jinan China Computer Networks and Distributed Systems Laboratory Beijing Institute Technology Beijing China

ISBN: (纸本)9780769547893

This paper presents a novel algorithm named Double-layer Multi-expression Programming (DMEP). Then DMEP model is applied to the prediction of 28-day Portland cement compressive strength. We compare DMEP model with other four soft computing models, namely Multi-Expression Programming model (MEP), Gene Expression Programming model (GEP), Neural networks model (NN) and Fuzzy logic model (FL) on 28-day cement strength prediction. The experiment results show that DMEP model has a lower rate in RMSE and MAE, and the prediction average percentage error of the cement strength data using DMEP model is reduced to 2.18%, which is lower than other four models. The results obtained from the computational tests demonstrate that DMEP is a promising technique for the prediction of cement strength. © 2012 IEEE.

关键词： Soft computing

来源：评论

学校读者我要写书评

暂无评论

Threshold signature scheme based on non-interactive Diffie-Hellman signature

Threshold signature scheme based on non-interactive Diffie-H...

引用

1st International Conference on networking and distributed computing, ICNDC 2010

作者： Wang, Xiuqun Huang, Lican Key Laboratory for Information System Security Ministry of Education Tsinghua University and Beijing Certification Authority Beijing China Institute of Network and Distributed Computing Zhejiang Sci-Tech University Hangzhou China

ISBN: (纸本)9780769542072

We present a threshold signature based on non-interactive Diffie-Hellman signature. It works in asynchronous communication system and can tolerate Byzantine faults with optimal resiliencen ≥ 3t + 1, where n is the number of the participants and t is the number of the fault participants. The security of this scheme bases on discrete logarithm intractability assumption. We give the security analysis of our proposed threshold signature scheme. © 2010 IEEE.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Modeling and design of notarial system supporting secure transactions in electronic commerce based on the Internet

Modeling and design of notarial system supporting secure tra...

引用

International Conference on Information networking

作者： Sung-Woo Tak Ryu-Seok Bae Jong-Moon Son Distributed Computing Laboratory Network Computing Department Systems Engineering Research Institute Daejeon South Korea

ISBN: (纸本)0818672250

In this paper, we analyze notarial requirements in the electronic commerce based on the Internet and design the notarial system to support secure transactions, which provides the notarial service for assurance of transactions between customer and merchant running shopping mall connected to the Internet. We suggest that electronic commerce should offer not only authentication service but also notarial service in order to provide secure transactions over the Internet.

关键词： Electronic commerce Authentication Web and internet services Access control IP networks distributed computing Cryptography Transaction databases Protocols Intelligent networks

来源：评论

学校读者我要写书评

暂无评论

Secure transmission with artificial noise in heterogeneous massive MIMO network 1st

Secure transmission with artificial noise in heterogeneous m...

引用

1st International Congress on Signal and Information Processing, networking and Computers, ICSINC 2015

作者： Li, Chang Sun, Songlin Liu, Wei Huang, Hai School of Information and Communication Engineering Key Laboratory of Trustworthy Distributed Computing and Service Ministry of Education Beijing University of Posts and Telecommunications Beijing China Department of Network and Platform M2M & Internet of Things Institute China Mobile Research Institute Beijing China

ISBN: (纸本)9781138028814

Heterogeneous network (HetNet) is a promising technology to improve the capacity of future generations of cellular network, in which a mobile station can be served by multiple Base Stations (BSs) with different scales of coverage range, including short range Low Power Nodes (LPNs). In this paper, we study security provisioning in heterogeneous massive Multiple-Input–Multiple-Output (MIMO) systems. Specifically, we consider secure downlink transmission in a massive MIMO system with Matched-Filter (MF) precoding and Artificial Noise (AN) generation at the BS, and transmit the signal to the MT through the LPN in the presence of a passive multi-antenna eavesdropper. Thereby, we consider an AN shaping matrix, where the AN is transmitted in the null-space of the matrix formed by all MT channels. Our analytical and numerical results reveal that, in massive MIMO systems employing MF precoding and AN generation, the Signal-to- Interference-and Noise Ratio (SINR) of intended MTs in LPNs is higher than eavesdropper, we can also obtain the positive secrecy capacity which prove this method can guarantee the secure transmission. © 2016 Taylor & Francis Group, London.

关键词： Heterogeneous networks

来源：评论

学校读者我要写书评

暂无评论

Achieving both high precision and high recall in near-duplicate detection

Achieving both high precision and high recall in near-duplic...

引用

17th ACM Conference on Information and Knowledge Management, CIKM'08

作者： Huang, Lian'en Wang, Lei Li, Xiaoming Institute of Network Computing and Distributed Systems Peking University Beijing 100871 China Shenzhen Graduate School of Peking University Shenzhen Guangdong 518055 China State Key Laboratory of Advanced Optical Communication Systems and Networks Peking University Beijing 100871 China

ISBN: (纸本)9781595939913

To find near-duplicate documents, fingerprint-based para-digms such as Broder's shingling and Charikar's simhash algorithms have been recognized as effective approaches and are considered the state-of-the-art. Nevertheless, we see two aspects of these approaches which may be improved. First, high score under these algorithms' similarity measurement implies high probability of similarity between documents, which is different from high similarity of the documents. But how similar two documents are is what we really need to know. Second, there has to be a tradeoff between hash-code length and hash-code multiplicity in fingerprint paradigms, which makes it hard to maintain a satisfactory recall level while improving precision. In this paper our contributions are two-folded. First, we propose a framework for implementing the longest common subsequence (LCS) as a similarity measurement in reason-able computing time, which leads to both high precision and recall. Second, we present an algorithm to get a trustable partition from the LCS to reduce the negative impact from templates used in web page design. A comprehensive exper-iment was conducted to evaluate our method in terms of its effectiveness, efficiency, and quality of result. More specifi-cally, the method has been successfully used to partition a set of 430 million web pages into 68 million subsets of simi-lar pages, which demonstrates its effectiveness. For quality, we compared our method with simhash and a Cosine-based method through a sampling process (Cosine is compared to LCS as an alternative similarity measurement). The result showed that our algorithm reached an overall precision of 0.95 while simhash was 0.71 and Cosine was 0.82. At the same time our method obtains 1.86 times as much recall as simhash and 1.56 times as much recall as Cosine. Compar-ison experiment was also done for documents in the same web sites. For that, our algorithm, simhash and Cosine find almost the same number of true-positives at

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

A Lightweight execution framework for massive independent tasks

A Lightweight execution framework for massive independent ta...

引用

2008 Workshop on Many-Task computing on Grids and Supercomputers, MTAGS 2008

作者： Hui, Li Huashan, Yu Xiaoming, Li Shenzhen Graduate School of Peking University Shenzhen Guangdong 518055 P.R. China Institute of Network Computing and Distributed System Peking University Beijing 100871 P.R. China State Key Laboratory of Advanced Optical Communication and Network Peking University Beijing 100871 P.R. China

ISBN: (纸本)9781424428724

This paper presents a lightweight framework for executing many independent tasks efficiently on grids of heterogeneous computational nodes. It dynamically groups tasks of different granularities and dispatches the groups onto distributed computational resources concurrently. Three strategies have been devised to improve the efficiency of computation and resource utilization. One strategy is to pack up to thousands of tasks into one request. Another is to share the effort in resource discovery and allocation among requests by separating resource allocations from request submissions. The third strategy is to pack variable numbers of tasks into different requests, where the task number is a function of the destination resource's computability. This framework has been implemented in Gracie, a computational grid software platform developed by Peking University, and used for executing bioinformatics tasks. We describe its architecture, evaluate its strategies, and compare its performance with GRAM. Analyzing the experiment results, we found that Gracie outperforms GRAM significantly for execution of sets of small tasks, which is aligned with the intuitive advantage of our approaches built in Gracie.

关键词： Resource management distributed computing Grid computing Bioinformatics Processor scheduling Computer networks Optical computing Supercomputers Parallel processing Laboratories

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：