All Outputs (4)

Provably Secure Decisions based on Potentially Malicious Information (2024)
Journal Article
Wang, D., Muller, T., & Sun, J. (2024). Provably Secure Decisions based on Potentially Malicious Information. IEEE Transactions on Dependable and Secure Computing, https://doi.org/10.1109/TDSC.2024.3353295

There are various security-critical decisions routinely made, based on information provided by peers: routing messages, user reports, sensor data, navigational information, blockchain updates, etc. Jury theorems were proposed in sociology to make dec... Read More about Provably Secure Decisions based on Potentially Malicious Information.

Simulating the Impact of Personality on Fake News (2021)
Journal Article
Coates, A., Muller, T., & Sirur, S. (2021). Simulating the Impact of Personality on Fake News. CEUR Workshop Proceedings, 3022,

Fake news is a key issue for social networks. We use an agent-based network simulation to model the spread of (fake) news. The agents' behaviour captures the OCEAN ("big five") personality trait model. The network is homophilic for political preferen... Read More about Simulating the Impact of Personality on Fake News.

Information Theoretical Analysis of Unfair Rating Attacks under Subjectivity (2019)
Journal Article
Wang, D., Muller, T., Zhang, J., & Liu, Y. (2019). Information Theoretical Analysis of Unfair Rating Attacks under Subjectivity. IEEE Transactions on Information Forensics and Security, 15, 816-828. https://doi.org/10.1109/TIFS.2019.2929678

Ratings provided by advisors can help an advisee to make decisions, e.g., which seller to select in e-commerce. Unfair rating attacks – where dishonest ratings are provided to mislead the advisee – impact the accuracy of decision making. Current lite... Read More about Information Theoretical Analysis of Unfair Rating Attacks under Subjectivity.

Expressiveness modulo bisimilarity of regular expressions with parallel composition (2015)
Journal Article
Luttik, B. A., Baeten, J. C., Muller, T. I., & Van Tilburg, P. (2015). Expressiveness modulo bisimilarity of regular expressions with parallel composition. Mathematical Structures in Computer Science, 26(6), 933-968. https://doi.org/10.1017/S0960129514000309

© Cambridge University Press 2015. The languages accepted by finite automata are precisely the languages denoted by regular expressions. In contrast, finite automata may exhibit behaviours that cannot be described by regular expressions up to bisimil... Read More about Expressiveness modulo bisimilarity of regular expressions with parallel composition.