In this paper, epidemic spread with the staged progression model on homogeneous and heterogeneous networks is studied. First, the epidemic threshold of the simple staged progression model is given. Then the staged pro...In this paper, epidemic spread with the staged progression model on homogeneous and heterogeneous networks is studied. First, the epidemic threshold of the simple staged progression model is given. Then the staged progression model with birth and death is also considered. The case where infectivity is a nonlinear function of the nodes＇ degree is discussed, too. Finally, the analytical results are verified by numerical simulations.展开更多
This paper proposes an efficient batch secret sharing protocol among n players resilient to t 〈 n/4 players in asynchronous network. The construction of our protocol is along the line of Hirt＇s protocol which works ...This paper proposes an efficient batch secret sharing protocol among n players resilient to t 〈 n/4 players in asynchronous network. The construction of our protocol is along the line of Hirt＇s protocol which works in synchronous model. Compared with the method of using secret share protocol m times to share m secrets, our protocol is quite efficient. The protocol can be used to improve the efficiency of secure multi-party computation （MPC） greatly in asynchronous network.展开更多
基金supported by Hong Kong Polytechnic University Grant via a Council Competitive Earmarked Research Grant(CERG) under Grant No.PolyU 5279//08Ethe National Natural Science Foundation of China under Grant Nos.11005001 and 11072136+1 种基金the 211 Project of Anhui University under Grant No.2009QN003A,KJTD002Bsupported by Shanghai Leading Academic Discipline Project under Grant No.S30104
文摘In this paper, epidemic spread with the staged progression model on homogeneous and heterogeneous networks is studied. First, the epidemic threshold of the simple staged progression model is given. Then the staged progression model with birth and death is also considered. The case where infectivity is a nonlinear function of the nodes＇ degree is discussed, too. Finally, the analytical results are verified by numerical simulations.
基金the National Natural Science Foundation of China(No.60803146)
文摘This paper proposes an efficient batch secret sharing protocol among n players resilient to t 〈 n/4 players in asynchronous network. The construction of our protocol is along the line of Hirt＇s protocol which works in synchronous model. Compared with the method of using secret share protocol m times to share m secrets, our protocol is quite efficient. The protocol can be used to improve the efficiency of secure multi-party computation （MPC） greatly in asynchronous network.
