Critical systems librarianship

In this chapter we perform a meta-analysis and synthesize existing critical library and information studies work into a cohesive approach to critical systems librarianship, informed by diverse perspectives and ethical lenses. We seek to enable and facilitate a critically-informed, reflective, and reflexive approach to systems work with specific focus on how information technologies are applied in library work. Critical systems librarianship centrally involves critical reflection which allows systems workers to question the underlying values, assumptions, and power relations ingrained in their daily practices and the institutions within which they work: this is essential to both theoretical questioning and developing strategies to contest power imbalances

Critical systems librarianship

In this chapter we perform a meta-analysis and synthesize existing critical library and information studies work into a cohesive approach to critical systems librarianship, informed by diverse perspectives and ethical lenses. We seek to enable and facilitate a critically-informed, reflective, and reflexive approach to systems work with specific focus on how information technologies are applied in library work. Critical systems librarianship centrally involves critical reflection which allows systems workers to question the underlying values, assumptions, and power relations ingrained in their daily practices and the institutions within which they work: this is essential to both theoretical questioning and developing strategies to contest power imbalances

Nothing to Hide, Nothing to Fear? Tools and Suggestions for Digital Data Protection

The developing cyber-infrastructure has provided new tools, methods, and opportunities to conduct research. However, the Snowden leaks and subsequent developments proved that the same infrastructure has made all-encompassing surveillance possible – posing new challenges for researchers when engaging with those they are obligated to protect. As the cyber-infrastructure simultaneously opens up new possibility-spaces for circumventing structures of surveillance, while drawing on the authors’ own experiences, this article presents a number of tools and suggestions that will aid the researcher to engage more responsibly and safely with the research subject digitally

An effective simulation analysis of transient electromagnetic multiple faults

Embedded encryption devices and smart sensors are vulnerable to physical attacks. Due to the continuous shrinking of chip size, laser injection, particle radiation and electromagnetic transient injection are possible methods that introduce transient multiple faults. In the fault analysis stage, the adversary is unclear about the actual number of faults injected. Typically, the single-nibble fault analysis encounters difficulties. Therefore, in this paper, we propose novel ciphertext-only impossible differentials that can analyze the number of random faults to six nibbles. We use the impossible differentials to exclude the secret key that definitely does not exist, and then gradually obtain the unique secret key through inverse difference equations. Using software simulation, we conducted 32,000 random multiple fault attacks on Midori. The experiments were carried out to verify the theoretical model of multiple fault attacks. We obtain the relationship between fault injection and information content. To reduce the number of fault attacks, we further optimized the fault attack method. The secret key can be obtained at least 11 times. The proposed ciphertext-only impossible differential analysis provides an effective method for random multiple faults analysis, which would be helpful for improving the security of block ciphers

Analyzing Multi-key Security Degradation

Contains fulltext : 179039.pdf (preprint version ) (Closed access) Contains fulltext : 179039.pdf (Publisher’s version ) (Open Access)nul

Post quantum proxy signature scheme based on the multivariate public key cryptographic signature

Proxy signature is a very useful technique which allows the original signer to delegate the signing capability to a proxy signer to perform the signing operation. It finds wide applications especially in the distributed environment where the entities such as the wireless sensors are short of computational power and needed to be convinced to the authenticity of the server. Due to less proxy signature schemes in the post-quantum cryptography aspect, in this article, we investigate the proxy signature in the post-quantum setting so that it can resist against the potential attacks from the quantum adversaries. A general multivariate public key cryptographic proxy scheme based on a multivariate public key cryptographic signature scheme is proposed, and a heuristic security proof is given for our general construction. We show that the construction can reach Existential Unforgeability under an Adaptive Chosen Message Attack with Proxy Key Exposure assuming that the underlying signature is Existential Unforgeability under an Adaptive Chosen Message Attack. We then use our general scheme to construct practical proxy signature schemes for three well-known and promising multivariate public key cryptographic signature schemes. We implement our schemes and compare with several previous constructions to show our efficiency advantage, which further indicates the potential application prospect in the distributed network environment

Formal Methods for Trustworthy Voting Systems : From Trusted Components to Reliable Software

Voting is prominently an important part of democratic societies, and its outcome may have a dramatic and broad impact on societal progress. Therefore, it is paramount that such a society has extensive trust in the electoral process, such that the system’s functioning is reliable and stable with respect to the expectations within society. Yet, with or without the use of modern technology, voting is full of algorithmic and security challenges, and the failure to address these challenges in a controlled manner may produce fundamental flaws in the voting system and potentially undermine critical societal aspects. In this thesis, we argue for a development process of voting systems that is rooted in and assisted by formal methods that produce transparently checkable evidence for the guarantees that the final system should provide so that it can be deemed trustworthy. The goal of this thesis is to advance the state of the art in formal methods that allow to systematically develop trustworthy voting systems that can be provenly verified. In the literature, voting systems are modeled in the following four comparatively separable and distinguishable layers: (1) the physical layer, (2) the computational layer, (3) the election layer, and (4) the human layer. Current research usually either mostly stays within one of those layers or lacks machine-checkable evidence, and consequently, trusted and understandable criteria often lack formally proven and checkable guarantees on software-level and vice versa. The contributions in this work are formal methods that fill in the trust gap between the principal election layer and the computational layer by a reliable translation of trusted and understandable criteria into trustworthy software. Thereby, we enable that executable procedures can be formally traced back and understood by election experts without the need for inspection on code level, and trust can be preserved to the trustworthy system. The works in this thesis all contribute to this end and consist in five distinct contributions, which are the following: (I) a method for the generation of secure card-based communication schemes, (II) a method for the synthesis of reliable tallying procedures, (III) a method for the efficient verification of reliable tallying procedures, (IV) a method for the computation of dependable election margins for reliable audits, (V) a case study about the security verification of the GI voter-anonymization software. These contributions span formal methods on illustrative examples for each of the three principal components, (1) voter-ballot box communication, (2) election method, and (3) election management, between the election layer and the computational layer. Within the first component, the voter-ballot box communication channel, we build a bridge from the communication channel to the cryptography scheme by automatically generating secure card-based schemes from a small formal model with a parameterization of the desired security requirements. For the second component, the election method, we build a bridge from the election method to the tallying procedure by (1) automatically synthesizing a runnable tallying procedure from the desired requirements given as properties that capture the desired intuitions or regulations of fairness considerations, (2) automatically generating either comprehensible arguments or bounded proofs to compare tallying procedures based on user-definable fairness properties, and (3) automatically computing concrete election margins for a given tallying procedure, the collected ballots, and the computed election result, that enable efficient election audits. Finally, for the third and final component, the election management system, we perform a case study and apply state-of-the-art verification technology to a real-world e-voting system that has been used for the annual elections of the German Informatics Society (GI – “Gesellschaft für Informatik”) in 2019. The case study consists in the formal implementation-level security verification that the voter identities are securely anonymized and the voters’ passwords cannot be leaked. The presented methods assist the systematic development and verification of provenly trustworthy voting systems across traditional layers, i.e., from the election layer to the computational layer. They all pursue the goal of making voting systems trustworthy by reliable and explainable formal requirements. We evaluate the devised methods on minimal card-based protocols that compute a secure AND function for two different decks of cards, a classical knock-out tournament and several Condorcet rules, various plurality, scoring, and Condorcet rules from the literature, the Danish national parliamentary elections in 2015, and a state-of-the-art electronic voting system that is used for the German Informatics Society’s annual elections in 2019 and following

Mobile Africa:Human Trafficking and the Digital Divide

What happens at the nexus of the digital divide and human trafficking? This book examines the impact of the introduction of new digital information and communication technology (ICT) – as well as lack of access to digital connectivity – on human trafficking. The different studies presented in the chapters show the realities for people moving along the Central Mediterranean route from the Horn of Africa through Libya to Europe. The authors warn against an over-optimistic view of innovation as a solution and highlight the relationship between technology and the crimes committed against vulnerable people in search of protection.In this volume, the third in a four-part series ‘Connected and Mobile: Migration and Human Trafficking in Africa’, relevant new theories are proposed as tools to understand the dynamics that appear in mobile Africa. Most importantly, the editors identify critical ethical issues in relation to both technology and human trafficking and the nexus between them, helping explore the dimensions of new responsibilities that need to be defined. The chapters in this book represent a collection of well-documented empirical investigations by a young and diverse group of researchers, addressing critical issues in relation to innovation and the perils of our time