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-Oxclusion算法。我们的相互排斥算法是Peterson的N-Process算法的改进以及Peterson和Fischer的《锦标赛算法》。我们的K排斥算法是我们相互排除算法的扩展。我们的算法使用多作者/读取器共享变量。这是一个没有吸引力的功能，但是算法的结构很简单。 N-限制算法不仅满足K-批准，而且满足K-lockout的回避。我们提出了如何使用层次组和计算无限的窃听器中的玩家之间的随机交易来传输信息理论安全位的问题。我们还介绍了语义安全性的精致定义。新的定义不仅有效，不仅可以选择plaintext攻击，而且还选择了ciphertext攻击。我们表明，由于Goldwasser和Micali，通过新定义形式化的语义安全性等于无法区分性，对于所选的plaintext攻击，非自适应选择的无适量的密文量攻击以及适应性选择的ciphertext攻击，以及我们构建的分布式处理系统，可以随时随地加入或离开时，他们都可以构建分布式处理系统。我们实施了一些算法来求解PVM（并行虚拟机）上的离散对数问题。