2017/04/18 by Antonella Del Pozzo, Silvia Bonomi, Del Pozzo, Antonella +5
Computer Science · #68 #Cryptography and Security (cs.CR) #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC) #cs.CR #cs.DC #msc:68
paper · pdf · doi:10.48550/arxiv.1704.05521
Extended version of paper accepted at 2017 International Symposium on Cyber Security Cryptography and Machine Learning (CSCML 2017)
arxiv created 2017/04/18 · arxiv updated 2017/04/20
The paper addresses the problem of emulating a regular register in a synchronous distributed system where clients invoking \sf read() and \sf write() operations are anonymous while server processes maintaining the state of the register may be compromised by rational adversaries (i.e., a server might behave as rational malicious Byzantine process). We first model our problem as a Bayesian game between a client and a rational malicious server where the equilibrium depends on the decisions of the malicious server (behave correctly and not be detected by clients vs returning a wrong register value to clients with the risk of being detected and then excluded by the computation). We prove such equilibrium exists and finally we design a protocol implementing the regular register that forces the rational malicious server to behave correctly.