对等网中数据管理的容错技术研究
|
摘要
对等网环境中节点动态性高、可靠性低的特点使得其中的数据管理必须考虑容错。对等网领域早期的数据容错研究集中在数据的可用性与持久性上,主要讨论数据存储、定位与查询的容错技术,包括网络拓扑结构、消息路由算法、数据编码方式、分发策略、恢复时机等等。随着对等网及其应用的不断发展,其中的数据管理需求也由数据传输、定位、查询、可靠存储逐渐拓展至数据一致性、正确性与保密性的维护。针对对等网络中数据管理的新需求,分析了对等网数据管理所遇到的挑战,研究了对等网中副本更新、并发控制与密钥保护的容错技术,提出了对应的解决方案。
针对数据副本的更新问题,提出了一个副本一致性管理框架。该框架提供一组相容的读写协议,由弱至强分别保证副本操作的安全一致性、正规一致性与线性一致性。允许应用在数据一致性与性能之间进行自主权衡,并允许应用动态调整数据的一致性级别。通过混合失效模型,既实现了对拜占庭失效的容错,又有效的降低了系统容错所需的节点数量与存储空间。在操作无冲突时使用Quorum系统实现容错,检测到副本状态不一致后切换至状态机方式工作,各服务节点间协商确定数据的正确状态,使副本重新一致。该框架既拥有Quorum系统消息数少、操作响应快、节点负载低的优点,同时也具备状态机方法在争用频繁时性能稳定的特点,可明显改善系统的可伸缩性,减少系统的容错开销,能较好的应用于对等网环境。
为支持涉及多数据对象的复杂事务,提出了一组高效可靠的数据访问协议,实现了对等网中容错的并发控制。首先,针对良性失效环境下的对等网络提出了健忘失效模型,更准确的描述了失效节点的行为特征。其次,使用对象的管理节点维护涉及该对象的事务信息,客户节点通过管理节点获取与其发生争用的节点信息,并主动与之协商解决争用问题,在缺少全局的事务协调者的网络环境中实现了并发控制。再次,使用组播树的方式对请求进行多播,有效减少了单次操作的网络开销。接着,通过为请求设立租期的方式,有效实现了对客户节点失效的容错。基于封锁的悲观并发控制协议在当前拥有封锁的节点上维护封锁队列,释放封锁的同时即申请新的封锁请求,在高负载环境下表现出稳定的性能。在争用协调的同时以边界跟踪的方式检测死锁,当发现潜在的死锁环后使用路径推动算法在候选节点间确定死锁,减少死锁检测时间的同时限制了解决死锁的网络开销。基于版本的乐观并发控制协议利用同一事务所产生的对象版本号在不同对象的不同版本间建立逻辑上的先后关系,并以其为基础推理事务之间的依赖关系,实现了事务并发执行的亚可串行化。
针对对等网中密钥信息存储问题,提出了一个基于身份的动态安全的多秘密共享方案,并对其正确性与安全性进行了分析与证明。首先,使用基于身份的公钥密码系统避免了公钥与实体身份的绑定问题。其次,通过联合秘密共享与密钥协商算法将管理节点的功能分布至一组节点上予以实现。再次,构造公开可验证的加密与零知识证明,有效的对抗了成员欺骗,去除了对可信第三方的要求。最后,采用多副本形式管理系统参数与组参数,使完成任何操作均只需门限个诚实节点即可,且无需同时在线。方案允许动态的添加与移除成员、动态的改变系统门限值并周期性的变换成员子密钥,从而更加充分的利用网络资源、提供更高的安全性与可用性。方案中加密完全在本地完成不产生任何消息,使得多个秘密共享可并行的进行。通过重用组参数,每次秘密重构所需的消息开销达到了理论最优值。
理论分析与模拟实验表明提出的解决方案增强了对等网中副本更新、并发控制与密钥保护的容错能力,完善了对等网基础结构。
Nodes are highly volatile and have relatively low reliability in P2P (Peer-to-Peer networks) environment, which makes it necessary to consider fault tolerance in P2P data management. The early studies of fault-tolerant technologies in P2P data management field focus on data availability and durability, and are mainly about data storage, data locating and query, including network topology, message routing, redundant coding, replica distribution strategy, replica recover strategy, etc. With the development of P2P and its applications, the demands of P2P data management have gradually expanded from data transmission, data locating, query and reliable storage to the maintenance of data consistency, data correctness and data security. In order to fulfill these new demands, the challenges of P2P data management are analyzed; the researches on replica update, concurrency control and key protection fault-tolerant technologies are conducted, and corresponding solutions are presented.
A replica consistency management framework is proposed to address the replica update problem. The framework offers a stack of compatible read/write protocols which grantee safe consistency, regular consistency and linearizability respectively. Applications can autonomously balance between data consistency and system performance, and dynamically adjust data consistency level. Hybrid failure model is used to reduce the node number and storage space required for fault-tolerance while maintaining fault-tolerance capacity of Byzantine failure. The framework uses Quorum system to implement fault tolerance in absence of contention and switches to SMR (State Machine Replication) whenever replica inconsistency is detected. So, by service-nodes agreement the replicas will be in consensus again. The framework not only has the advantages of a Quorum system's, namely fewer messages, shorter operation time and lower loads, but also shows stable performance under heavy contentions just like a SMR does. Those characteristics would improve system scalability and reduce the systems' fault-tolerant overhead. Therefore, the proposed framework suits P2P environment well.
To support transactions with multiple objects involved and achieve fault-tolerant concurrency control, a group of efficient and reliable data access protocols are proposed. Firstly, a forgetfulness failure model is proposed to describe the node's behavior more accurately in a benign failure P2P environment. Secondly, information of transactions which are accessing the object is managed by object's manager nodes for the lack of global transaction coordinators. By asking the manager nodes of the object that it wants to access, a client node detects contention and takes the initiative to negotiate with its competitors. Thirdly, Q-RPC (Quorum Remote Procedure Call) is implemented by multicast tree, which effectively reduces the message overhead of a single operation. Finally, fault-tolerance of any client node failure is achieved by assigning a lease to each request. The lock-based pessimistic concurrency control protocol maintains lock queue on the client node that currently locks the target object. The first request in the queue will be sent out while releasing the lock, which results in a stable performance in high load situations. Deadlock detecting by the Edge-Chasing algorithm will start as soon as contention coordinating begins. When a potential deadlock ring is detected, Path-Pushing algorithm is used to resolve it between nodes on the ring. The latency of deadlock detection and message overhead of deadlock solving are both kept in check by combining those two algorithms. Version-based optimistic concurrency control protocol uses the version numbers created in the same transaction to establish the logical relations between different versions of different objects, based on which the dependencies between transactions can be deduced. It helps to achieve Hypo-Serializable.
An identity-based dynamic-safe MSS (Multiple Secret Sharing) scheme is constructed for the key protection tasks, and its security properties, as well as its correctness, are proved. Firstly, the binding problem of subject identity and its public key is avoided by using identity-based public key cryptography. Secondly, the services usually provided by the Dealer are implemented by a group of nodes through JSS (Joint Secret Sharing) and key agreement algorithms. Thirdly, member cheating can be effectively detected by constructing publicly verifiable encryptions and zero-knowledge proofs; therefore a TTP (Trusted Third Party) is not needed any more. Finally, system parameters and group parameters are managed by the replica consistency management framework proposed above; this allows a threshold of honest nodes to complete any operations even if not all of them are online at any moment. The resulting MSS scheme allows dynamically changing participants and the system threshold parameters, and periodically changing the members' key share, which results in a more sufficient use of network resources and enhances system security and availability. Encryption process is entirely local and no message is created, which makes secret sharing could be carried out in parallel. By the reuse of group parameters, the message overhead in each secret reconstruction reaches the optimal value.
Theoretical analysis and simulation experiments show that the proposed solutions can fortify fault-tolerant capability of replica update, concurrency control and key protection in P2P, and therefore improve data consistency, data correctness and data security in P2P infrastructure.
针对数据副本的更新问题,提出了一个副本一致性管理框架。该框架提供一组相容的读写协议,由弱至强分别保证副本操作的安全一致性、正规一致性与线性一致性。允许应用在数据一致性与性能之间进行自主权衡,并允许应用动态调整数据的一致性级别。通过混合失效模型,既实现了对拜占庭失效的容错,又有效的降低了系统容错所需的节点数量与存储空间。在操作无冲突时使用Quorum系统实现容错,检测到副本状态不一致后切换至状态机方式工作,各服务节点间协商确定数据的正确状态,使副本重新一致。该框架既拥有Quorum系统消息数少、操作响应快、节点负载低的优点,同时也具备状态机方法在争用频繁时性能稳定的特点,可明显改善系统的可伸缩性,减少系统的容错开销,能较好的应用于对等网环境。
为支持涉及多数据对象的复杂事务,提出了一组高效可靠的数据访问协议,实现了对等网中容错的并发控制。首先,针对良性失效环境下的对等网络提出了健忘失效模型,更准确的描述了失效节点的行为特征。其次,使用对象的管理节点维护涉及该对象的事务信息,客户节点通过管理节点获取与其发生争用的节点信息,并主动与之协商解决争用问题,在缺少全局的事务协调者的网络环境中实现了并发控制。再次,使用组播树的方式对请求进行多播,有效减少了单次操作的网络开销。接着,通过为请求设立租期的方式,有效实现了对客户节点失效的容错。基于封锁的悲观并发控制协议在当前拥有封锁的节点上维护封锁队列,释放封锁的同时即申请新的封锁请求,在高负载环境下表现出稳定的性能。在争用协调的同时以边界跟踪的方式检测死锁,当发现潜在的死锁环后使用路径推动算法在候选节点间确定死锁,减少死锁检测时间的同时限制了解决死锁的网络开销。基于版本的乐观并发控制协议利用同一事务所产生的对象版本号在不同对象的不同版本间建立逻辑上的先后关系,并以其为基础推理事务之间的依赖关系,实现了事务并发执行的亚可串行化。
针对对等网中密钥信息存储问题,提出了一个基于身份的动态安全的多秘密共享方案,并对其正确性与安全性进行了分析与证明。首先,使用基于身份的公钥密码系统避免了公钥与实体身份的绑定问题。其次,通过联合秘密共享与密钥协商算法将管理节点的功能分布至一组节点上予以实现。再次,构造公开可验证的加密与零知识证明,有效的对抗了成员欺骗,去除了对可信第三方的要求。最后,采用多副本形式管理系统参数与组参数,使完成任何操作均只需门限个诚实节点即可,且无需同时在线。方案允许动态的添加与移除成员、动态的改变系统门限值并周期性的变换成员子密钥,从而更加充分的利用网络资源、提供更高的安全性与可用性。方案中加密完全在本地完成不产生任何消息,使得多个秘密共享可并行的进行。通过重用组参数,每次秘密重构所需的消息开销达到了理论最优值。
理论分析与模拟实验表明提出的解决方案增强了对等网中副本更新、并发控制与密钥保护的容错能力,完善了对等网基础结构。
Nodes are highly volatile and have relatively low reliability in P2P (Peer-to-Peer networks) environment, which makes it necessary to consider fault tolerance in P2P data management. The early studies of fault-tolerant technologies in P2P data management field focus on data availability and durability, and are mainly about data storage, data locating and query, including network topology, message routing, redundant coding, replica distribution strategy, replica recover strategy, etc. With the development of P2P and its applications, the demands of P2P data management have gradually expanded from data transmission, data locating, query and reliable storage to the maintenance of data consistency, data correctness and data security. In order to fulfill these new demands, the challenges of P2P data management are analyzed; the researches on replica update, concurrency control and key protection fault-tolerant technologies are conducted, and corresponding solutions are presented.
A replica consistency management framework is proposed to address the replica update problem. The framework offers a stack of compatible read/write protocols which grantee safe consistency, regular consistency and linearizability respectively. Applications can autonomously balance between data consistency and system performance, and dynamically adjust data consistency level. Hybrid failure model is used to reduce the node number and storage space required for fault-tolerance while maintaining fault-tolerance capacity of Byzantine failure. The framework uses Quorum system to implement fault tolerance in absence of contention and switches to SMR (State Machine Replication) whenever replica inconsistency is detected. So, by service-nodes agreement the replicas will be in consensus again. The framework not only has the advantages of a Quorum system's, namely fewer messages, shorter operation time and lower loads, but also shows stable performance under heavy contentions just like a SMR does. Those characteristics would improve system scalability and reduce the systems' fault-tolerant overhead. Therefore, the proposed framework suits P2P environment well.
To support transactions with multiple objects involved and achieve fault-tolerant concurrency control, a group of efficient and reliable data access protocols are proposed. Firstly, a forgetfulness failure model is proposed to describe the node's behavior more accurately in a benign failure P2P environment. Secondly, information of transactions which are accessing the object is managed by object's manager nodes for the lack of global transaction coordinators. By asking the manager nodes of the object that it wants to access, a client node detects contention and takes the initiative to negotiate with its competitors. Thirdly, Q-RPC (Quorum Remote Procedure Call) is implemented by multicast tree, which effectively reduces the message overhead of a single operation. Finally, fault-tolerance of any client node failure is achieved by assigning a lease to each request. The lock-based pessimistic concurrency control protocol maintains lock queue on the client node that currently locks the target object. The first request in the queue will be sent out while releasing the lock, which results in a stable performance in high load situations. Deadlock detecting by the Edge-Chasing algorithm will start as soon as contention coordinating begins. When a potential deadlock ring is detected, Path-Pushing algorithm is used to resolve it between nodes on the ring. The latency of deadlock detection and message overhead of deadlock solving are both kept in check by combining those two algorithms. Version-based optimistic concurrency control protocol uses the version numbers created in the same transaction to establish the logical relations between different versions of different objects, based on which the dependencies between transactions can be deduced. It helps to achieve Hypo-Serializable.
An identity-based dynamic-safe MSS (Multiple Secret Sharing) scheme is constructed for the key protection tasks, and its security properties, as well as its correctness, are proved. Firstly, the binding problem of subject identity and its public key is avoided by using identity-based public key cryptography. Secondly, the services usually provided by the Dealer are implemented by a group of nodes through JSS (Joint Secret Sharing) and key agreement algorithms. Thirdly, member cheating can be effectively detected by constructing publicly verifiable encryptions and zero-knowledge proofs; therefore a TTP (Trusted Third Party) is not needed any more. Finally, system parameters and group parameters are managed by the replica consistency management framework proposed above; this allows a threshold of honest nodes to complete any operations even if not all of them are online at any moment. The resulting MSS scheme allows dynamically changing participants and the system threshold parameters, and periodically changing the members' key share, which results in a more sufficient use of network resources and enhances system security and availability. Encryption process is entirely local and no message is created, which makes secret sharing could be carried out in parallel. By the reuse of group parameters, the message overhead in each secret reconstruction reaches the optimal value.
Theoretical analysis and simulation experiments show that the proposed solutions can fortify fault-tolerant capability of replica update, concurrency control and key protection in P2P, and therefore improve data consistency, data correctness and data security in P2P infrastructure.
引文
[1]Schollmeier Rudiger. A Definition of Peer-to-Peer Networking for the Classification of Peer-to-Peer Architectures and Applications. In:Proceedings of First International Conference on Peer-to-Peer Computing 2001 (P2P2001). Linkoping: IEEE Computer Society,2001.101-102
[2]Zeinalipour-Yazti Demetrios, Kalogeraki Vana, Gunopulos Dimitrios. Information Retrieval Techniques for Peer-to-Peer Networks. Computing in Science& Engineering,2004,6(4):20-26
[3]Stoica Ion, Morris Robert, Liben-Nowell David, et al. Chord:A Scalable Peer-to-Peer Lookup Protocol for Internet Applications. IEEE/ACM Transactions on Networking, 2003,11(1):17-32
[4]Ratnasamy Sylvia, Francis Paul, Handley Mark, et al. A Scalable Content-Addressable Network. In:Proceedings of the 2001 ACM Special Interest Group on Data Communications conference (SIGCOMM'01) Symposium on Communication, Architecture, and Protocols. San Diego, California, United States: ACM Press,2001.161-172
[5]Zhao Ben Y., Huang Ling, Stribling Jeremy, et al. Tapestry:A Resilient Global-Scale Overlay for Service Deployment. IEEE Journal on Selected Areas in Communications,2004,22(1):41-53
[6]Leibowitz Nathaniel, Ripeanu Matei, Wierzbicki Adam. Deconstructing the Kazaa network. In:Proceedings of The Third IEEE Workshop on Internet Applications (WIAPP'03). San Jose, California, USA:IEEE Computer Society,2003.23-24
[7]Zhao Ben Y, Duan Yitao, Huang Ling, et al. Brocade:Landmark Routing on Overlay Networks. In:Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS'02). MIT Faculty Club, Cambridge, MA, USA:Springer Berlin/ Heidelberg,2002.34-44
[8]Rhea Sean, Geels Dennis, Roscoe Timothy, et al. Handling Churn in a DHT. Proceedings of the annual conference on USENIX Annual Technical Conference, 2004:10-24
[9]Saroiu Stefan, Gummadi P. Krishna, Gribble Steven D. A Measurement Study of Peer-to-Peer File Sharing Systems. In:Proceedings of Multimedia Computing and Networking 2002 (MMCN 2002):The International Society for Optical Engineering, 2002.156-170
[10]Bhagwan Ranjita, Savage Stefan, Voelker Geoffrey M. Understanding Availability. In. Peer-to-Peer Systems II, Springer Berlin/Heidelberg; 2003.256-267
[11]Bolosky William J., Douceur John R., Ely David, et al. Feasibility of a Serverless Distributed File System Deployed on an Existing Set of Desktop PCs. In: Proceedings of the international conference on Measurement and modeling of computer systems(SIGMETRICS). Santa Clara, California, United States:ACM, 2000.34-43
[12]Stribling J, PlanetLab-All Pairs Pings, In. http://pdos.csail.mit.edu/-strib/p1_app/. 2005.
[13]Feldman Michal, Papadimitriou Christos, Chuang John, et al. Free-Riding and Whitewashing in Peer-to-Peer Systems. IEEE Journal on Selected Areas in Communications,2006,24(5):1010-1019
[14]Blake Charles, Rodrigues Rodrigo. High Availability, Scalable Storage, Dynamic Peer Networks:Pick Two. In:Proceedings of the 9th Workshop on Hot Topics in Operating Systems (HotOS-IX). Lihue, Hawaii, USA:USENIX Association Berkeley, CA, USA, vol.9,2003.1-6
[15]Karger David, Lehman Eric, Leighton Tom, et al. Consistent Hashing and Random Trees:Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web. In:Proceedings of the twenty-ninth annual ACM symposium on Theory of computing. El Paso, Texas, United States:ACM Press,1997.654-663
[16]Hasan Ragib, Anwar Zahid, Yurcik William, et al. A Survey of Peer-to-Peer Storage Techniques for Distributed File Systems. In:International Conference on Information Technology:Coding and Computing (ITCC 2005). Vegas, Nevada, USA:IEEE Computer Society, vol.2,2005.205-213
[17]Dabek Frank, Zhao Ben, Druschel Peter, et al. Towards a Common API for Structured Peer-to-Peer Overlays. In:Kaashoek M. Frans and Stoica Ion Editors. Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03). Berkeley, California, USA:Springer Berlin/Heidelberg,2003.33-44
[18]Loo Boon Thau, Huebsch Ryan, Stoica Ion, et al. The Case for a Hybrid P2P Search Infrastructure. In:Voelker Geoffrey M. and Shenker Scott Editors. Proceedings of the 3rd International Workshop on Peer-to-Peer systems (IPTPS'04). La Jolla, California, USA:Springer Berlin/Heidelberg, vol.3279,2005.141-150
[19]Maymounkov Petar, Mazieres David. Rateless Codes and Big Downloads. In: Kaashoek M. Frans and Stoica Ion Editors. Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03). Berkeley, California, USA: Springer Berlin/Heidelberg,2003.247-255
[20]Rodrigues Rodrigo, Liskov Barbara. High Availability in DHTs:Erasure Coding vs. Replication. In. Peer-to-Peer Systems IV, Springer Berlin/Heidelberg; 2005. 226-239
[21]Renesse Robbert Van, Schneider Fred B. Chain Replication for Supporting High Throughput and Availability. In:Proceedings of the 6th conference on Symposium on Opearting Systems Design& Implementation. San Francisco, CA:USENIX Association, vol.6,2004.91-104
[22]Ghodsi Ali, Alima Luc Onana, Haridi Seif. Symmetric Replication for Structured Peer-to-Peer Systems. In. Databases, Information Systems, and Peer-to-Peer Computing, Springer Berlin/Heidelberg; 2007.74-85
[23]Cohen Edith, Shenker Scott. Replication Strategies in Unstructured Peer-to-Peer Networks. SIGCOMM Computer Communication Review,2002,32(4):177-190
[24]Bhagwan Ranjita, Tati Kiran, Cheng Yu-Chung, et al. Total Recall:System Support for Automated Availability Management.In:Proceedings of the first conference on Symposium on Networked Systems Design and Implementation. San Francisco, California, USA:USENIX Association Berkeley, CA, USA,2004.337-350
[25]Zhao Jing, Yu Hongliang, Zhang Kun, et al. Achieving Reliability through Replication in a Wide-Area Network DHT Storage System. In:Proceedings of the 2007 International Conference on Parallel Processing (ICPP-07). Xian, China:2007.
[26]Herlihy Maurice P., Wing Jeannette M. Linearizability:A Correctness Condition for Concurrent Objects. ACM Trans. on Programming Languages and Systems,1990, 12(3):463-492
[27]Schneider Fred B. Byzantine Generals in Action:Implementing Fail-Stop Processors. ACM Transactions on Computer Systems (TOCS),1984,2(2):145-154
[28]Schneider Fred B. Implementing Fault-Tolerant Services Using the State Machine Approach:A Tutorial. ACM Computing Surveys,1990,22(4):299-319
[29]Yin Jian, Martin Jean-Philippe, Venkataramani Arun, et al. Separating Agreement from Execution for Byzantine Fault Tolerant Services. ACM SIGOPS Operating Systems Review,2003,37(5):253-267
[30]Malkhi Dahlia, Reiter Michael. Byzantine quorum systems. Distributed Computing, 1998,11(4):203-213
[31]Naor Moni, Wool Avishai. Access Control and Signatures via Quorum Secret Sharing. In:Proceedings of the 3rd ACM conference on Computer and communications security. New Delhi, India:1996.157-168
[32]Malkhi Dahlia, Reiter Michael K. An Architecture for Survivable Coordination in Large Distributed Systems. IEEE Transactions on Knowledge and Data Engineering, 2000,12(2):187-202
[33]Naor Moni, Wool Avishai. The Load, Capacity and Availability of Quorum Systems. SIAM Jounal of Computing,1998,27(2):423-447
[34]Lynch Nancy A., Malkhi Dahlia, Ratajczak David. Atomic Data Access in Distributed Hash Tables. In:Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS'02). MIT Faculty Club, Cambridge, MA, USA: Springer Berlin/Heidelberg,2002.295-305
[35]Kung H. T., Robinson John T. On Optimistic Methods for Concurrency Control. ACM Transactions on Database Systems (TODS),1981,6(2):213-226
[36]Agrawal Rakesh, Carey Michael J., Livny Miron. Concurrency Control Performance Modeling:Alternatives and Implications. ACM Transactions on Database Systems (TODS),1987,12(4):609-654
[37]Shamir Adi. How to Share a Secret. Communications of the ACM,1979,22(11): 612-613
[38]Blakley G. R. Safeguarding Cryptographic Keys. In:Proceedings of American Federation of Information Processing Societies 1979 National Computer Conference. New York, USA:AFIPS Press, vol.48,1979.313-317
[39]Asmuth Charles, Bloom John. A Modular Approach to Key Safeguarding. IEEE Transactions on Information Theory,1983,29(2):208-210
[40]Karnin Ehud D., Greene Jonathan W., Hellman Martin E. On Secret Sharing Systems. IEEE Transactions on Information Theory,1983,29(1):35-41
[41]Tompa Martin, Woll Heather. How To Share a Secret with Cheaters. Journal of Cryptology,1989,1(3):133-138
[42]Chor Benny, Goldwasser Shafi, Micali Silvio, et al. Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults. In:Proceedings of the 26th Annual Symposium on Foundations of Computer Science (FOCS85). Portland, Oregon, USA:IEEE Computer Society,1984.383-395
[43]Herzberg Amir, Jarecki Stanislaw, Krawczyk Hugo, et al. Proactive Secret Sharing Or:How to Cope With Perpetual Leakage. In:Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology. Santa Barbara, California, USA:Springer-Verlag,1995.339-352
[44]Zheng Yuliang, Hardjono Thomas, Seberry Jennifer. Reusing Shares in Secret Sharing Schemes. The Computer Journal,1994,37(3):199-205
[45]Adya Atul, Bolosky William J., Castro Miguel, et al. Farsite:Federated, Available, and Reliable Storage for an Incompletely Trusted Environment. In:Proceedings of the 5th symposium on Operating systems design and implementation (OSDI'02). Boston, Massachusetts, USA:2002.1-14
[46]Castro Miguel, Liskov Barbara. Practical Byzantine Fault Tolerance and Proactive Recovery. ACM Transactions on Computer Systems (TOCS),2002,20(4):398-461
[47]Rhea Sean, Wells Chris, Eaton Patrick, et al. Maintenance-Free Global Data Storage. IEEE Internet Computing,2001,5(5):40-49
[48]Muthitacharoen Athicha, Gilbert Seth, Morris Robert, Etna:a Fault-tolerant Algorithm for Atomic Mutable DHT Data, Technical Report MIT-CSAIL-TR-2005-044, Massachusetts Institute of Technology:Jun 15,2005; pp 1-10
[49]Lamport Leslie. The Part-Time Parliament. ACM Transactions on Computer Systems (TOCS),1998,16(2):133-169
[50]Lewis Clifford Scott, Saia Jared, Scalable Byzantine Agreement, Technical Report University of New Mexico:Albuquerque, New Mexico, US,2004;
[51]Amir Yair, Danilov Claudiu, Dolev Danny, et al. Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks. In:Proceedings of the International Conference on Dependable Systems and Networks (DSN 2006). Philadelphia, Pennsylvania, USA:2006.105-114
[52]Malkhi Dahlia. From Byzantine Agreement to Practical Survivability. In: Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems (SRDS'02). Osaka, Japan:2002.374-379
[53]Martin Jean-Philippe, Alvisi Lorenzo. Fast Byzantine Consensus. IEEE Transactions on Dependable and Secure Computing,2006,3(3):202-215
[54]Malkhi Dahlia, Reiter Michael K. Secure and Scalable Replication in Phalanx. In: Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems. Purdue University, West Lafayette, Indiana:IEEE Computer Society,1998.51-58
[55]Malkhi Dahlia, Reiter Michael K., Tulone Daniela, et al. Persistent objects in the Fleet system. In:Proceedings of DARPA's second DARPA Information Survivability Conference and Exposition (DISCEX II). California, USA:vol.2, 2001.126-136
[56]Martin Jean-Philippe, Alvisi Lorenzo, Dahlin Michael. Minimal Byzantine Storage. In:Proceedings of the 16th International Conference on Distributed Computing. Toulouse, France:Springer-Verlag,2002.311-325
[57]Abd-El-Malek Michael, Ganger Gregory R., Goodson Garth R., et al. Fault-Scalable Byzantine Fault-Tolerant Services. Operating Systems Review,2005,39(5):59-74
[58]Chun Byung-Gon. Mechanisms to Tolerate Misbehavior in Replicated Systems: [Doctor of Philosophy dissertation]. EECS Department, University of California, Berkeley,2007.
[59]Cowling James, Myers Daniel, Liskov Barbara, et al. HQ Replication:A Hybrid Quorum Protocol for Byzantine Fault Tolerance. In:Proceedings of the 7th symposium on Operating systems design and implementation. Seattle, Washington: 2006.177-190
[60]Rodrigues Rodrigo, Liskov Barbara, Rosebud:A Scalable Byzantine-Fault-Tolerant Storage Architecture, Technical Report Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory:17 Dec,2003;
[61]Abraham Ittai, Malkhi Dahlia. Probabilistic quorums for dynamic systems. Distributed Computing,2005,18(2):113-124
[62]Martin Jean-Philippe, Alvisi Lorenzo. A Framework for Dynamic Byzantine Storage. In:Proceedings of the 2004 International Conference on Dependable Systems and Networks. Palazzo dei Congressi, Florence, Italy:IEEE Computer Society, vol.15, 2004.325-334
[63]Weatherspoon Hakim, Eaton Patrick, Chun Byung-Gon, et al. Antiquity:Exploiting a Secure Log for Wide-Area Distributed Storage. ACM SIGOPS Operating Systems Review,2007,41(3):371-384
[64]Naor Moni, Wieder Udi. Scalable and Dynamic Quorum Systems. In:Proceedings of the twenty-second annual symposium on Principles of distributed computing (PODC 2003). Boston, Massachusetts, USA:ACM New York, NY, USA,2003. 114-122
[65]Silaghi Bujor, Keleher Pete, Bhattachajee Bobby. Multi-Dimensional Quorum Sets for Read-Few Write-Many Replica Control Protocols. In:Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2004): IEEE Computer Society Washington, DC, USA,2004.355-362
[66]Yu Haifeng, Vahdat Amin. The Costs and Limits of Availability for Replicated Services. ACM Transactions on Computer Systems (TOCS),2006,24(1):70-113
[67]Gray Jim, Helland Pat, O'neil Patrick, et al. The Dangers of Replication and a Solution. In:Proceedings of the 1996 ACM SIGMOD international conference on Management of data. Montreal, Quebec, Canada:ACM Press,1996.173-182
[68]Demers Alan, Petersen Karin, Spreitzer Mike, et al. The Bayou Architecture: Support for Data Sharing among Mobile Users. In:Proceedings of IEEE First Workshop on Mobile Computing Systems and Applications (WMCSA 1994). Santa Cruz, California, USA:1994.2-7
[69]Kubiatowicz John, Bindel David, Chen Yan, et al. OceanStore:An Architecture for Global-Scale Persistent Storage. Acm Sigplan Notices,2000,35(11):190-201
[70]Lakshmanan Subramanian, Ahamad Mustaque, Venkateswaran H. Responsive Security for Stored Data. IEEE Transactions on Parallel and Distributed Systems, 2003,14(9):818-828
[71]Busca Jean-Michel, Picconi Fabio, Sens Pierre. Pastis:A Highly-Scalable Multi-user Peer-to-Peer File System. In. Euro-Par 2005 Parallel Processing, Berlin: Springer-Verlag Berlin; 2005.1173-1182
[72]Clarke Ian, Sandberg Oskar, Wiley Brandon, et al. Freenet:A Distributed Anonymous Information Storage and Retrieval System. In:Federrath Hannes Editor Proceedings of the ICSI Workshop on Design Issues in Anonymity and Unobservability. Berkeley, California, United States:Springer-Verlag New York, Inc.,2000.46-66
[73]Rowstron Antony, Druschel Peter. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. ACM SIGOPS Operating Systems Review,2001,35(5):188-201
[74]Dabek Frank, Kaashoek M. Frans, Karger David, et al. Wide-area cooperative storage with CFS. ACM SIGOPS Operating Systems Review,2001,35(5):202-215
[75]Haeberlen Andreas, Mislove Alan, Druschel Peter. Glacier:highly durable, decentralized storage despite massive correlated failures. In:Proceedings of the 2nd conference on Symposium on Networked Systems Design& Implementation (NSDI'05). Boston, Massachusetts, USA:USENIX Association, vol.2,2005. 143-158
[76]Chen Benjie, Gil Thomer M., Muthitacharoen Athicha, et al. Brief Announcement: Building Data Structures on Untrusted Peer-to-Peer Storage with Per-participant Logs. In:Proceedings of the twenty-second annual symposium on Principles of distributed computing (PODC'03). Boston, Massachusetts, United States: Association for Computing Machinery, New York, NY 10036-5701, United States, 2003.253-253
[77]Mislove Alan, Post Ansley, Reis Charles, et al. POST:a secure, resilient, cooperative messaging system. In:Proceedings of the 9th conference on Hot Topics in Operating Systems. Lihue, Hawaii, USA:USENIX Association, vol.9,2003.
[78]Ellis C. A., Gibbs S. J. Concurrency Control in Groupware Systems. In:Proceedings of the 1989 ACM SIGMOD international conference on Management of Data. Portland, Oregon, United States:ACM Press, vol.18,1989.399-407
[79]Quiroga Leandro, Fernandez Alejandro. A P2P Groupware Framework based on Operational Transformations. In:Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (ICDCSW 07). Toronto, Ontario, Canada:IEEE Computer Society Washington, DC, USA,2007.70-76
[80]Saito Yasushi, Shapiro Marc. Optimistic Replication. ACM Computing Surveys (CSUR),2005,37(1):42-81
[81]Oster Gerald, Urso Pascal, Molli Pascal, et al. Data consistency for P2P collaborative editing. In:Proceedings of the 20th Anniversary ACM Conference on Computer Supported Cooperative Work (CSCW 2006). Banff, AB, Canada: Association for Computing Machinery, New York, NY 10036-5701, United States, 2006.259-268
[82]Cetintemel Ugur, Keleher Peter J., Bhattacharjee Bobby, et al. Deno:A Decentralized, Peer-to-Peer Object-Replication System for Weakly Connected Environments. IEEE Transactions on Computers,2003,52(7):943-959
[83]Baldonia Roberto, Jimenez-Perisb Ricardo, Patino-Martinezb Marta, et al. Dynamic quorums for DHT-based enterprise infrastructures. Journal of Parallel and Distributed Computing,2008,68(9):1235-1249
[84]Stonebreaker Michael. Concurrency Control and Consistency of Multiple Copies of Data in Distributed INGRES. IEEE Transactions on Software Engineering,1979, 5(3):188-194
[85]Karp Brad, Ratnasamy Sylvia, Rhea Sean, et al. Spurring Adoption of DHTs with OpenHash, a Public DHT Service. In:Voelker Geoffrey M. and Shenker Scott Editors. Proceedings of the 3rd International Workshop on Peer-to-Peer systems (IPTPS'04). La Jolla, California, USA:Springer Berlin/Heidelberg,2004.195-205
[86]Srivatsa Mudhakar, Liu Ling Vulnerabilities and Security Threats in Structured Overlay Networks:A Quantitative Analysis. In:Proceedings of the 20th Annual Computer Security Applications Conference. Tucson, Arizona, USA:IEEE Computer Society,2004.252-261
[87]Knezevic Predrag, Wombacher Andreas, Risse Thomas. Highly Available DHTs: Keeping Data Consistency After Updates. In:Z Despotovic, S Joseph and C Sartori editors. Agents and Peer-to-Peer Computing, Heidelberg:Springer-Verlag Berlin; 2006.70-80
[88]Zhang Zheng, Lian Qiao. Reperasure:replication protocol using erasure-code in peer-to-peer storage network. In:Qiao Lian Editor Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems (SRDS'02). Osaka University, Suita, Japan:IEEE Computer Society,2002.330-335
[89]Lin Shiding, Lian Qiao, Chen Ming, et al. A Practical Distributed Mutual Exclusion Protocol in Dynamic Peer-to-Peer Systems. In:Voelker Geoffrey M. and Shenker Scott Editors. Proceedings of the 3rd International Workshop on Peer-to-Peer Systems (IPTPS'04). San Diego, California, USA:2004.1-6
[90]Ibach Peter, Stantchev Vladimir, Keller Christian. DAEDALUS-A Peer-to-Peer Shared Memory System for Ubiquitous Computing. In. Euro-Par 2006 Parallel Processing, Springer Berlin/Heidelberg; 2006.961-970
[91]Akbarinia Reza, Pacitti Esther, Valduriez Patrick. Data Currency in Replicated DHTs. In:Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'07). Beijing, China:ACM,2007.211-222
[92]Li Ruixuan, Yu Guangcan, Lu Zhengding, et al. P2P-based Locking in Real-Time Collaborative Editing Systems. In:W Shen, I Hawryszhiewycz, Ml Maher, Y Yang, Z Lin and Q Hao Editors.11th International Conference on Computer Supported Cooperative Work in Design (CSCWD 2007). Melbourne, Australia:IEEE Computer Society,2007.24-29
[93]Muhammad Moosa, Cheema Adeep S., Gupta Indranil. Efficient Mutual Exclusion in Peer-to-Peer Systems. In:Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing. Seattle, Washington, USA:IEEE Computer Society, 2005.296-299
[94]Obeidat Atef Ahmed, Gubarev Vasily Vasiliyevich. Developing End-to-End Mutual Exclusion Protocol in Peer-to-Peer Systems. In:Third International Forum on Strategic Technologies (IFOST 2008). Novosibirsk, RUSSIA:IEEE,2008.282-286
[95]Thomas Robert H. A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases. ACM Transactions on Database Systems (TODS),1979, 4(2):180-209
[96]Xie Yumin, Shi Feng, Ming Yang, et al. A Threshold Scheme under Peer-to-Peer Network. Wuhan University Journal of Natural Sciences,2006,11(6):1741-1744
[97]张艳霞,王劲林.一种P2P网络鲁棒访问控制协议.计算机应用,2007,27(3)：538-545
[98]柴震川.门限密码方案安全性和应用研究：[博士学位论文].计算机科学与工程系,上海交通大学,2007.
[99]Cachin Christian. On-line Secret Sharing. In. Cryptography and Coding, Springer Berlin/Heidelberg; 1995.190-198
[100]Pinch R. G. E. Online multiple secret sharing. Electronic Letters,1996,32(12): 1087-1088
[101]He J., Dawson E. Multistage secret sharing based on one-way function. Electronic Letters,1994,30(19):1591-1592
[102]He J., Dawson E. Multisecret-sharing scheme based on one-way function. Electronic Letters,1995,31(2):93-95
[103]Hwang Ren-Junn, Chang Chin-Chen. An On-line Secret Sharing Scheme for Multi-secrets. Computer Communications,1998,21(13):1170-1176
[104]Harn L. Efficient sharing (broadcasting) of multiple secrets. IEE Computers and Digital Techniques,1995,142(3):237-240
[105]Chen Liqun, Gollmann Dieter, Mitchell Chris J., et al. Secret Sharing with Reusable Polynomials. In:Proceeding of the 2nd Australasian Conference on Information Security and Privacy. Canberra, Australia:vol.1270,1997.183-193
[106]施荣华.一种多重密钥共享认证方案.计算机学报,2003,26(5)：552-556
[107]王贵林,卿斯汉.对一种多重密钥共享认证方案的分析和改进.软件学报,2006,17(7)：1627-1632
[108]Li Feng, Shang Jianwei, Li Daxing. A Proactive Secure Multisecret Sharing Threshold Scheme. In:Proceedings of the 8th International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007):vol.1,2007.105-110
[109]Baek Joonsang, Zheng Yuliang. Identity-Based Threshold Decryption. In. Public Key Cryptography-PKC 2004, Springer Berlin/Heidelberg; 2004.262-276
[110]Daza Vanesa, Herranz Javier, Morillo Paz, et al. Cryptographic techniques for mobile ad-hoc networks. Computer Networks:The International Journal of Computer and Telecommunications Networking,2007,51(18):4938-4950
[111]王锋,张建中.基于RSA的可验证的动态多重秘密共享方案.计算机应用研究,2008,25(6)：1806-1811
[112]Saxena Nitesh, Tsudik Gene, Yi Jeong Hyun. Identity-based access control for ad hoc groups. In. Information Security and Cryptology-ICISC 2004, Springer Berlin /Heidelberg; 2005.362-379
[113]Douceur John R. The Sybil Attack. In:Proceedings of the First International Workshop on Peer-to-Peer Systems. Cambridge, MA, USA:Springer-Verlag,2002. 251-260
[114]Crescenzo Giovanni Di, Arce Gonzalo, Ge Renwei. Threshold Cryptography in Mobile Ad Hoc Networks. In. Security in Communication Networks, Springer Berlin/Heidelberg; 2005.91-104
[115]Blundo Carlo, Santis Alfredo De, Herzberg Amir, et al. Perfectly-Secure Key Distribution for Dynamic Conferences. In. Advances in Cryptology - CRYPTO'92, Springer Berlin/Heidelberg; 1993.471-486
[116]Saxena Nitesh, Tsudik Gene, Yi Jeong Hyun. Efficient Node Admission for Short-lived Mobile Ad Hoc Networks. In:Proceedings of the 13th IEEE International Conference on Network Protocols (ICNP'05). Boston, Massachusetts, USA:IEEE Computer Society,2005.269-278
[117]Daza Vanesa, Morillo Paz, Rafols Carla. On Dynamic Distribution of Private Keys over MANETs. Electronic Notes in Theoretical Computer Science (ENTCS),2007, 171(1):33-41
[118]Pietro Roberto Di, Mancini Luigi Vincenzo, Zanin Giorgio. Efficient and Adaptive Threshold Signatures for Ad hoc networks. Electronic Notes in Theoretical Computer Science (ENTCS),2007,171(1):93-105
[119]Jimenez-Peris Ricardo, Patino-Martinez M., Alonso Gustavo, et al. Are Quorums an Alternative for Data Replication? ACM Transactions on Database Systems (TODS),2003,28(3):257-294
[120]Thambidurai Philip, Park You-Keun. Interactive Consistency with Multiple Failure Modes. In:Proceedings of Seventh Symposium on Reliable Distributed Systems. Columbus, Ohio, USA:IEEE Computer Society Press,1988.93-100
[121]Saia J., Young M. Reducing Communication Costs in Robust Peer-to-Peer Networks. Information Processing Letters,2008,106(4):152-158
[122]Awerbuch Baruch, Scheideler Christian. Towards a Scalable and Robust DHT. In: Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures. Cambridge, Massachusetts, USA:ACM Press,2006.318-327
[123]Pathak Vivek, Iftode Liviu. Byzantine Fault Tolerant Public Key Authentication in Peer-to-Peer Systems. Computer Networks:The International Journal of Computer and Telecommunications Networking,2006,50(4):579-596
[124]Ho Chi, Renesse Robbert Van, Bickford Mark, et al. Nysiad:Practical Protocol Transformation to Tolerate Byzantine Failures. In:Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation. San Francisco, California:USENIX Association,2008.175-188
[125]Terry Douglas B., Demers Alan J., Petersen Karin, et al. Session guarantees for weakly consistent replicated data. In:Proceedings of the Third International Conference on Parallel and Distributed Information Systems. Austin, Texas, USA: IEEE Computer Society Washington, DC, USA,1994.140-149
[126]Lamport Leslie. On interprocess communication. Distributed Computing,1986, 1(2):86-101
[127]Ahamad Mustaque, Neiger Gil, Burns James E., et al. Causal memory:definitions, implementation, and programming Distributed Computing,1995,9(1):37-49
[128]Howard John H., Kazar Michael L., Menees Sherri G., et al. Scale and Performance in a Distributed File System. ACM Transactions on Computer Systems (TOCS), 1988,6(1):51-81
[129]Fischer Michael J., Lynch Nancy A., Paterson Michael S. Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM (JACM),1985, 32(2):374-382
[130]Garcia Pedro, Pairot Carles, Mondejar Ruben, et al. PlanetSim:A New Overlay Network Simulation Framework. In. Software Engineering and Middleware, Springer Berlin/Heidelberg; 2005.123-136
[131]Naicken S., Livingston B., Basu A., et al. The State of Peer-to-Peer Simulators and Simulations. SIGCOMM Computer Communication Review,2007,37(2):95-98
[132]Goodson Garth R., Wylie Jay J., Ganger Gregory R., et al. Efficient Byzantine-tolerant erasure-coded storage. In:Proceedings of the 2004 International Conference on Dependable Systems and Networks. Palazzo dei Congressi, Florence, Italy:IEEE Computer Society,2004.135-144
[133]Lamport Leslie. Time, Clocks, and the Ordering of Events in a Distributed System. Communications of the ACM,1978,21(7):558-565
[134]Ramamritham Krithi, Pu Calton. A Formal Characterization of Epsilon Serializability. IEEE Transactions on Knowledge and Data Engineering,1995,7(6): 997-1007
[135]党德鹏.并行数据广播中的亚可串行化并发控制.计算机学报,2008,31(3)：450-455
[136]Knapp Edgar. Deadlock Detection in Distributed Databases. ACM Computing Surveys,1987,19(4):79-100
[137]Feldman Paul. A Practical Scheme for Non-interactive Verifiable Secret Sharing. In: Proceedings of the 28th Annual Symposium on Foundations of Computer Science. Los Angeles, California, USA:IEEE Computer Society,1987.427-438
[138]Ostrovsky Rafail, Yung Moti. How To Withstand Mobile Virus Attacks. In: Proceedings of the tenth annual ACM symposium on Principles of distributed computing. Montreal, Quebec, Canada:ACM New York, NY, USA,1991.51-59
[139]Herzberg Amir, Jakobsson Markus, Jarecki Stanisllaw, et al. Proactive Public Key and Signature Systems. In:Proceedings of the 4th ACM Conference on Computer and Communications Security. Zurich, Switzerland:ACM Press,1997.100-110
[140]Shamir Adi. Identity-Based Cryptosystems and Signature Schemes. In. Advances in Cryptology, Springer Berlin/Heidelberg; 1985.47-53
[141]Boneh Dan, Franklin Matt. Identity-Based Encryption from the Weil Pairing. In. Advances in Cryptology - CRYPTO 2001, Springer Berlin/Heidelberg; 2001. 213-229
[142]Goldwasser Shafi, Micali Silvio. Probabilistic Encryption. Journal of Computer and System Sciences,1984,28(2):270-299
[143]Dolev Danny, Dwork Cynthia, Naor Moni. Non-Malleable Cryptography. In: Proceedings of the twenty-third annual ACM symposium on Theory of computing. New Orleans, Louisiana, United States:ACM Press,1991.542-552
[144]Mao Wenboc.现代密码学理论与实践.(第一版).王继林,伍前红.北京：电子工业出版社,2004.
[145]Fiat Amos, Shamir Adi. How To Prove Yourself:Practical Solutions to Identification and Signature Problems. In. Advances in Cryptology - CRYPTO'86, Springer Berlin/Heidelberg; 1986.186-194
[146]Bellare Mihir, Rogaway Phillip. Random Oracles are Practical:A Paradigm for Designing Efficient Protocols. In:First ACM Conference on Computer and Communications Security. Fairfax, Virginia, United States:ACM 2 Penn Plaza, Suite 701 New York NY USA,1993.62-73
[147]Canetti Ran, Goldreich Oded, Halevi Shai. The Random Oracle Methodology, Revisited. Journal of the ACM (JACM),2004,51(4):557-594
[148]Menezes Alfred J., Okamoto Tatsuaki, Vanstone Scott A. Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field. IEEE Transactions on Information Theory,1993,39(5):1639-1646
[149]Shoup Victor, Gennaro Rosario. Securing Threshold Cryptosystems against Chosen Ciphertext Attack. Journal of Cryptology,2002,15(2):75-96
[150]Chaum David, Pedersen Torben Pryds. Transferred Cash Grows in Size. In. Advances in Cryptology - EUROCRYPT'92, Springer Berlin/Heidelberg; 1993. 390-407
[151]Blum Manuel, Santis Alfredo De, Micali Silvio, et al. Non-Interactive Zero-Knowledge. SI AM Journal on Computing,1991,20(6):1084-1118
[152]Pedersen Torben Pryds. A Threshold Cryptosystem without a Trusted Party. In. Advances in Cryptology - EUROCRYPT'91, Springer Berlin/Heidelberg; 1991. 522-526
[153]Dolev Danny, Hoch Ezra N., Renesse Robbert Van. Self-stabilizing and Byzantine-Tolerant Overlay Network. In. Principles of Distributed Systems, Heidelberg, Springer Berlin; 2007.343-357
[2]Zeinalipour-Yazti Demetrios, Kalogeraki Vana, Gunopulos Dimitrios. Information Retrieval Techniques for Peer-to-Peer Networks. Computing in Science& Engineering,2004,6(4):20-26
[3]Stoica Ion, Morris Robert, Liben-Nowell David, et al. Chord:A Scalable Peer-to-Peer Lookup Protocol for Internet Applications. IEEE/ACM Transactions on Networking, 2003,11(1):17-32
[4]Ratnasamy Sylvia, Francis Paul, Handley Mark, et al. A Scalable Content-Addressable Network. In:Proceedings of the 2001 ACM Special Interest Group on Data Communications conference (SIGCOMM'01) Symposium on Communication, Architecture, and Protocols. San Diego, California, United States: ACM Press,2001.161-172
[5]Zhao Ben Y., Huang Ling, Stribling Jeremy, et al. Tapestry:A Resilient Global-Scale Overlay for Service Deployment. IEEE Journal on Selected Areas in Communications,2004,22(1):41-53
[6]Leibowitz Nathaniel, Ripeanu Matei, Wierzbicki Adam. Deconstructing the Kazaa network. In:Proceedings of The Third IEEE Workshop on Internet Applications (WIAPP'03). San Jose, California, USA:IEEE Computer Society,2003.23-24
[7]Zhao Ben Y, Duan Yitao, Huang Ling, et al. Brocade:Landmark Routing on Overlay Networks. In:Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS'02). MIT Faculty Club, Cambridge, MA, USA:Springer Berlin/ Heidelberg,2002.34-44
[8]Rhea Sean, Geels Dennis, Roscoe Timothy, et al. Handling Churn in a DHT. Proceedings of the annual conference on USENIX Annual Technical Conference, 2004:10-24
[9]Saroiu Stefan, Gummadi P. Krishna, Gribble Steven D. A Measurement Study of Peer-to-Peer File Sharing Systems. In:Proceedings of Multimedia Computing and Networking 2002 (MMCN 2002):The International Society for Optical Engineering, 2002.156-170
[10]Bhagwan Ranjita, Savage Stefan, Voelker Geoffrey M. Understanding Availability. In. Peer-to-Peer Systems II, Springer Berlin/Heidelberg; 2003.256-267
[11]Bolosky William J., Douceur John R., Ely David, et al. Feasibility of a Serverless Distributed File System Deployed on an Existing Set of Desktop PCs. In: Proceedings of the international conference on Measurement and modeling of computer systems(SIGMETRICS). Santa Clara, California, United States:ACM, 2000.34-43
[12]Stribling J, PlanetLab-All Pairs Pings, In. http://pdos.csail.mit.edu/-strib/p1_app/. 2005.
[13]Feldman Michal, Papadimitriou Christos, Chuang John, et al. Free-Riding and Whitewashing in Peer-to-Peer Systems. IEEE Journal on Selected Areas in Communications,2006,24(5):1010-1019
[14]Blake Charles, Rodrigues Rodrigo. High Availability, Scalable Storage, Dynamic Peer Networks:Pick Two. In:Proceedings of the 9th Workshop on Hot Topics in Operating Systems (HotOS-IX). Lihue, Hawaii, USA:USENIX Association Berkeley, CA, USA, vol.9,2003.1-6
[15]Karger David, Lehman Eric, Leighton Tom, et al. Consistent Hashing and Random Trees:Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web. In:Proceedings of the twenty-ninth annual ACM symposium on Theory of computing. El Paso, Texas, United States:ACM Press,1997.654-663
[16]Hasan Ragib, Anwar Zahid, Yurcik William, et al. A Survey of Peer-to-Peer Storage Techniques for Distributed File Systems. In:International Conference on Information Technology:Coding and Computing (ITCC 2005). Vegas, Nevada, USA:IEEE Computer Society, vol.2,2005.205-213
[17]Dabek Frank, Zhao Ben, Druschel Peter, et al. Towards a Common API for Structured Peer-to-Peer Overlays. In:Kaashoek M. Frans and Stoica Ion Editors. Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03). Berkeley, California, USA:Springer Berlin/Heidelberg,2003.33-44
[18]Loo Boon Thau, Huebsch Ryan, Stoica Ion, et al. The Case for a Hybrid P2P Search Infrastructure. In:Voelker Geoffrey M. and Shenker Scott Editors. Proceedings of the 3rd International Workshop on Peer-to-Peer systems (IPTPS'04). La Jolla, California, USA:Springer Berlin/Heidelberg, vol.3279,2005.141-150
[19]Maymounkov Petar, Mazieres David. Rateless Codes and Big Downloads. In: Kaashoek M. Frans and Stoica Ion Editors. Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03). Berkeley, California, USA: Springer Berlin/Heidelberg,2003.247-255
[20]Rodrigues Rodrigo, Liskov Barbara. High Availability in DHTs:Erasure Coding vs. Replication. In. Peer-to-Peer Systems IV, Springer Berlin/Heidelberg; 2005. 226-239
[21]Renesse Robbert Van, Schneider Fred B. Chain Replication for Supporting High Throughput and Availability. In:Proceedings of the 6th conference on Symposium on Opearting Systems Design& Implementation. San Francisco, CA:USENIX Association, vol.6,2004.91-104
[22]Ghodsi Ali, Alima Luc Onana, Haridi Seif. Symmetric Replication for Structured Peer-to-Peer Systems. In. Databases, Information Systems, and Peer-to-Peer Computing, Springer Berlin/Heidelberg; 2007.74-85
[23]Cohen Edith, Shenker Scott. Replication Strategies in Unstructured Peer-to-Peer Networks. SIGCOMM Computer Communication Review,2002,32(4):177-190
[24]Bhagwan Ranjita, Tati Kiran, Cheng Yu-Chung, et al. Total Recall:System Support for Automated Availability Management.In:Proceedings of the first conference on Symposium on Networked Systems Design and Implementation. San Francisco, California, USA:USENIX Association Berkeley, CA, USA,2004.337-350
[25]Zhao Jing, Yu Hongliang, Zhang Kun, et al. Achieving Reliability through Replication in a Wide-Area Network DHT Storage System. In:Proceedings of the 2007 International Conference on Parallel Processing (ICPP-07). Xian, China:2007.
[26]Herlihy Maurice P., Wing Jeannette M. Linearizability:A Correctness Condition for Concurrent Objects. ACM Trans. on Programming Languages and Systems,1990, 12(3):463-492
[27]Schneider Fred B. Byzantine Generals in Action:Implementing Fail-Stop Processors. ACM Transactions on Computer Systems (TOCS),1984,2(2):145-154
[28]Schneider Fred B. Implementing Fault-Tolerant Services Using the State Machine Approach:A Tutorial. ACM Computing Surveys,1990,22(4):299-319
[29]Yin Jian, Martin Jean-Philippe, Venkataramani Arun, et al. Separating Agreement from Execution for Byzantine Fault Tolerant Services. ACM SIGOPS Operating Systems Review,2003,37(5):253-267
[30]Malkhi Dahlia, Reiter Michael. Byzantine quorum systems. Distributed Computing, 1998,11(4):203-213
[31]Naor Moni, Wool Avishai. Access Control and Signatures via Quorum Secret Sharing. In:Proceedings of the 3rd ACM conference on Computer and communications security. New Delhi, India:1996.157-168
[32]Malkhi Dahlia, Reiter Michael K. An Architecture for Survivable Coordination in Large Distributed Systems. IEEE Transactions on Knowledge and Data Engineering, 2000,12(2):187-202
[33]Naor Moni, Wool Avishai. The Load, Capacity and Availability of Quorum Systems. SIAM Jounal of Computing,1998,27(2):423-447
[34]Lynch Nancy A., Malkhi Dahlia, Ratajczak David. Atomic Data Access in Distributed Hash Tables. In:Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS'02). MIT Faculty Club, Cambridge, MA, USA: Springer Berlin/Heidelberg,2002.295-305
[35]Kung H. T., Robinson John T. On Optimistic Methods for Concurrency Control. ACM Transactions on Database Systems (TODS),1981,6(2):213-226
[36]Agrawal Rakesh, Carey Michael J., Livny Miron. Concurrency Control Performance Modeling:Alternatives and Implications. ACM Transactions on Database Systems (TODS),1987,12(4):609-654
[37]Shamir Adi. How to Share a Secret. Communications of the ACM,1979,22(11): 612-613
[38]Blakley G. R. Safeguarding Cryptographic Keys. In:Proceedings of American Federation of Information Processing Societies 1979 National Computer Conference. New York, USA:AFIPS Press, vol.48,1979.313-317
[39]Asmuth Charles, Bloom John. A Modular Approach to Key Safeguarding. IEEE Transactions on Information Theory,1983,29(2):208-210
[40]Karnin Ehud D., Greene Jonathan W., Hellman Martin E. On Secret Sharing Systems. IEEE Transactions on Information Theory,1983,29(1):35-41
[41]Tompa Martin, Woll Heather. How To Share a Secret with Cheaters. Journal of Cryptology,1989,1(3):133-138
[42]Chor Benny, Goldwasser Shafi, Micali Silvio, et al. Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults. In:Proceedings of the 26th Annual Symposium on Foundations of Computer Science (FOCS85). Portland, Oregon, USA:IEEE Computer Society,1984.383-395
[43]Herzberg Amir, Jarecki Stanislaw, Krawczyk Hugo, et al. Proactive Secret Sharing Or:How to Cope With Perpetual Leakage. In:Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology. Santa Barbara, California, USA:Springer-Verlag,1995.339-352
[44]Zheng Yuliang, Hardjono Thomas, Seberry Jennifer. Reusing Shares in Secret Sharing Schemes. The Computer Journal,1994,37(3):199-205
[45]Adya Atul, Bolosky William J., Castro Miguel, et al. Farsite:Federated, Available, and Reliable Storage for an Incompletely Trusted Environment. In:Proceedings of the 5th symposium on Operating systems design and implementation (OSDI'02). Boston, Massachusetts, USA:2002.1-14
[46]Castro Miguel, Liskov Barbara. Practical Byzantine Fault Tolerance and Proactive Recovery. ACM Transactions on Computer Systems (TOCS),2002,20(4):398-461
[47]Rhea Sean, Wells Chris, Eaton Patrick, et al. Maintenance-Free Global Data Storage. IEEE Internet Computing,2001,5(5):40-49
[48]Muthitacharoen Athicha, Gilbert Seth, Morris Robert, Etna:a Fault-tolerant Algorithm for Atomic Mutable DHT Data, Technical Report MIT-CSAIL-TR-2005-044, Massachusetts Institute of Technology:Jun 15,2005; pp 1-10
[49]Lamport Leslie. The Part-Time Parliament. ACM Transactions on Computer Systems (TOCS),1998,16(2):133-169
[50]Lewis Clifford Scott, Saia Jared, Scalable Byzantine Agreement, Technical Report University of New Mexico:Albuquerque, New Mexico, US,2004;
[51]Amir Yair, Danilov Claudiu, Dolev Danny, et al. Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks. In:Proceedings of the International Conference on Dependable Systems and Networks (DSN 2006). Philadelphia, Pennsylvania, USA:2006.105-114
[52]Malkhi Dahlia. From Byzantine Agreement to Practical Survivability. In: Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems (SRDS'02). Osaka, Japan:2002.374-379
[53]Martin Jean-Philippe, Alvisi Lorenzo. Fast Byzantine Consensus. IEEE Transactions on Dependable and Secure Computing,2006,3(3):202-215
[54]Malkhi Dahlia, Reiter Michael K. Secure and Scalable Replication in Phalanx. In: Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems. Purdue University, West Lafayette, Indiana:IEEE Computer Society,1998.51-58
[55]Malkhi Dahlia, Reiter Michael K., Tulone Daniela, et al. Persistent objects in the Fleet system. In:Proceedings of DARPA's second DARPA Information Survivability Conference and Exposition (DISCEX II). California, USA:vol.2, 2001.126-136
[56]Martin Jean-Philippe, Alvisi Lorenzo, Dahlin Michael. Minimal Byzantine Storage. In:Proceedings of the 16th International Conference on Distributed Computing. Toulouse, France:Springer-Verlag,2002.311-325
[57]Abd-El-Malek Michael, Ganger Gregory R., Goodson Garth R., et al. Fault-Scalable Byzantine Fault-Tolerant Services. Operating Systems Review,2005,39(5):59-74
[58]Chun Byung-Gon. Mechanisms to Tolerate Misbehavior in Replicated Systems: [Doctor of Philosophy dissertation]. EECS Department, University of California, Berkeley,2007.
[59]Cowling James, Myers Daniel, Liskov Barbara, et al. HQ Replication:A Hybrid Quorum Protocol for Byzantine Fault Tolerance. In:Proceedings of the 7th symposium on Operating systems design and implementation. Seattle, Washington: 2006.177-190
[60]Rodrigues Rodrigo, Liskov Barbara, Rosebud:A Scalable Byzantine-Fault-Tolerant Storage Architecture, Technical Report Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory:17 Dec,2003;
[61]Abraham Ittai, Malkhi Dahlia. Probabilistic quorums for dynamic systems. Distributed Computing,2005,18(2):113-124
[62]Martin Jean-Philippe, Alvisi Lorenzo. A Framework for Dynamic Byzantine Storage. In:Proceedings of the 2004 International Conference on Dependable Systems and Networks. Palazzo dei Congressi, Florence, Italy:IEEE Computer Society, vol.15, 2004.325-334
[63]Weatherspoon Hakim, Eaton Patrick, Chun Byung-Gon, et al. Antiquity:Exploiting a Secure Log for Wide-Area Distributed Storage. ACM SIGOPS Operating Systems Review,2007,41(3):371-384
[64]Naor Moni, Wieder Udi. Scalable and Dynamic Quorum Systems. In:Proceedings of the twenty-second annual symposium on Principles of distributed computing (PODC 2003). Boston, Massachusetts, USA:ACM New York, NY, USA,2003. 114-122
[65]Silaghi Bujor, Keleher Pete, Bhattachajee Bobby. Multi-Dimensional Quorum Sets for Read-Few Write-Many Replica Control Protocols. In:Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2004): IEEE Computer Society Washington, DC, USA,2004.355-362
[66]Yu Haifeng, Vahdat Amin. The Costs and Limits of Availability for Replicated Services. ACM Transactions on Computer Systems (TOCS),2006,24(1):70-113
[67]Gray Jim, Helland Pat, O'neil Patrick, et al. The Dangers of Replication and a Solution. In:Proceedings of the 1996 ACM SIGMOD international conference on Management of data. Montreal, Quebec, Canada:ACM Press,1996.173-182
[68]Demers Alan, Petersen Karin, Spreitzer Mike, et al. The Bayou Architecture: Support for Data Sharing among Mobile Users. In:Proceedings of IEEE First Workshop on Mobile Computing Systems and Applications (WMCSA 1994). Santa Cruz, California, USA:1994.2-7
[69]Kubiatowicz John, Bindel David, Chen Yan, et al. OceanStore:An Architecture for Global-Scale Persistent Storage. Acm Sigplan Notices,2000,35(11):190-201
[70]Lakshmanan Subramanian, Ahamad Mustaque, Venkateswaran H. Responsive Security for Stored Data. IEEE Transactions on Parallel and Distributed Systems, 2003,14(9):818-828
[71]Busca Jean-Michel, Picconi Fabio, Sens Pierre. Pastis:A Highly-Scalable Multi-user Peer-to-Peer File System. In. Euro-Par 2005 Parallel Processing, Berlin: Springer-Verlag Berlin; 2005.1173-1182
[72]Clarke Ian, Sandberg Oskar, Wiley Brandon, et al. Freenet:A Distributed Anonymous Information Storage and Retrieval System. In:Federrath Hannes Editor Proceedings of the ICSI Workshop on Design Issues in Anonymity and Unobservability. Berkeley, California, United States:Springer-Verlag New York, Inc.,2000.46-66
[73]Rowstron Antony, Druschel Peter. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. ACM SIGOPS Operating Systems Review,2001,35(5):188-201
[74]Dabek Frank, Kaashoek M. Frans, Karger David, et al. Wide-area cooperative storage with CFS. ACM SIGOPS Operating Systems Review,2001,35(5):202-215
[75]Haeberlen Andreas, Mislove Alan, Druschel Peter. Glacier:highly durable, decentralized storage despite massive correlated failures. In:Proceedings of the 2nd conference on Symposium on Networked Systems Design& Implementation (NSDI'05). Boston, Massachusetts, USA:USENIX Association, vol.2,2005. 143-158
[76]Chen Benjie, Gil Thomer M., Muthitacharoen Athicha, et al. Brief Announcement: Building Data Structures on Untrusted Peer-to-Peer Storage with Per-participant Logs. In:Proceedings of the twenty-second annual symposium on Principles of distributed computing (PODC'03). Boston, Massachusetts, United States: Association for Computing Machinery, New York, NY 10036-5701, United States, 2003.253-253
[77]Mislove Alan, Post Ansley, Reis Charles, et al. POST:a secure, resilient, cooperative messaging system. In:Proceedings of the 9th conference on Hot Topics in Operating Systems. Lihue, Hawaii, USA:USENIX Association, vol.9,2003.
[78]Ellis C. A., Gibbs S. J. Concurrency Control in Groupware Systems. In:Proceedings of the 1989 ACM SIGMOD international conference on Management of Data. Portland, Oregon, United States:ACM Press, vol.18,1989.399-407
[79]Quiroga Leandro, Fernandez Alejandro. A P2P Groupware Framework based on Operational Transformations. In:Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (ICDCSW 07). Toronto, Ontario, Canada:IEEE Computer Society Washington, DC, USA,2007.70-76
[80]Saito Yasushi, Shapiro Marc. Optimistic Replication. ACM Computing Surveys (CSUR),2005,37(1):42-81
[81]Oster Gerald, Urso Pascal, Molli Pascal, et al. Data consistency for P2P collaborative editing. In:Proceedings of the 20th Anniversary ACM Conference on Computer Supported Cooperative Work (CSCW 2006). Banff, AB, Canada: Association for Computing Machinery, New York, NY 10036-5701, United States, 2006.259-268
[82]Cetintemel Ugur, Keleher Peter J., Bhattacharjee Bobby, et al. Deno:A Decentralized, Peer-to-Peer Object-Replication System for Weakly Connected Environments. IEEE Transactions on Computers,2003,52(7):943-959
[83]Baldonia Roberto, Jimenez-Perisb Ricardo, Patino-Martinezb Marta, et al. Dynamic quorums for DHT-based enterprise infrastructures. Journal of Parallel and Distributed Computing,2008,68(9):1235-1249
[84]Stonebreaker Michael. Concurrency Control and Consistency of Multiple Copies of Data in Distributed INGRES. IEEE Transactions on Software Engineering,1979, 5(3):188-194
[85]Karp Brad, Ratnasamy Sylvia, Rhea Sean, et al. Spurring Adoption of DHTs with OpenHash, a Public DHT Service. In:Voelker Geoffrey M. and Shenker Scott Editors. Proceedings of the 3rd International Workshop on Peer-to-Peer systems (IPTPS'04). La Jolla, California, USA:Springer Berlin/Heidelberg,2004.195-205
[86]Srivatsa Mudhakar, Liu Ling Vulnerabilities and Security Threats in Structured Overlay Networks:A Quantitative Analysis. In:Proceedings of the 20th Annual Computer Security Applications Conference. Tucson, Arizona, USA:IEEE Computer Society,2004.252-261
[87]Knezevic Predrag, Wombacher Andreas, Risse Thomas. Highly Available DHTs: Keeping Data Consistency After Updates. In:Z Despotovic, S Joseph and C Sartori editors. Agents and Peer-to-Peer Computing, Heidelberg:Springer-Verlag Berlin; 2006.70-80
[88]Zhang Zheng, Lian Qiao. Reperasure:replication protocol using erasure-code in peer-to-peer storage network. In:Qiao Lian Editor Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems (SRDS'02). Osaka University, Suita, Japan:IEEE Computer Society,2002.330-335
[89]Lin Shiding, Lian Qiao, Chen Ming, et al. A Practical Distributed Mutual Exclusion Protocol in Dynamic Peer-to-Peer Systems. In:Voelker Geoffrey M. and Shenker Scott Editors. Proceedings of the 3rd International Workshop on Peer-to-Peer Systems (IPTPS'04). San Diego, California, USA:2004.1-6
[90]Ibach Peter, Stantchev Vladimir, Keller Christian. DAEDALUS-A Peer-to-Peer Shared Memory System for Ubiquitous Computing. In. Euro-Par 2006 Parallel Processing, Springer Berlin/Heidelberg; 2006.961-970
[91]Akbarinia Reza, Pacitti Esther, Valduriez Patrick. Data Currency in Replicated DHTs. In:Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'07). Beijing, China:ACM,2007.211-222
[92]Li Ruixuan, Yu Guangcan, Lu Zhengding, et al. P2P-based Locking in Real-Time Collaborative Editing Systems. In:W Shen, I Hawryszhiewycz, Ml Maher, Y Yang, Z Lin and Q Hao Editors.11th International Conference on Computer Supported Cooperative Work in Design (CSCWD 2007). Melbourne, Australia:IEEE Computer Society,2007.24-29
[93]Muhammad Moosa, Cheema Adeep S., Gupta Indranil. Efficient Mutual Exclusion in Peer-to-Peer Systems. In:Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing. Seattle, Washington, USA:IEEE Computer Society, 2005.296-299
[94]Obeidat Atef Ahmed, Gubarev Vasily Vasiliyevich. Developing End-to-End Mutual Exclusion Protocol in Peer-to-Peer Systems. In:Third International Forum on Strategic Technologies (IFOST 2008). Novosibirsk, RUSSIA:IEEE,2008.282-286
[95]Thomas Robert H. A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases. ACM Transactions on Database Systems (TODS),1979, 4(2):180-209
[96]Xie Yumin, Shi Feng, Ming Yang, et al. A Threshold Scheme under Peer-to-Peer Network. Wuhan University Journal of Natural Sciences,2006,11(6):1741-1744
[97]张艳霞,王劲林.一种P2P网络鲁棒访问控制协议.计算机应用,2007,27(3)：538-545
[98]柴震川.门限密码方案安全性和应用研究：[博士学位论文].计算机科学与工程系,上海交通大学,2007.
[99]Cachin Christian. On-line Secret Sharing. In. Cryptography and Coding, Springer Berlin/Heidelberg; 1995.190-198
[100]Pinch R. G. E. Online multiple secret sharing. Electronic Letters,1996,32(12): 1087-1088
[101]He J., Dawson E. Multistage secret sharing based on one-way function. Electronic Letters,1994,30(19):1591-1592
[102]He J., Dawson E. Multisecret-sharing scheme based on one-way function. Electronic Letters,1995,31(2):93-95
[103]Hwang Ren-Junn, Chang Chin-Chen. An On-line Secret Sharing Scheme for Multi-secrets. Computer Communications,1998,21(13):1170-1176
[104]Harn L. Efficient sharing (broadcasting) of multiple secrets. IEE Computers and Digital Techniques,1995,142(3):237-240
[105]Chen Liqun, Gollmann Dieter, Mitchell Chris J., et al. Secret Sharing with Reusable Polynomials. In:Proceeding of the 2nd Australasian Conference on Information Security and Privacy. Canberra, Australia:vol.1270,1997.183-193
[106]施荣华.一种多重密钥共享认证方案.计算机学报,2003,26(5)：552-556
[107]王贵林,卿斯汉.对一种多重密钥共享认证方案的分析和改进.软件学报,2006,17(7)：1627-1632
[108]Li Feng, Shang Jianwei, Li Daxing. A Proactive Secure Multisecret Sharing Threshold Scheme. In:Proceedings of the 8th International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007):vol.1,2007.105-110
[109]Baek Joonsang, Zheng Yuliang. Identity-Based Threshold Decryption. In. Public Key Cryptography-PKC 2004, Springer Berlin/Heidelberg; 2004.262-276
[110]Daza Vanesa, Herranz Javier, Morillo Paz, et al. Cryptographic techniques for mobile ad-hoc networks. Computer Networks:The International Journal of Computer and Telecommunications Networking,2007,51(18):4938-4950
[111]王锋,张建中.基于RSA的可验证的动态多重秘密共享方案.计算机应用研究,2008,25(6)：1806-1811
[112]Saxena Nitesh, Tsudik Gene, Yi Jeong Hyun. Identity-based access control for ad hoc groups. In. Information Security and Cryptology-ICISC 2004, Springer Berlin /Heidelberg; 2005.362-379
[113]Douceur John R. The Sybil Attack. In:Proceedings of the First International Workshop on Peer-to-Peer Systems. Cambridge, MA, USA:Springer-Verlag,2002. 251-260
[114]Crescenzo Giovanni Di, Arce Gonzalo, Ge Renwei. Threshold Cryptography in Mobile Ad Hoc Networks. In. Security in Communication Networks, Springer Berlin/Heidelberg; 2005.91-104
[115]Blundo Carlo, Santis Alfredo De, Herzberg Amir, et al. Perfectly-Secure Key Distribution for Dynamic Conferences. In. Advances in Cryptology - CRYPTO'92, Springer Berlin/Heidelberg; 1993.471-486
[116]Saxena Nitesh, Tsudik Gene, Yi Jeong Hyun. Efficient Node Admission for Short-lived Mobile Ad Hoc Networks. In:Proceedings of the 13th IEEE International Conference on Network Protocols (ICNP'05). Boston, Massachusetts, USA:IEEE Computer Society,2005.269-278
[117]Daza Vanesa, Morillo Paz, Rafols Carla. On Dynamic Distribution of Private Keys over MANETs. Electronic Notes in Theoretical Computer Science (ENTCS),2007, 171(1):33-41
[118]Pietro Roberto Di, Mancini Luigi Vincenzo, Zanin Giorgio. Efficient and Adaptive Threshold Signatures for Ad hoc networks. Electronic Notes in Theoretical Computer Science (ENTCS),2007,171(1):93-105
[119]Jimenez-Peris Ricardo, Patino-Martinez M., Alonso Gustavo, et al. Are Quorums an Alternative for Data Replication? ACM Transactions on Database Systems (TODS),2003,28(3):257-294
[120]Thambidurai Philip, Park You-Keun. Interactive Consistency with Multiple Failure Modes. In:Proceedings of Seventh Symposium on Reliable Distributed Systems. Columbus, Ohio, USA:IEEE Computer Society Press,1988.93-100
[121]Saia J., Young M. Reducing Communication Costs in Robust Peer-to-Peer Networks. Information Processing Letters,2008,106(4):152-158
[122]Awerbuch Baruch, Scheideler Christian. Towards a Scalable and Robust DHT. In: Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures. Cambridge, Massachusetts, USA:ACM Press,2006.318-327
[123]Pathak Vivek, Iftode Liviu. Byzantine Fault Tolerant Public Key Authentication in Peer-to-Peer Systems. Computer Networks:The International Journal of Computer and Telecommunications Networking,2006,50(4):579-596
[124]Ho Chi, Renesse Robbert Van, Bickford Mark, et al. Nysiad:Practical Protocol Transformation to Tolerate Byzantine Failures. In:Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation. San Francisco, California:USENIX Association,2008.175-188
[125]Terry Douglas B., Demers Alan J., Petersen Karin, et al. Session guarantees for weakly consistent replicated data. In:Proceedings of the Third International Conference on Parallel and Distributed Information Systems. Austin, Texas, USA: IEEE Computer Society Washington, DC, USA,1994.140-149
[126]Lamport Leslie. On interprocess communication. Distributed Computing,1986, 1(2):86-101
[127]Ahamad Mustaque, Neiger Gil, Burns James E., et al. Causal memory:definitions, implementation, and programming Distributed Computing,1995,9(1):37-49
[128]Howard John H., Kazar Michael L., Menees Sherri G., et al. Scale and Performance in a Distributed File System. ACM Transactions on Computer Systems (TOCS), 1988,6(1):51-81
[129]Fischer Michael J., Lynch Nancy A., Paterson Michael S. Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM (JACM),1985, 32(2):374-382
[130]Garcia Pedro, Pairot Carles, Mondejar Ruben, et al. PlanetSim:A New Overlay Network Simulation Framework. In. Software Engineering and Middleware, Springer Berlin/Heidelberg; 2005.123-136
[131]Naicken S., Livingston B., Basu A., et al. The State of Peer-to-Peer Simulators and Simulations. SIGCOMM Computer Communication Review,2007,37(2):95-98
[132]Goodson Garth R., Wylie Jay J., Ganger Gregory R., et al. Efficient Byzantine-tolerant erasure-coded storage. In:Proceedings of the 2004 International Conference on Dependable Systems and Networks. Palazzo dei Congressi, Florence, Italy:IEEE Computer Society,2004.135-144
[133]Lamport Leslie. Time, Clocks, and the Ordering of Events in a Distributed System. Communications of the ACM,1978,21(7):558-565
[134]Ramamritham Krithi, Pu Calton. A Formal Characterization of Epsilon Serializability. IEEE Transactions on Knowledge and Data Engineering,1995,7(6): 997-1007
[135]党德鹏.并行数据广播中的亚可串行化并发控制.计算机学报,2008,31(3)：450-455
[136]Knapp Edgar. Deadlock Detection in Distributed Databases. ACM Computing Surveys,1987,19(4):79-100
[137]Feldman Paul. A Practical Scheme for Non-interactive Verifiable Secret Sharing. In: Proceedings of the 28th Annual Symposium on Foundations of Computer Science. Los Angeles, California, USA:IEEE Computer Society,1987.427-438
[138]Ostrovsky Rafail, Yung Moti. How To Withstand Mobile Virus Attacks. In: Proceedings of the tenth annual ACM symposium on Principles of distributed computing. Montreal, Quebec, Canada:ACM New York, NY, USA,1991.51-59
[139]Herzberg Amir, Jakobsson Markus, Jarecki Stanisllaw, et al. Proactive Public Key and Signature Systems. In:Proceedings of the 4th ACM Conference on Computer and Communications Security. Zurich, Switzerland:ACM Press,1997.100-110
[140]Shamir Adi. Identity-Based Cryptosystems and Signature Schemes. In. Advances in Cryptology, Springer Berlin/Heidelberg; 1985.47-53
[141]Boneh Dan, Franklin Matt. Identity-Based Encryption from the Weil Pairing. In. Advances in Cryptology - CRYPTO 2001, Springer Berlin/Heidelberg; 2001. 213-229
[142]Goldwasser Shafi, Micali Silvio. Probabilistic Encryption. Journal of Computer and System Sciences,1984,28(2):270-299
[143]Dolev Danny, Dwork Cynthia, Naor Moni. Non-Malleable Cryptography. In: Proceedings of the twenty-third annual ACM symposium on Theory of computing. New Orleans, Louisiana, United States:ACM Press,1991.542-552
[144]Mao Wenboc.现代密码学理论与实践.(第一版).王继林,伍前红.北京：电子工业出版社,2004.
[145]Fiat Amos, Shamir Adi. How To Prove Yourself:Practical Solutions to Identification and Signature Problems. In. Advances in Cryptology - CRYPTO'86, Springer Berlin/Heidelberg; 1986.186-194
[146]Bellare Mihir, Rogaway Phillip. Random Oracles are Practical:A Paradigm for Designing Efficient Protocols. In:First ACM Conference on Computer and Communications Security. Fairfax, Virginia, United States:ACM 2 Penn Plaza, Suite 701 New York NY USA,1993.62-73
[147]Canetti Ran, Goldreich Oded, Halevi Shai. The Random Oracle Methodology, Revisited. Journal of the ACM (JACM),2004,51(4):557-594
[148]Menezes Alfred J., Okamoto Tatsuaki, Vanstone Scott A. Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field. IEEE Transactions on Information Theory,1993,39(5):1639-1646
[149]Shoup Victor, Gennaro Rosario. Securing Threshold Cryptosystems against Chosen Ciphertext Attack. Journal of Cryptology,2002,15(2):75-96
[150]Chaum David, Pedersen Torben Pryds. Transferred Cash Grows in Size. In. Advances in Cryptology - EUROCRYPT'92, Springer Berlin/Heidelberg; 1993. 390-407
[151]Blum Manuel, Santis Alfredo De, Micali Silvio, et al. Non-Interactive Zero-Knowledge. SI AM Journal on Computing,1991,20(6):1084-1118
[152]Pedersen Torben Pryds. A Threshold Cryptosystem without a Trusted Party. In. Advances in Cryptology - EUROCRYPT'91, Springer Berlin/Heidelberg; 1991. 522-526
[153]Dolev Danny, Hoch Ezra N., Renesse Robbert Van. Self-stabilizing and Byzantine-Tolerant Overlay Network. In. Principles of Distributed Systems, Heidelberg, Springer Berlin; 2007.343-357