TY  - JOUR
A1  - Roepke, Rene
A1  - Köhler, Klemens
A1  - Drury, Vincent
A1  - Schroeder, Ulrik
A1  - Wolf, Martin
A1  - Meyer, Ulrike
T1  - A pond full of phishing games - analysis of learning games for anti-phishing education
JF  - Model-driven Simulation and Training Environments for Cybersecurity. MSTEC 2020
N2  - Game-based learning is a promising approach to anti-phishing education, as it fosters motivation and can help reduce the perceived difficulty of the educational material. Over the years, several prototypes for game-based applications have been proposed, that follow different approaches in content selection, presentation, and game mechanics. In this paper, a literature and product review of existing learning games is presented. Based on research papers and accessible applications, an in-depth analysis was conducted, encompassing target groups, educational contexts, learning goals based on Bloom’s Revised Taxonomy, and learning content. As a result of this review, we created the publications on games (POG) data set for the domain of anti-phishing education. While there are games that can convey factual and conceptual knowledge, we find that most games are either unavailable, fail to convey procedural knowledge or lack technical depth. Thus, we identify potential areas of improvement for games suitable for end-users in informal learning contexts.
Y1  - 2020
SN  - 978-3-030-62433-0
U6  - http://dx.doi.org/10.1007/978-3-030-62433-0_32020
N1  - Lecture Notes in Computer Science, vol 12512
SP  - 41
EP  - 60
PB  - Springer
CY  - Cham
ER  - 
TY  - CHAP
A1  - Neugebauer, Georg
A1  - Brutschy, Lucas
A1  - Meyer, Ulrike
A1  - Wetzel, Susanne
ED  - Garcia-Alfaro, Joaquin
ED  - Lioudakis, Georgios
ED  - Cuppens-Boulahia, Nora
ED  - Foley, Simon
ED  - Fitzgerald, William M.
T1  - Privacy-preserving multi-party reconciliation secure in the malicious model
T2  - DPM 2013, SETOP 2013: Data Privacy Management and Autonomous Spontaneous Security
N2  - The problem of fair and privacy-preserving ordered set reconciliation arises in a variety of applications like auctions, e-voting, and appointment reconciliation. While several multi-party protocols have been proposed that solve this problem in the semi-honest model, there are no multi-party protocols that are secure in the malicious model so far. In this paper, we close this gap. Our newly proposed protocols are shown to be secure in the malicious model based on a variety of novel non-interactive zero-knowledge-proofs. We describe the implementation of our protocols and evaluate their performance in comparison to protocols solving the problem in the semi-honest case.
KW  - Privacy-enhancing technologies
KW  - Secure multi-party computation
KW  - Cryptographic protocols
KW  - Zero-knowledge proofs
KW  - Malicious model
Y1  - 2014
SN  - 978-3-642-54567-2 (Print)
SN  - 978-3-642-54568-9 (Online)
U6  - http://dx.doi.org/10.1007/978-3-642-54568-9_12
N1  - 8th International Workshop, DPM 2013, and 6th International Workshop, SETOP 2013, Egham, UK, September 12-13, 2013.

Part of the Lecture Notes in Computer Science book series (LNSC,volume 8247)
SP  - 178
EP  - 193
PB  - Springer
CY  - Berlin
ER  -