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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

SAT-Based Quantified Symmetric Minimization of the Reachable States of distributed protocols: An Update 12th

SAT-Based Quantified Symmetric Minimization of the Reachable...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Synthesis of distributed protocols from scenarios and specifications

Synthesis of distributed protocols from scenarios and specif...

引用

作者： Udupa, Abhishek University of Pennsylvania

学位级别：Ph.D.

distributed protocols, typically expressed as stateful agents communicating asynchronously over buffered communication channels, are difficult to design correctly. This difficulty has spurred decades of research in the area of automated model-checking algorithms. In turn, practical implementations of model-checking algorithms have enabled protocol developers to prove the correctness of such distributed protocols. However, model-checking techniques are only marginally useful during the actual development of such protocols; typically as a debugging aid once a reasonably complete version of the protocol has already been developed. The actual development process itself is often tedious and requires the designer to reason about complex interactions arising out of concurrency and asynchrony inherent to such protocols. In this dissertation we describe program synthesis techniques which can be applied as an enabling technology to ease the task of developing such protocols. Specifically, the programmer provides a natural, but incomplete description of the protocol in an intuitive representation — such as scenarios or an incomplete protocol. This description specifies the behavior of the protocol in the common cases. The programmer also specifies a set of high-level formal requirements that a correct protocol is expected to satisfy. These requirements can include safety requirements as well as liveness requirements in the form of Linear Temporal Logic (LTL) formulas. We describe techniques to synthesize a correct protocol which is consistent with the common-case behavior specified by the programmer and also satisfies the high-level safety and liveness requirements set forth by the programmer. We also describe techniques for program synthesis in general, which serve to enable the solutions to distributed protocol synthesis that this dissertation explores.

关键词： distributed protocols Program Synthesis

来源：评论

学校读者我要写书评

暂无评论

Type-3 Fuzzy Data-Driven Control of Heterogeneous Multi-Agent Systems

引用

IEEE ACCESS 2025年 13卷 32306-32319页

作者： Liang, Yaqing Tian, Man-Wen Du, Changdong Alattas, Khalid A. Fekih, Afef Mohammadzadeh, Ardashir Nanjing Agr Univ Sch Econ & Management Nanjing 210095 Peoples R China Guangdong Univ Sci & Technol Sch Management Dongguan 523083 Peoples R China Shenyang Univ Technol Sch Artificial Intelligence Shenyang 110870 Peoples R China Univ Jeddah Dept Comp Sci & Artificial Intelligence Jeddah 23218 Saudi Arabia Univ Louisiana Lafayette Dept Elect & Comp Engn Lafayette LA 70504 USA Sakarya Univ Fac Engn Dept Elect & Elect Engn TR-54050 Sakarya Turkiye

This study investigates the data-based consensus problem of discrete-time heterogeneous multi-agent systems (MASs) through the development of distributed protocols. A type-3 (T3) fuzzy logic system (FLS) is presented to effectively model the inherent nonlinearities present in MASs, allowing for more accurate representation of agent dynamics. Utilizing a Lyapunov stability approach alongside a linear matrix inequalities (LMIs) framework, the sufficient conditions are derived for designing the data-driven distributed control protocols. The results ensure that the consensus error dynamics are asymptotically stable, thereby guaranteeing the achievement of consensus among agents. Furthermore, the optimal linear quadratic regulator (LQR) problem is addressed within the context of heterogeneous MASs, providing an additional layer of control performance optimization. Also, the design procedure is analyzed under conditions of noisy data, which is critical for real-world applications where sensor inaccuracies are prevalent. To validate the theoretical findings, extensive simulations are conduced that showcase the effectiveness and robustness of the proposed methods. The implementation is demonstrated on a network comprising four multiple autonomous underwater vehicles (AUVs), hyper-chaotic systems, and various configurations of discrete-time MASs. The results highlight the advantages of suggested data-driven control approach, emphasizing its practicality and efficiency in achieving consensus in complex multi-agent environments. This work paves the way for future research in robust control strategies for heterogeneous physical and financial systems operating under uncertainty. For example, by the use of the suggested data-driven approach to achieve consensus among heterogeneous agents, the financial institutions can enhance their decision-making processes, and optimize performance under uncertainty.

关键词： Uncertainty Linear matrix inequalities Vehicle dynamics Noise measurement Fuzzy logic protocols Predictive control Quality control Optimization Synchronization Data-driven control heterogeneous multi-agent physical and financial systems distributed protocols LQR problem noisy data

来源：评论

学校读者我要写书评

暂无评论

Fresh-CSMA: A distributed Protocol for Minimizing Age of Information

引用

JOURNAL OF COMMUNICATIONS AND NETWORKS 2023年第5期25卷 556-569页

作者： Tripathi, Vishrant Jones, Nicholas Modiano, Eytan MIT Lab Informat & Decis Syst LIDS Cambridge MA 02139 USA

consider the design of distributed scheduling algorithms that minimize age of information (AoI) in single-hop wireless networks. The centralized max-weight policy is known to be nearly optimal in this setting;hence, our goal is to design a distributed carrier sense multiple access (CSMA) scheme that can mimic its performance. To that end, we propose a distributed protocol called Fresh-CSMA and show that in an idealized setting, Fresh-CSMA can match the scheduling decisions of the max-weight policy with high probability in each frame, and also match the theoretical performance guarantees of the max-weight policy over the entire time horizon. We then consider a more realistic setting and study the impact of protocol parameters on the probability of collisions and the overhead caused by the distributed nature of the protocol. We also consider the monitoring of Markov sources and extend our approach to CSMA protocols that incorporate age of incorrect information (AoII) instead of AoI. Finally, we provide simulations that support our theoretical results and show that the performance gap between the ideal and realistic versions of Fresh-CSMA is small.

关键词： Age of information distributed protocols scheduling wireless networks

来源：评论

学校读者我要写书评

暂无评论

On Min-Max Storage for Resource-Restricted Clients in Coded Blockchain Systems

引用

IEEE INTERNET OF THINGS JOURNAL 2023年第20期10卷 17988-17999页

作者： Yang, Changlin Wang, Xiaodong Jiang, Zigui Liu, Ying Lin, Fengnian Zheng, Zibin Sun Yat Sen Univ Sch Software Engn Zhuhai 519000 Guangdong Peoples R China Columbia Univ Elect Engn Dept New York NY 10027 USA

Blockchain is the foundation of emerging applications, such as smart contracts, nonfungible token (NFT), and metaverse. A key issue is that blockchain requires massive storage space, which limits its deployment in resource-limited end devices, e.g., Internet of Things. Recently, coded blockchain is proposed to reduce the storage requirement of blockchain while guaranteeing its security and data integrity. Coded blockchain encodes blocks into coded symbols, which are then distributively stored by clients. A key challenge when applying coded blockchain in resource-restricted networks is to ensure all clients store the same, and also the minimum, number of coded blocks. To this end, this article addresses a novel problem that minimizes the maximum (min-max) storage requirement of clients. It formulates the said problem as an integer linear program (ILP). It then proposes centralized algorithms to improve the computational efficiency of storage assignments. Moreover, it presents distributed algorithms that satisfy the distributive property of blockchain. Numerical results show that the proposed distributed algorithm with a short length code reduces the min-max storage of clients by 80% compared with traditional blockchain. In addition, the computational complexity of distributed algorithms is significantly lower than centralized algorithms.

关键词： Coded blockchain distributed protocols min- max storage resource-restricted clients storage assignments

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：