This book constitutes the refereed proceedings of the 9th International Workshop on Post-Quantum Cryptography, PQCrypto 2018, held in Fort Lauderdale, FL, USA, in April 2018. The 24 revised full papers presented were carefully reviewed and selected from 97 submissions. The papers are organized in topical sections on Lattice-based Cryptography, Learning with Errors, Cryptanalysis, Key Establishment, Isogeny-based Cryptography, Hash-based cryptography, Code-based Cryptography.

This illuminating textbook provides a concise review of the core concepts in mathematics essential to computer scientists. Emphasis is placed on the practical computing applications enabled by seemingly abstract mathematical ideas, presented within their historical context. The text spans a broad selection of key topics, ranging from the use of finite field theory to correct code and the role of number theory in cryptography, to the value of graph theory when modelling networks and the importance of formal methods for safety critical systems. This fully updated new edition has been expanded with a more comprehensive treatment of algorithms, logic, automata theory, model checking, software reliability and dependability, algebra, sequences and series, and mathematical induction. Topics and features: includes numerous pedagogical features, such as chapter-opening key topics, chapter introductions and summaries, review questions, and a glossary; describes the historical contributions of such prominent figures as Leibniz, Babbage, Boole, and von Neumann; introduces the fundamental mathematical concepts of sets, relations and functions, along with the basics of number theory, algebra, algorithms, and matrices; explores arithmetic and geometric sequences and series, mathematical induction and recursion, graph theory, computability and decidability, and automata theory; reviews the core issues of coding theory, language theory, software engineering, and software reliability, as well as formal methods and model checking; covers key topics on logic, from ancient Greek contributions to modern applications in AI, and discusses the nature of mathematical proof and theorem proving; presents a short introduction to probability and statistics, complex numbers and quaternions, and calculus. This engaging and easy-to-understand book will appeal to students of computer science wishing for an overview of the mathematics used in computing, and to mathematicians curious about how their subject is applied in the field of computer science. The book will also capture the interest of the motivated general reader.

This book constitutes the proceedings of the 18th IFIP WG 8.5 International Conference on Electronic Government, EGOV 2019, held in San Benedetto del Tronto, Italy, in September 2019, in conjunction with the IFIP WG 8.5 IFIP International Conference on Electronic Participation (ePart 2019) and the International Conference for E-Democracy and Open Government Conference (CeDEM 2019). The 27 revised full papers presented were carefully reviewed and selected from 64 submissions. The papers are clustered under the following topical sections: E-Government Foundations; E-Government Services and Open Government; Open Data: Social and Technical Aspects; AI, Data Analytics and Automated Decision Making; and Smart Cities.

This book constitutes the refereed proceedings of the 8th International Conference on Electronic Government and the Information Systems Perspective, EGOVIS 2019, held in Linz, Austria, in August 2019. The 17 full papers presented were carefully reviewed and selected from 25 submissions. The papers are organized in the following topical sections: open data and open innovation; data-driven approaches in e-government; e-government cases - data and knowledge management; e-government theoretical background; and digitalization and transparency.

This book constitutes the refereed and revised post-conference proceedings of the 7th International Workshop on Code-Based Cryptography, CBC 2019, held in Darmstadt, Germany, in May 2019. The eight papers presented in this book were carefully reviewed and selected from numerous submissions. These contributions are divided into two groups: The first four papers deal with the design of code-based cryptosystems, while the following four papers are on cryptanalysis of code-based cryptosystems.

This book constitutes the thoroughly refereed proceedings of the First International Conference on HCI for Cybersecurity, Privacy and Trust, HCI-CPT 2019, which was held as part of the 21st HCI International Conference, HCII 2019, in Orlando, FL, USA, in July 2019. The total of 1275 papers and 209 posters included in the 35 HCII 2019 proceedings volumes were carefully reviewed and selected from 5029 submissions. HCI-CPT 2019 includes a total of 32 papers; they were organized in topical sections named: Authentication; cybersecurity awareness and behavior; security and usability; and privacy and trust.

As the structure of contemporary communication networks grows more complex, practical networked distributed systems become prone to component failures. Fault-tolerant consensus in message-passing systems allows participants in the system to agree on a common value despite the malfunction or misbehavior of some components. It is a task of fundamental importance for distributed computing, due to its numerous applications. We summarize studies on the topological conditions that determine the feasibility of consensus, mainly focusing on directed networks and the case of restricted topology knowledge at each participant. Recently, significant efforts have been devoted to fully characterize the underlying communication networks in which variations of fault-tolerant consensus can be achieved. Although the deduction of analogous topological conditions for undirected networks of known topology had shortly followed the introduction of the problem, their extension to the directed network case has been proven a highly non-trivial task. Moreover, global knowledge restrictions, inherent in modern large-scale networks, require more elaborate arguments concerning the locality of distributed computations. In this work, we present the techniques and ideas used to resolve these issues. Recent studies indicate a number of parameters that affect the topological conditions under which consensus can be achieved, namely, the fault model, the degree of system synchrony (synchronous vs. asynchronous), the type of agreement (exact vs. approximate), the level of topology knowledge, and the algorithm class used (general vs. iterative). We outline the feasibility and impossibility results for various combinations of the above parameters, extensively illustrating the relation between network topology and consensus.

This book aims at being a comprehensive and pedagogical introduction to the concept of self-stabilization, introduced by Edsger Wybe Dijkstra in 1973. Self-stabilization characterizes the ability of a distributed algorithm to converge within finite time to a configuration from which its behavior is correct (i.e., satisfies a given specification), regardless the arbitrary initial configuration of the system. This arbitrary initial configuration may be the result of the occurrence of a finite number of transient faults. Hence, self-stabilization is actually considered as a versatile non-masking fault tolerance approach, since it recovers from the effect of any finite number of such faults in an unified manner. Another major interest of such an automatic recovery method comes from the difficulty of resetting malfunctioning devices in a large-scale (and so, geographically spread) distributed system (the Internet, Pair-to-Pair networks, and Delay Tolerant Networks are examples of such distributed systems). Furthermore, self-stabilization is usually recognized as a lightweight property to achieve fault tolerance as compared to other classical fault tolerance approaches. Indeed, the overhead, both in terms of time and space, of state-of-the-art self-stabilizing algorithms is commonly small. This makes self-stabilization very attractive for distributed systems equipped of processes with low computational and memory capabilities, such as wireless sensor networks. After more than 40 years of existence, self-stabilization is now sufficiently established as an important field of research in theoretical distributed computing to justify its teaching in advanced research-oriented graduate courses. This book is an initiation course, which consists of the formal definition of self-stabilization and its related concepts, followed by a deep review and study of classical (simple) algorithms, commonly used proof schemes and design patterns, as well as premium results issued from the self-stabilizing community. As often happens in the self-stabilizing area, in this book we focus on the proof of correctness and the analytical complexity of the studied distributed self-stabilizing algorithms. Finally, we underline that most of the algorithms studied in this book are actually dedicated to the high-level atomic-state model, which is the most commonly used computational model in the self-stabilizing area. However, in the last chapter, we present general techniques to achieve self-stabilization in the low-level message passing model, as well as example algorithms.

The two-volume set LNCS 11442 and 11443 constitutes the refereed proceedings of the 22nd IACR International Conference on the Practice and Theory of Public-Key Cryptography, PKC 2019, held in Beijing, China, in April 2019. The 42 revised papers presented were carefully reviewed and selected from 173 submissions. They are organized in topical sections such as: Cryptographic Protocols; Digital Signatures; Zero-Knowledge; Identity-Based Encryption; Fundamental Primitives; Public Key Encryptions; Functional Encryption; Obfuscation Based Cryptography; Re- Encryption Schemes; Post Quantum Cryptography.

This book constitutes the thoroughly refereed post-conference proceedings of the International Workshop on Interplay of Security, Safety and System/Software Architecture, CSITS 2018, and the International Workshop on Cyber Security for Intelligent Transportation Systems, ISSA 2018, held in Barcelona, Spain, in September 2018, in conjunction with the 23rd European Symposium on Research in Computer Security, ESORICS 2018. The ISSA 2018 workshop received 10 submissions from which 3 full papers and 1 short paper were accepted. They cover topics such as software security engineering, domain-specific security and privacy architectures, and automative security. In addition, an invited paper on safety and security co-engineering intertwining is included. The CSITS 2018 workshop received 9 submissions from which 5 full papers and 1 short paper were accepted. The selected papers deal with car security and aviation security.

This book, written by experts from universities and major research laboratories, addresses the hot topic of network coding, a powerful scheme for information transmission in networks that yields near-optimal throughput. It introduces readers to this striking new approach to network coding, in which the network is not simply viewed as a mechanism for delivering packets, but rather an algebraic structure named the subspace, which these packets span. This leads to a new kind of coding theory, employing what are called subspace codes. The book presents selected, highly relevant advanced research output on: Subspace Codes and Rank Metric Codes; Finite Geometries and Subspace Designs; Application of Network Coding; Codes for Distributed Storage Systems. The outcomes reflect research conducted within the framework of the European COST Action IC1104: Random Network Coding and Designs over GF(q). Taken together, they offer communications engineers, R&D engineers, researchers and graduate students in Mathematics, Computer Science, and Electrical Engineering a comprehensive reference guide to the construction of optimal network codes, as well as efficient encoding and decoding schemes for a given network code.

Are algorithms friend or foe? The human mind is evolutionarily designed to take shortcuts in order to survive. We jump to conclusions because our brains want to keep us safe. A majority of our biases work in our favor, such as when we feel a car speeding in our direction is dangerous and we instantly move, or when we decide not take a bite of food that appears to have gone bad. However, inherent bias negatively affects work environments and the decision-making surrounding our communities. While the creation of algorithms and machine learning attempts to eliminate bias, they are, after all, created by human beings, and thus are susceptible to what we call algorithmic bias. In Understand, Manage, and Prevent Algorithmic Bias, author Tobias Baer helps you understand where algorithmic bias comes from, how to manage it as a business user or regulator, and how data science can prevent bias from entering statistical algorithms. Baer expertly addresses some of the 100+ varieties of natural bias such as confirmation bias, stability bias, pattern-recognition bias, and many others. Algorithmic bias mirrors-and originates in-these human tendencies. Baer dives into topics as diverse as anomaly detection, hybrid model structures, and self-improving machine learning. While most writings on algorithmic bias focus on the dangers, the core of this positive, fun book points toward a path where bias is kept at bay and even eliminated. You'll come away with managerial techniques to develop unbiased algorithms, the ability to detect bias more quickly, and knowledge to create unbiased data. Understand, Manage, and Prevent Algorithmic Bias is an innovative, timely, and important book that belongs on your shelf. Whether you are a seasoned business executive, a data scientist, or simply an enthusiast, now is a crucial time to be educated about the impact of algorithmic bias on society and take an active role in fighting bias. What You'll Learn Study the many sources of algorithmic bias, including cognitive biases in the real world, biased data, and statistical artifact Understand the risks of algorithmic biases, how to detect them, and managerial techniques to prevent or manage them Appreciate how machine learning both introduces new sources of algorithmic bias and can be a part of a solution Be familiar with specific statistical techniques a data scientist can use to detect and overcome algorithmic bias Who This Book is For Business executives of companies using algorithms in daily operations; data scientists (from students to seasoned practitioners) developing algorithms; compliance officials concerned about algorithmic bias; politicians, journalists, and philosophers thinking about algorithmic bias in terms of its impact on society and possible regulatory responses; and consumers concerned about how they might be affected by algorithmic bias

This book constitutes the post-conference proceedings of the 14th International Conference on Information Security and Cryptology, Inscrypt 2018, held in Fuzhou, China, in December 2018. The 31 full papers presented together with 5 short papers and 1 invited paper were carefully reviewed and selected from 93 submissions. The papers cover topics in the field of blockchain and crypto currency; lattice-based cryptology; symmetric cryptology; applied cryptography; information security; assymetric encryption; and foundations.

This book constitutes the refereed proceedings of 3 workshops held at the 22nd International Conference on Financial Cryptography and Data Security, FC 2018, in Nieuwport, Curacao, in March 2018. The 23 full papers presented together with 2 short papers were carefully reviewed and selected from 52 submissions. They feature the outcome of the 5th Workshop on Bitcoin and Blockchain Research, BITCOIN 2018, the Third Workshop onSecure Voting Systems, VOTING 2018,and the Second Workshop on Trusted Smart Contracts, WTSC 2018. The papers are grouped in topical sections named: Blockchain, Distributed Ledgers, Cryptography, Bitcoin, Voting, and Smart Contracts.

This book constitutes the thoroughly refereed post-conference proceedings of the 8th International Conference on Information and Communication Technologies in Agriculture, Food and Environment, HAICTA 2017, held in Chania, Crete, Greece, in September 2017. The 14 revised full papers presented in this book were carefully selected from the 55 accepted full papers out of 124 submissions. The selected papers span across various subjects, from ICT innovations and smart farming, to decision support systems, as well as precision farming, disease diagnosis using mobile devices, IoT for monitoring and controlling animal production, sensor-based solutions, GIS-based water management, environmental planning, information systems for monitoring of fish stocks and fisheries, information management in the agri-food sector, and forestry planning and management.

This book constitutes the refereed proceedings of the 5th Conference on AElectronic Governance and Open Society: Challenges in Eurasia, EGOSE 2018, held in St. Petersburg, Russia, in November 2018. The 36 revised full papers were carefully reviewed and selected from 98 submissions. The papers are organized in topical sections on smart city infrastructure, policy; digital privacy, rights,security;data science, machine learning, algorithms, computational linguistics; digital public administration, economy, policy; digital services, values, inclusion; digital democracy, participation, security, communities, social media, activism; social media discourse analysis; digital data, policy modeling; digital government, administration, communication.

This book constitutes the refereed post-conference proceedings of the 23rd Iberoamerican Congress on Pattern Recognition, CIARP 2018, held in Madrid, Spain, in November 2018 The 112 papers presented were carefully reviewed and selected from 187 submissions The program was comprised of 6 oral sessions on the following topics: machine learning, computer vision, classification, biometrics and medical applications, and brain signals, and also on: text and character analysis, human interaction, and sentiment analysis

Signals Intelligence, or SIGINT, is the interception and evaluation of coded enemy messages. From Enigma to Ultra, Purple to Lorenz, Room 40 to Bletchley, SIGINT has been instrumental in both victory and defeat during the First and Second World War. In the First World War, a vast network of signals rapidly expanded across the globe, spawning a new breed of spies and intelligence operatives to code, de-code and analyse thousands of messages. As a result, signallers and cryptographers in the Admiralty's famous Room 40 paved the way for the code breakers of Bletchley Park in the Second World War. In the ensuing war years the world battled against a web of signals intelligence that gave birth to Enigma and Ultra, and saw agents from Britain, France, Germany, Russia, America and Japan race to outwit each other through infinitely complex codes. For the first time, Peter Matthews reveals the secret history of global signals intelligence during the world wars through original interviews with German interceptors, British code breakers, and US and Russian cryptographers. "SIGINT is a fascinating account of what Allied investigators learned postwar about the Nazi equivalent of Bletchley Park. Turns out, 60,000 crptographers, analysts and linguists achieved considerable success in solving intercepted traffic, and even broke the Swiss Enigma! Based on recently declassifed NSA document, this is a great contribution to the literature." - The St Ermin's Hotel Intelligence Book of the Year Award 2014

This book explores alternative ways of accomplishing secure information transfer with incoherent multi-photon pulses in contrast to conventional Quantum Key Distribution techniques. Most of the techniques presented in this book do not need conventional encryption. Furthermore, the book presents a technique whereby any symmetric key can be securely transferred using the polarization channel of an optical fiber for conventional data encryption. The work presented in this book has largely been practically realized, albeit in a laboratory environment, to offer proof of concept rather than building a rugged instrument that can withstand the rigors of a commercial environment.

This book constitutes the proceedings of the Third International Conference on Space Information Networks, SINC 2018, held in Changchun, China, in August 2018. The 17 full and 7 short papers presented in this volume were carefully reviewed and selected from 140 submissions. The papers are organized in topical sections on architecture and efficient networking mechanism; theories and methods of high speed transmission; and sparse characterization and fusion processing.

This book explains the philosophy of the polar encoding and decoding technique. Polar codes are one of the most recently discovered capacity-achieving channel codes. What sets them apart from other channel codes is the fact that polar codes are designed mathematically and their performance is mathematically proven. The book develops related fundamental concepts from information theory, such as entropy, mutual information, and channel capacity. It then explains the successive cancellation decoding logic and provides the necessary formulas, moving on to demonstrate the successive cancellation decoding operation with a tree structure. It also demonstrates the calculation of split channel capacities when polar codes are employed for binary erasure channels, and explains the mathematical formulation of successive cancellation decoding for polar codes. In closing, the book presents and proves the channel polarization theorem, before mathematically analyzing the performance of polar codes.

This book constitutes the refereed proceedings of the Cryptographer's Track at the RSA Conference 2019, CT-RSA 2019, held in San Francisco, CA, USA, in March 2019. The 28 papers presented in this volume were carefully reviewed and selected from 75 submissions. CT-RSA is the track devoted to scientific papers on cryptography, public-key to symmetric-key cryptography and from crypto- graphic protocols to primitives and their implementation security.

This book investigates the permutation polynomial (PP) based interleavers for turbo codes, including all the main theoretical and practical findings related to topics such as full coefficient conditions for PPs up to fifth; the number of all true different PPs up to fifth degree; the number of true different PPs under Zhao and Fan sufficient conditions, for any degree (with direct formulas or with a simple algorithm); parallel decoding of turbo codes using PP interleavers by butterfly networks; upper bounds of the minimum distance for turbo codes with PP interleavers; specific methods to design and find PP interleavers with good bit/frame error rate (BER/FER) performance. The theoretical results are explained in great detail to enhance readers' understanding. The book is intended for engineers in the telecommunications field, but the chapters dealing with the PP coefficient conditions and with the number of PP are of interest to mathematicians working in the field.

This book constitutes revised selected papers from the 21st International Conference on Information Security and Cryptology, ICISC 2018, held in Seoul, South Korea, in November 2018. The total of 21 papers presented in this volume were carefully reviewed and selected from 49 submissions. The papers were organized in topical sections named: public-key encryption and implementation; homomorphic encryption; secure multiparty computation; post-quantum cryptography; secret sharing and searchable encryption; storage security and information retrieval; and attacks and software security.

This book provides the first unified overview of the burgeoning research area at the interface between Quantum Foundations and Quantum Information. Topics include: operational alternatives to quantum theory, information-theoretic reconstructions of the quantum formalism, mathematical frameworks for operational theories, and device-independent features of the set of quantum correlations. Powered by the injection of fresh ideas from the field of Quantum Information and Computation, the foundations of Quantum Mechanics are in the midst of a renaissance. The last two decades have seen an explosion of new results and research directions, attracting broad interest in the scientific community. The variety and number of different approaches, however, makes it challenging for a newcomer to obtain a big picture of the field and of its high-level goals. Here, fourteen original contributions from leading experts in the field cover some of the most promising research directions that have emerged in the new wave of quantum foundations. The book is directed at researchers in physics, computer science, and mathematics and would be appropriate as the basis of a graduate course in Quantum Foundations.