权益分类	功能权益	普通用户	{{item.name}}会员
{{category.name}}	{{benefitItem.name}}

Secure and reliable communication in distributed systems

分布式系统中安全可靠的通信

基本信息

批准号：
10205203
负责人：
IGARASHI Yoshihide
金额：
$ 5.31万
依托单位：
Gunma University
依托单位国家：
日本
项目类别：
Grant-in-Aid for Scientific Research on Priority Areas (B)
财政年份：
1998
资助国家：
日本
起止时间：
1998 至 2000
项目状态：
已结题

项目摘要

This project is to study the design and analysis of reliable and secure protocols for communication and computation on large scale distributed systems. We proposed some fault tolerant broadcasting schemes in networks, and mutual exclusion algorithms and k-exclusion algorithms on the asynchronous shared memory model. Our mutual exclusion algorithms are improvements of the n-process algorithm by Peterson and the tournament algorithm by Peterson and Fischer. Our k-exclusion algorithms are extensions of our mutual exclusion algorithms. Our algorithms use multi-writer/reader shared variables. This is an unattractive feature, but the structures of the algorithms are simple. The n-exclusion algorithms satisfy not only k-exclusion but also k-lockout avoidance.We proposed the problem of how to transmit an information-theoretic secure bit using random deals of cards among players in hierarchical groups and a computationally unlimited eavesdropper. We also introduced a refined definition of semantic security. The new definition is valid against not only chosen-plaintext attacks but also chosen-ciphertext attacks. We show that semantic security formalized by the new definition is equivalent to indistinguishability, due to Goldwasser and Micali, for each of chosen-plaintext attacks, non-adaptive chosen ciphertext attacks, and adaptive chosen-ciphertext attacks.We constructed a distributed processing system where clients can join or leave whenever they want to do so. We implemented some algorithms for solving the discrete logarithm problem on PVM (Parallel Virtual Machine).

本课题旨在研究大规模分布式系统中可靠、安全的通信与计算协议的设计与分析。提出了一些网络容错广播方案，以及异步共享内存模型上的互斥算法和k-不相容算法。我们的互斥算法是对Peterson的n过程算法和Peterson和Fischer的竞赛算法的改进。我们的k-不相容算法是对互斥算法的扩展。我们的算法使用多写/读共享变量。这是一个没有吸引力的特征，但算法的结构很简单。n-排除算法不仅满足k-排除，而且满足k-锁定避免。我们提出了如何使用分层组中玩家之间的随机发牌和计算无限的窃听者来传输信息论安全位的问题。我们还介绍了语义安全的精细化定义。新定义不仅对选择明文攻击有效，对选择密文攻击也有效。由于Goldwasser和Micali的研究，我们证明了通过新定义形式化的语义安全性对于每一种选择明文攻击、非自适应选择密文攻击和自适应选择密文攻击都等价于不可区分性。我们构建了一个分布式处理系统，客户端可以随时加入或离开。在并行虚拟机上实现了一些离散对数问题的求解算法。