More realistic analysis of mass surveillance – security in multi‐surveillant settings. (1st November 2020)

• Record Type: Journal Article
• Authors: Li, Geng; Liu, Jianwei; Zhang, Zongyang
• Is Part Of: IET information security. Volume 14:Number 6(2020)
• Page Start: 641
• Page End: 653
• Publication Date: 2020-11-01
• Subjects: cryptography; conversational adversaries -- queryable adversaries -- secure randomness generators -- mass surveillance -- multisurveillant setting -- subversion attack -- single‐surveillant -- multisurveillant subversion -- PRISM -- cryptographic algorithms -- symmetric encryption schemes -- amalgamation and decomposition framework; Computer security -- Periodicals; Cryptography -- Periodicals; Computer networks -- Security measures -- Periodicals; Database security -- Periodicals; 005.8
• DOI: 10.1049/iet-ifs.2020.0090
• Languages: English
• ISSNs: 1751-8709

Abstract

Abstract : The PRISM made the research of cryptography against subversion attacks flourish these years. In a subversion attack, surveillants can compromise the security of users' systems by subverting implementations of cryptographic algorithms. While the scenario of a single‐surveillant has been researched by several works, the multi‐surveillant setting attracted less consideration. The authors have initialised this notion in previous work but assumed the surveillants to be completely isolated. In this study, the authors follow this idea and consider more realistic scenarios of the multi‐surveillant subversion, where surveillants are able to have limited communications. They propose the notions of queryable adversaries and conversational adversaries. In the first setting, adversaries can verify whether output is produced by a subverted implementation from others; in the latter setting, adversaries can have arbitrary conversations with each other without leaking their backdoors. Under the framework of 'amalgamation and decomposition', they design randomness generators that are secure against queryable adversaries and conversational adversaries, respectively, by adopting implementations from different sources intentionally. Based on the secure randomness generators, they construct symmetric encryption schemes that match the corresponding security definitions.