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

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

作者： Luo, Yun-Rong Goel, Aman Sakallah, Karem Univ Michigan Ann Arbor MI 48109 USA Amazon Web Serv Seattle WA USA

ISBN: (纸本)9783031753794;9783031753800

In prior work [13], we introduced a procedure for deriving minimum formulas in first-order logic (FOL) for the reachable states of a restricted class of multi-sorted distributed protocol specifications: protocols with sorts representing unbounded sets of symmetric (indistinguishable) elements. This paper provides a deeper analysis of this idea that yields additional insights about the oft-cited observation that the behavior of such protocols can be inferred from analyzing relatively small finite instances whereby a protocol's behavior becomes invariant, i.e. saturates [24], beyond certain cutoff sizes of its sorts. The paper discusses several issues in previous work [13] and provides more succinct FOL formulas of the reachable states for a collection of common protocols.

关键词： distributed protocols logic minimization invariant inference symmetry quantifier inference reachable states

来源：评论

学校读者我要写书评

暂无评论

distributed protocols for networks with mobile users - The Mobilizer approach

引用

WIRELESS NETWORKS 2001年第1期7卷 21-31页

作者： Mizrachi, B Sidi, M Cidon, I Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel

This paper introduces a novel approach, called Mobilizer, of operating synchronous communication protocols in cellular mobile environment. First, we present a distributed protocol, called Mobile Propagation of Information (MPI), for broadcasting information in mobile environment. Then, we present the Mobile Propagation of Information with Feedback (MPIF) protocol, which can be used to implement the Mobilizer approach, i.e., enable broadcast-based synchronous protocols run over distributed networks with mobile users. We prove the correctness of the protocols and show that the additional message complexity overhead, induced due to the Mobilizer, is linear with the number of users' movements.

关键词： distributed protocols mobile users Mobilizer PIF

来源：评论

学校读者我要写书评

暂无评论

distributed protocols for Interference Management in Cooperative Networks

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2012年第9期30卷 1633-1640页

作者： Hunter, Christopher Sabharwal, Ashutosh Rice Univ Dept Elect & Comp Engn Houston TX 77005 USA

In scenarios where devices are too small to support MIMO antenna arrays, symbol-level cooperation may be used to pool the resources of distributed single-antenna devices to create a virtual MIMO antenna array. We address design fundamentals for distributed cooperative protocols where relays have an incomplete view of network information. A key issue in distributed networks is potential loss in spatial reuse due to the increased radio footprint of flows with cooperative relays. Hence, local gains from cooperation have to balance against network level losses. By using a novel binary network model that simplifies the space over which cooperative protocols must be designed, we develop a mechanism for the systematic and computational development of cooperative protocols as functions of the amount of network state information available at relay nodes. Through extensive network analysis and simulations, we demonstrate the successful application of this method to a series of protocols that span a range of network information availability at cooperative relays.

关键词： Cooperative communications spatial reuse network state information distributed protocols

来源：评论

学校读者我要写书评

暂无评论

distributed protocols at the Rescue for Trustworthy Online Voting 3

Distributed Protocols at the Rescue for Trustworthy Online V...

引用

3rd International Conference on Information Systems Security and Privacy (ICISSP) / International Conference on Security and Cryptography (SECRYPT)

作者： Riemann, Robert Grumbach, Stephane Inria Grenoble Rhone Alpes Lyon France

ISBN: (纸本)9789897582097

While online services emerge in all areas of life, the voting procedure in many democracies remains paper-based as the security of current online voting technology is highly disputed. We address the issue of trustworthy online voting protocols and recall therefore their security concepts with its trust assumptions. Inspired by the Bitcoin protocol, the prospects of distributed online voting protocols are analysed. No trusted authority is assumed to ensure ballot secrecy. Further, the integrity of the voting is enforced by all voters themselves and without a weakest link, the protocol becomes more robust. We introduce a taxonomy of notions of distribution in online voting protocols that we apply on selected online voting protocols. Accordingly, blockchain-based protocols seem to be promising for online voting due to their similarity with paper-based protocols.

关键词： distributed Online Voting Trust distributed protocols Bitcoin

来源：评论

学校读者我要写书评

暂无评论

distributed protocols for Oblivious Transfer and Polynomial Evaluation 24th

Distributed Protocols for Oblivious Transfer and Polynomial ...

引用

24th International Conference on Cryptology in India (INDOCRYPT)

作者： Ben Arie, Aviad Tassa, Tamir Open Univ Israel Raanana Israel

ISBN: (纸本)9783031562341;9783031562358

A secure multiparty computation (MPC) allows several parties to compute a function over their inputs while keeping their inputs private. In its basic setting, the protocol involves only parties that hold inputs. In distributed MPC, there are also external servers who perform a distributed protocol that executes the needed computation, without learning information on the inputs and outputs. Here we propose distributed protocols for several fundamental MPC functionalities. We begin with a distributed Scalar Product (DSP) protocol for computing scalar products of private vectors. We build upon DSP in designing various protocols for Oblivious Transfer (OT): k-out-of-N OT, Priced OT, and Generalized OT. We also use DSP for Oblivious Polynomial Evaluation (OPE) and Oblivious Multivariate Polynomial Evaluation (OMPE). All those problems involve a sender and a receiver that hold private vectors and they wish to compute their scalar product. However, in each of these problems the receiver must submit a vector of a specified form. Hence, a crucial ingredient in our protocols is a sub-protocol for validating that the receiver's vector complies with the relevant restrictions, without learning anything else on that vector. Therefore, while previous studies presented distributed protocols for 1-out-of-N OT and OPE, our protocols are the first ones that are secure against malicious receivers. Our distributed protocols for the other OT variants and for OMPE are the first ones that handle such problems. Our protocols offer information-theoretic security, under the assumption that the servers are semi-honest and have an honest majority, and they are very efficient.

关键词： Multiparty Computation distributed protocols Oblivious Transfer Oblivious Polynomial Evaluation

来源：评论

学校读者我要写书评

暂无评论

The design of novel distributed protocols from differential equations

引用

distributed COMPUTING 2007年第2期20卷 95-114页

作者： Gupta, Indranil Nagda, Mahvesh Devaraj, Christo Frank Univ Illinois Dept Comp Sci Urbana IL 61801 USA Wolverine Asset Management Naperville IL 60564 USA Microsoft Corp Seattle WA 98121 USA

This paper proposes a framework to translate certain subclasses of differential equation systems into practical protocols for distributed systems. The generated protocols are intended for large-scale distributed systems that contain several hundreds to thousands of processes. The synthesized protocols are state machines containing probabilistic transitions and actions, and they are proved to show equivalent stochastic behavior to the original equations. The protocols are probabilistically scalable and reliable, and have practical applications in large-scale distributed systems, e.g., peer to peer systems. In order to illustrate the usefulness of the framework, it is used to generate new solutions for the problems of (a) responsibility migration (giving rise to a novel model of dynamic replication), and (b) majority selection. We present mathematical analysis of these two protocols, and experimental results from our implementations. These two protocols are derived from natural analogies that are represented as differential equations-endemics and the Lotka-Volterra model of competition, respectively. We believe the design framework could be effectively used in transforming, in a very systematic manner, well-known natural phenomena into protocols for distributed systems.

关键词： science of protocol design differential equations distributed protocols scalability reliability replication endemics voting LV probabilistic protocols

来源：评论

学校读者我要写书评

暂无评论

ON THE RELATIVE EXECUTION TIMES OF distributed protocols

引用

INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING 1991年第3期20卷 203-235页

作者： SINGH, G BERNSTEIN, AJ KANSAS STATE UNIV AGR & APPL SCI DEPT COMP & INFORMAT SCIMANHATTANKS 66506 SUNY STONY BROOK DEPT COMP SCISTONY BROOKNY 11794

We provide a formalism for comparing the average execution time of distributed protocols in a manner independent of the properties of the network on which the protocols are executed. The formalism takes into account computation time, the time to transfer information, the time spent by a site waiting to synchronize and the overlap among them. We define transformations on protocols which may change the synchronization structure, the information transferred or the amount of local computation. We show that if a sequence of such transformations can be applied to a protocol to obtain another protocol, then the final protocol runs at least as fast as the initial protocol. Different sets of transformations give rise to different notions of comparison. We develop two such notions and explore their properties. We also give results which relate our notion of protocol transformation to transformational techniques for protocol design.

关键词： distributed protocols SYNCHRONIZATION STRUCTURE EXECUTION TIME PARTIAL ORDER KNOWLEDGE LOGIC

来源：评论

学校读者我要写书评

暂无评论

Mostly Automated Verification of Liveness Properties for distributed protocols with Ranking Functions

引用

PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL 2024年第POPL期8卷 1028-1059页

作者： Yao, Jianan Tao, Runzhou Gu, Ronghui Nieh, Jason Columbia Univ New York NY 10027 USA

distributed protocols have long been formulated in terms of their safety and liveness properties. Much recent work has focused on automatically verifying the safety properties of distributed protocols, but doing so for liveness properties has remained a challenging, unsolved problem. We present LVR, the first framework that can mostly automatically verify liveness properties for distributed protocols. Our key insight is that most liveness properties for distributed protocols can be reduced to a set of safety properties with the help of ranking functions. Such ranking functions for practical distributed protocols have certain properties that make them straightforward to synthesize, contrary to conventional wisdom. We prove that verifying a liveness property can then be reduced to a simpler problem of verifying a set of safety properties, namely that the ranking function is strictly decreasing and nonnegative for any protocol state transition, and there is no deadlock. LVR automatically synthesizes ranking functions by formulating a parameterized function of integer protocol variables, statically analyzing the lower and upper bounds of the variables as well as how much they can change on each state transition, then feeding the constraints to an SMT solver to determine the coefficients of the ranking function. It then uses an off-the-shelf verification tool to find inductive invariants to verify safety properties for both ranking functions and deadlock freedom. We show that LVR can mostly automatically verify the liveness properties of several distributed protocols, including various versions of Paxos, with limited user guidance.

关键词： distributed protocols liveness reasoning ranking function synthesis

来源：评论

学校读者我要写书评

暂无评论

Babel: A Framework for Developing Performant and Dependable distributed protocols 41

Babel: A Framework for Developing Performant and Dependable ...

引用

41st International Symposium on Reliable distributed Systems (SRDS)

作者： Fouto, Pedro Costa, Pedro Akos Preguica, Nuno Leitao, Joao NOVA LINCS Lisbon Portugal NOVA FCT Lisbon Portugal

ISBN: (纸本)9781665497534

Prototyping and implementing distributed algorithms, particularly those that address challenges related with fault-tolerance and dependability, is a time consuming task. This is, in part, due to the need of addressing low level aspects such as management of communication channels, controlling timeouts or periodic tasks, and dealing with concurrency issues. This has a significant impact for researchers that want to build prototypes for conducting experimental evaluation;practitioners that want to compare different design alternatives/solutions;and even for practical teaching activities on distributed algorithms courses. In this paper we present Babel, a novel framework to develop, implement, and execute distributed protocols and systems. Babel promotes an event driven programming and execution model that simplifies the task of translating typical specifications or descriptions of algorithms into performant prototypes, while allowing the programmer to focus on the relevant challenges of these algorithms by transparently handling time consuming low level aspects. Furthermore, Babel provides, and allows the definition of, networking components that can capture different network capabilities (e.g., P2P, Client/Server, (sic)-accrual Failure Detector), making the code mostly independent from the underlying communication aspects. Babel was built to be generic and can be used to implement a wide variety of different classes of distributed protocols. We conduct our experimental work with two relevant case studies, a Peer-to-Peer application and a State Machine Replication application, that show the generality and ease of use of Babel and present competitive performance when compared with significantly more complex implementations.

关键词： distributed protocols Framework P2P Consensus

来源：评论

学校读者我要写书评

暂无评论

Automated Attacker Synthesis for distributed protocols 39th

Automated Attacker Synthesis for Distributed Protocols

引用

39th International Conference on Computer Safety, Reliability and Security (SAFECOMP)

作者： von Hippel, Max Tripakis, Cole Vick Stavros Nita-Rotaru, Cristina Northeastern Univ Boston MA 02118 USA

ISBN: (纸本)9783030545482;9783030545499

distributed protocols should be robust to both benign malfunction (e.g. packet loss or delay) and attacks (e.g. message replay). In this paper we take a formal approach to the automated synthesis of attackers, i.e. adversarial processes that can cause the protocol to malfunction. Specifically, given a formal threat model capturing the distributed protocol model and network topology, as well as the placement, goals, and interface of potential attackers, we automatically synthesize an attacker. We formalize four attacker synthesis problems - across attackers that always succeed versus those that sometimes fail, and attackers that may attack forever versus those that may not - and we propose algorithmic solutions to two of them. We report on a prototype implementation called Korg and its application to TCP as a case-study. Our experiments show that Korg can automatically generate well-known attacks for TCP within seconds or minutes.

关键词： Synthesis Security distributed protocols

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：