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

DPB-MA: Low-Latency Message Authentication Scheme Based on distributed verification and Priority in Vehicular Ad Hoc Network

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2023年第4期72卷 5152-5166页

作者： Xu, Jiangwei Wang, Liangliang Wen, Mi Long, Yu Chen, Kefei Shanghai Univ Elect Power Coll Comp Sci & Technol Shanghai 201306 Peoples R China Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200000 Peoples R China Hangzhou Normal Univ Hangzhou 310036 Peoples R China

Vehicular ad hoc networks (VANETs) serve as crucial means to ensure safe transportation systems and enhance driving convenience. Ensuring authentication between vehicles and units is the most essential line of defense for VANETs systems. Various schemes of message authentication are put forward to realize safe communication in VANETs. However, these schemes mainly pay attention to privacy and security issues, and are not fit for high-density traffic environments where many messages should be verified by a roadside unit (RSU). At present, achieving the low-latency authentication under the security and privacy of messages remains a critical requirement and challenge. For addressing this problem, this study puts forward a novel low-latency message authentication scheme based on the distributed authentication and message priority (DPB-MA), which can minimize message verification latency through cooperation between the RSU and cooperative vehicles (CVs). In addition, a message priority strategy has been designed to ensure that urgent messages are preferentially verified. According to the security proof with tight reduction, the DPB-MA is existentially unforgeable against adaptive chosen message attack (EU-CMA) in the random oracle model (ROM). Furthermore, our DPB-MA achieves full message aggregation, which also greatly optimizes the communication overhead and authentication efficiency. Performance analysis indicates that our scheme works well in high-density traffic scenarios and is more suitable for securing emergency messages with ultra-low latency requirements.

关键词： Security Authentication Privacy Vehicular ad hoc networks Elliptic curves Accidents Public key Low-latency authentication distributed verification message priority conditional privacy-preserving VANETs

来源：评论

学校读者我要写书评

暂无评论

Heracles: A Novel State-based distributed verification Framework for DNS Configurations 1

Heracles: A Novel State-based Distributed Verification Frame...

引用

Workshop on Formal Methods Aided Network Operation (FMANO)

作者： Hu, Kaiqiang Du, Haizhou Wang, Yao Shanghai Univ Elect Power Shanghai Peoples R China Xiamen Univ Xiamen Peoples R China

ISBN: (纸本)9798400707148

The Domain Name System (DNS) serves as a critical component of the modern Internet infrastructure. However, it is vulnerable to misconfiguration. The existing formal centralized verification methods of DNS configuration need to collect all zone files, which naturally causes a scalability issue for the whole verification process. To address this problem, we propose a novel state-based distributed verification framework for DNS configurations named Heracles. Our key insight is analyzing state transitions in the node of state diagram with a formal method. Our experimental results show that Heracles framework identifies more DNS misconfiguration bugs with a zone file, as well as Heracles uses less verification time than the state-of-the-art in distributed network scenarios.

关键词： DNS configuration verification distributed verification State diagram

来源：评论

学校读者我要写书评

暂无评论

Application of a distributed verification in Islamic microfinance institutions:a sustainable model

引用

Financial Innovation 2022年第1期8卷 2196-2207页

作者： Peter Wanke M.Kabir Hassan Md.Abul Kalam Azad Md.Azizur Rahman Naznin Akther COPPEAD Graduate Business School Federal University of Rio de JaneiroRua Paschoal Lemme355Rio de Janeiro 21949-900Brazil Department of Economics and Finance University of New OrleansNew OrleansLA 70148USA Department of Business and Technology Management Islamic University of TechnologyGazipur 1704Bangladesh Department of Business Administration Faculty of Business&EntrepreneurshipDaffodil International UniversityDhakaBangladesh

The literature gap in microfinance paradox of double bottom line(financial performance ***)has always been an interesting area of *** paper proposes a theoretical model most suitable for Islamic Microfinance Institutions(MFIs)which enables Islamic MFIs’to operate together with the existing financial models compliant with Islamic Shariah *** model is based on a distributed verification/decision-making process that might be realized(but not necessary)through *** the available distributed verification techniques,blockchain technology is an attractive emerging computing paradigm due to its decentralized,immutable,shared,and secure data structure *** model proposes three significant ***,sharing information through blockchain will allow a transparent network in MFI operations,which will raise confidence for donors resulting in a causal effect of a relatively lower profit rate to be charged by the ***,the consensus mechanism will enable risk-sharing,a character of Islamic finance;thus,the MFIs will operate without any collateral for low-risk ***,the double bottom line of MFIs’long-lasting paradox would be *** for practical implication of this proposed model,the causal impact of lower cost investment by the lenders would increase social welfare because of no collateral and no initial wealth *** proposed model proposes a credit rationing approach where profit can be *** collateral will be used when calculating the creditworthiness of a borrower.

关键词： Blockchain Islamic microfinance Double bottom line distributed verification

来源：评论

学校读者我要写书评

暂无评论

distributed verification OF BELIEF PRECISIONS CONVERGENCE IN GAUSSIAN BELIEF PROPAGATION

DISTRIBUTED VERIFICATION OF BELIEF PRECISIONS CONVERGENCE IN...

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Li, Bin Wu, Nan Wu, Yik-Chung Beijing Inst Technol Sch Informat & Elect Beijing Peoples R China Univ Hong Kong Dept Elect & Elect Engn Hong Kong Peoples R China

ISBN: (数字)9781509066315

ISBN: (纸本)9781509066315

Gaussian belief propagation (BP) finds extensive applications in signal processing but it is not guaranteed to converge in loopy graphs. In order to determine whether Gaussian BP would converge, one could directly use the classical convergence conditions of Gaussian BP, such as diagonal dominance, walk-summabilitiy, and convex decomposition. These classical conditions assume that the convergence conditions for Gaussian BP precisions and means are the same, which has been proved to be unnecessary. Generally, the condition for guaranteeing the convergence of Gaussian BP precisions is looser than that of Gaussian BP means. Moreover, the convergence of Gaussian BP means could be improved by damping when Gaussian BP precisions converge. Therefore, the convergence of Gaussian BP precisions is a prerequisite for guaranteeing the convergence of Gaussian BP means. This paper derives a simple convergence condition for Gaussian BP precisions, which can be verified in a distributed way. Through numerical examples, it is found that there exists scenarios where the new condition is satisfied but the classical conditions are not.

关键词： Gaussian belief propagation Convergence analysis Sufficient condition distributed verification

来源：评论

学校读者我要写书评

暂无评论

Beyond a Centralized Verifier: Scaling Data Plane Checking via distributed, On-Device verification 23

Beyond a Centralized Verifier: Scaling Data Plane Checking v...

引用

ACM SIGCOMM Conference (SIGCOMM)

作者： Xiang, Qiao Huang, Chenyang Wen, Ridi Wang, Yuxin Fan, Xiwen Liu, Zaoxing Kong, Linghe Duan, Dennis Le, Franck Sun, Wei Xiamen Univ Xiamen Key Lab Intelligent Storage & Comp Xiamen Peoples R China Univ Maryland College Pk MD 20742 USA Shanghai Jiao Tong Univ Shanghai Peoples R China Yale Univ New Haven CT USA IBM Res Boston MA USA UT Austin Austin TX USA

ISBN: (纸本)9798400702365

Centralized data plane verification (DPV) faces significant scalability issues in large networks ( i.e., the verifier being a performance bottleneck and single point of failure and requiring a reliable management network). We tackle this scalability challenge by introducing Tulkun, a distributed, on-device DPV framework. Our key insight is that DPV can be transformed into a counting problem on a directed acyclic graph, which can be naturally decomposed into lightweight tasks executed at network devices, enabling fast data plane checking in networks of various scales and types. With this insight, Tulkun consists of (1) a declarative invariant specification language, (2) a planner that employs a novel data structure DPVNet to systematically decompose global verification into on-device counting tasks, (3) a distributed verification messaging (DVM) protocol that specifies how on-device verifiers efficiently communicate task results to jointly verify the invariants, and (4) a mechanism to verify invariant fault-tolerance with minimal involvement of the planner. Extensive experiments with real-world datasets (WAN/LAN/DC) show that Tulkun verifies a real, large DC in 41 seconds while others tools need minutes or up to tens of hours, and shows an up to 2355x speed up on 80% quantile of incremental verification with small overhead on commodity network devices.

关键词： Network verification distributed verification

来源：评论

学校读者我要写书评

暂无评论

Network Can Check Itself: Scaling Data Plane Checking via distributed, On-Device verification 21

Network Can Check Itself: Scaling Data Plane Checking via Di...

引用

21st ACM Workshop on Hot Topics in Networks (HotNets)

作者： Xiang, Qiao Wen, Ridi Huang, Chenyang Wang, Yuxin Le, Franck Xiamen Univ Sch Informat Xiamen Peoples R China IKKEM Xiamen Peoples R China IBM Res Yorktown Hts NY USA

ISBN: (纸本)9781450398992

Current data plane verification (DPV) tools employ a centralized architecture, where a server collects the data planes of all devices and verifies them. This architecture is inherently unscalable (i.e., requiring a reliable management network, incurring a long control path and making the server a single point of failure). In this paper, we tackle this scalability challenge of DPV from an architectural perspective. In particular, we circumvent the scalability bottleneck of centralized design and advocate for a distributed, on-device DPV framework. Our key insight is that DPV can be transformed into a counting problem on DAG, which can be naturally decomposed into lightweight tasks executed at network devices, enabling scalability. Evaluation shows that a prototype of this framework achieves scalable DPV under various settings, with little overhead on commodity network devices.

关键词： Network verification distributed verification

来源：评论

学校读者我要写书评

暂无评论

Atlas: Towards Real-Time verification in Large-Scale Networks via a Native distributed Architecture 25

Atlas: Towards Real-Time Verification in Large-Scale Network...

引用

20th European Conference on Computer Systems-EuroSys

作者： Ma, Mingxiao Zhang, Yuehan Wang, Jingyu He, Bo Zhao, Chenyang Qi, Qi Zhuang, Zirui Sun, Haifeng Guo, Lingqi Guo, Yuebin Zhang, Gong Liao, Jianxin Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing Peoples R China Pengcheng Lab Shenzhen Peoples R China E Byte com Chengdu Peoples R China Huawei Technol Shenzhen Peoples R China

ISBN: (纸本)9798400711961

Data plane verification (DPV) can be critical in ensuring the network operates correctly. To be useful in practice, they need to be: (1) fast so as to prevent significant packet loss or security violations;(2) scalable so as to accommodate today's large-scale network architecture. Current DPV tools struggle to meet these requirements due to their centralized architecture. To be concrete, there is a bottleneck for a single-point server to perform real-time DPV tasks. Furthermore, a single-point server makes it hard to collect real-time data plane updates from every device in large-scale networks. This paper proposes Atlas, a native distributed data plane verification (DPV) solution, which systematically solves its scalability problem and improves its real-time performance. To achieve this, (1) Atlas designs a hierarchical distributed architecture for DPV in large-scale networks. (2) Atlas proposes a native approach to maximize the parallelism of the architecture. Both dataset-driven simulation experiments and deployments in the wild demonstrate that Atlas is capable of fast and scalable distributed verification. The advantages offered by Atlas continue to expand as network sizes increase. Compared to state-of-the-art solutions, Atlas is 2-7x faster while keeping each component lightweight.

关键词： Network verification distributed verification

来源：评论

学校读者我要写书评

暂无评论

Rethinking DNS Configuration verification with a distributed Architecture 8

Rethinking DNS Configuration Verification with a Distributed...

引用

8th Asia-Pacific Workshop on Networking (APNET)

作者： Wang, Yao Yu, Kexin Wang, Ziyi Hu, Kaiqiang Du, Haizhou Xiang, Qiao Fang, Xing Li, Geng Zhou, Ruiting Kong, Linghe Shu, Jiwu Xiamen Univ Xiamen Key Lab Intelligent Storage & Comp Xiamen Peoples R China Minjiang Univ Fuzhou Peoples R China Shanghai Univ Elect Power Shanghai Peoples R China Huawei Shenzhen Peoples R China Southeast Univ Nanjing Peoples R China Shanghai Jiao Tong Univ Shanghai Peoples R China

ISBN: (纸本)9798400717581

DNS misconfiguration can result in severe social and financial consequences. Existing DNS configuration verification tools employ a centralized architecture, where all zone files are collected for verification. This architecture faces significant scalability issues (e.g., the verifier becoming the performance bottleneck and not supporting incremental verification). Inspired by the recent proposal of distributed data plane verification and the resemblance between the network data plane and DNS configuration, we propose to rearchitect DNS configuration verification with a distributed design. Our key insight is that by analyzing the query processing behavior of each DNS zone file in parallel and stitching the results in a symbolic way, we can substantially scale up the verification of DNS configuration. Evaluation shows that an up to 9.51x speed up on a dataset with over 410,000 resource records while having small overhead.

关键词： DNS configuration verification distributed verification

来源：评论

学校读者我要写书评

暂无评论

Shared Versus Private Randomness in distributed Interactive Proofs

引用

ALGORITHMICA 2025年第3期87卷 377-404页

作者： Montealegre, Pedro Ramirez-Romero, Diego Rapaport, Ivan Univ Adolfo Ibanez Fac Ingn & Ciencias Santiago Chile Milenium Nucleus Social Data Sci SODAS Santiago Chile Univ Chile Dept Ingn Matemat Santiago Chile Univ Chile CNRS UMI 2807 DIMCMM Santiago Chile

In distributed interactive proofs, the nodes of a graph G interact with a powerful but untrustable prover who tries to convince them, in a small number of rounds and through short messages, that G satisfies some property. This series of rounds is followed by a phase of distributed verification, which may be either deterministic or randomized, where nodes exchange messages with their neighbors. The nature of this last verification round defines the two types of interactive protocols. We say that the protocol is of Arthur-Merlin type if the verification round is deterministic. We say that the protocol is of Merlin-Arthur type if, in the verification round, the nodes are allowed to use a fresh set of random bits. In the original model introduced by Kol, Oshman, and Saxena [PODC 2018], the randomness was private in the sense that each node had only access to an individual source of random coins. Crescenzi, Fraigniaud, and Paz [DISC 2019] initiated the study of the impact of shared randomness (the situation where the coin tosses are visible to all nodes) in the distributed interactive model. In this work, we continue that research line by showing that the impact of the two forms of randomness is very different depending on whether we are considering Arthur-Merlin protocols or Merlin-Arthur protocols. While private randomness gives more power to the first type of protocols, shared randomness provides more power to the second. We also show that there exists at most an exponential gap between the certificate size in distributed interactive proofs with respect to distributed verification protocols without any randomness.

关键词： distributed interactive proofs distributed verification Shared randomness Private randomness

来源：评论

学校读者我要写书评

暂无评论

Local Reasoning and Attribute-Based Memory Updates for Enforcing Global Invariants in Collective Adaptive Systems 12th

Local Reasoning and Attribute-Based Memory Updates for Enfor...

引用

12th International Symposium on Leveraging Applications of Formal Methods, verification and Validation

作者： Pasqua, Michele Miculan, Marino Univ Verona Dept Comp Sci Verona Italy Univ Udine Dept Math Comp Sci & Phys Udine Italy

ISBN: (纸本)9783031751066;9783031751073

We address the problem of enforcing global invariants, i.e., system-level properties, in Collective Adaptive Systems, such as distributed and decentralized Internet of Things (IoT) solutions. In particular, we propose a novel approach adopting Attribute-based memory Updates (AbU), a calculus modeling declarative, event-driven systems with attribute-based communication. Our methodology leverages a combination of precise node-level scheduling and local reasoning, with local invariants derived from the system-level property to guarantee. This distributed and decentralized approach promotes efficient enforcing while ensuring desired system-wide behavior, without the need for a central controlling authority.

关键词： Autonomic systems distributed verification ECA rules

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：