Modeling And Simulation For Multiparty Computation Protocols With Hypothesis Of Bounded Rationality

As an emerging research direction in cryptography, the rational multiparty computation(RMPC) protocols,which started from2004has important application in fields of multiparty privacy-enhancing cooperation calculation and e-commerce, etc. In this thesis, our research focuses on modeling the formal model of RMPC protocols with hypothesis of bounded rationality, and Using simulation method to analyze the consistency(Interaction Execution Consistency, IEC) of RMPC under the above conditions,i.e.,when execution subject of the RMPC protocols has only bounded rationality,the protocols whether ever established the expected outputs when the game is in equilibrium state.Specifically, the mainly works are as follows:(1) Applying the finite automata,we have modeled the formal model of RMPC protocols, taking the (2,2) rational secret sharing (RSS) protocol for instance,the model is simulated on the Swarm simulation platform, and the critical value of parameters of IEC is obtained about the (2,2) RSS protocols with hypothesis of bounded rationality.(2) Applying the Petri nets of extended behavior to describe each participant's internal state change,combing with the theory of multi-agent simulation(MAS), the Petri net for bounded rational agent decisions is modeled,taking the (k,n) RSS protocol for instance, the RMPC protocols is simulated for the possible variables and parameters which affect IEC,and the effectiveness of the model is verified.(3) Based on the Swarm simulation platform, the necessary classes for RMPC simulation are designed, and the key implementation methods of these classes is detailed introduced; in addition, we also discuss further issues about some software bugs in Swarm library function, and some methods to solve them are proposed.