This book constitutes the refereed proceedings of the Second International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2018, held in Beer-Sheva, Israel, in June 2018. The 16 full and 6 short papers presented in this volume were carefully reviewed and selected from 44 submissions. They deal with the theory, design, analysis, implementation, or application of cyber security, cryptography and machine learning systems and networks, and conceptually innovative topics in the scope.

This is the first book on digital fingerprinting that comprehensively covers the major areas of study in a range of information security areas including authentication schemes, intrusion detection, forensic analysis and more. Available techniques for assurance are limited and authentication schemes are potentially vulnerable to the theft of digital tokens or secrets. Intrusion detection can be thwarted by spoofing or impersonating devices, and forensic analysis is incapable of demonstrably tying a particular device to specific digital evidence. This book presents an innovative and effective approach that addresses these concerns. This book introduces the origins and scientific underpinnings of digital fingerprinting. It also proposes a unified framework for digital fingerprinting, evaluates methodologies and includes examples and case studies. The last chapter of this book covers the future directions of digital fingerprinting. This book is designed for practitioners and researchers working in the security field and military. Advanced-level students focused on computer science and engineering will find this book beneficial as secondary textbook or reference.

This book aims at presenting the field of Quantum Information Theory in an intuitive, didactic and self-contained way, taking into account several multidisciplinary aspects. Therefore, this books is particularly suited to students and researchers willing to grasp fundamental concepts in Quantum Computation and Quantum Information areas. The field of Quantum Information Theory has increased significantly over the last three decades. Many results from classical information theory were translated and extended to a scenario where quantum effects become important. Most of the results in this area allows for an asymptotically small probability of error to represent and transmit information efficiently. Claude E.Shannon was the first scientist to realize that error-free classical information transmission can be accomplished under certain conditions. More recently, the concept of error-free classical communication was translated to the quantum context. The so-called Quantum Zero-Error Information Theory completes and extends the Shannon Zero-Error Information Theory.

This book describes trends in email scams and offers tools and techniques to identify such trends. It also describes automated countermeasures based on an understanding of the type of persuasive methods used by scammers. It reviews both consumer-facing scams and enterprise scams, describing in-depth case studies relating to Craigslist scams and Business Email Compromise Scams. This book provides a good starting point for practitioners, decision makers and researchers in that it includes alternatives and complementary tools to the currently deployed email security tools, with a focus on understanding the metrics of scams. Both professionals working in security and advanced-level students interested in privacy or applications of computer science will find this book a useful reference.

This book presents methods to improve information security for protected communication. It combines and applies interdisciplinary scientific engineering concepts, including cryptography, chaos theory, nonlinear and singular optics, radio-electronics and self-changing artificial systems. It also introduces additional ways to improve information security using optical vortices as information carriers and self-controlled nonlinearity, with nonlinearity playing a key "evolving" role. The proposed solutions allow the universal phenomenon of deterministic chaos to be discussed in the context of information security problems on the basis of examples of both electronic and optical systems. Further, the book presents the vortex detector and communication systems and describes mathematical models of the chaos oscillator as a coder in the synchronous chaotic communication and appropriate decoders, demonstrating their efficiency both analytically and experimentally. Lastly it discusses the cryptologic features of analyzed systems and suggests a series of new structures for confident communication.

This book constitutes the proceedings of the 17th International Conference on Unconventional Computation and Natural Computation, UCNC 2018, held in Fontainebleau, France, in June 2018. The 15 full papers presented were carefully reviewed and selected from 22 submissions. The paper cover topics such as hypercomputation; chaos and dynamical systems based computing; granular, fuzzy and rough computing; mechanical computing; cellular, evolutionary, molecular, neural, and quantum computing; membrane computing; amorphous computing, swarm intelligence; artificial immune systems; physics of computation; chemical computation; evolving hardware; the computational nature of self-assembly, developmental processes, bacterial communication, and brain processes.

Computers and computer networks are one of the most incredible inventions of the 20th century, having an ever-expanding role in our daily lives by enabling complex human activities in areas such as entertainment, education, and commerce. One of the most challenging problems in computer science for the 21st century is to improve the design of distributed systems where computing devices have to work together as a team to achieve common goals. In this book, I have tried to gently introduce the general reader to some of the most fundamental issues and classical results of computer science underlying the design of algorithms for distributed systems, so that the reader can get a feel of the nature of this exciting and fascinating field called distributed computing. The book will appeal to the educated layperson and requires no computer-related background. I strongly suspect that also most computer-knowledgeable readers will be able to learn something new.

This book is an introduction to both offensive and defensive techniques of cyberdeception. Unlike most books on cyberdeception, this book focuses on methods rather than detection. It treats cyberdeception techniques that are current, novel, and practical, and that go well beyond traditional honeypots. It contains features friendly for classroom use: (1) minimal use of programming details and mathematics, (2) modular chapters that can be covered in many orders, (3) exercises with each chapter, and (4) an extensive reference list.Cyberattacks have grown serious enough that understanding and using deception is essential to safe operation in cyberspace. The deception techniques covered are impersonation, delays, fakes, camouflage, false excuses, and social engineering. Special attention is devoted to cyberdeception in industrial control systems and within operating systems. This material is supported by a detailed discussion of how to plan deceptions and calculate their detectability and effectiveness. Some of the chapters provide further technical details of specific deception techniques and their application. Cyberdeception can be conducted ethically and efficiently when necessary by following a few basic principles. This book is intended for advanced undergraduate students and graduate students, as well as computer professionals learning on their own. It will be especially useful for anyone who helps run important and essential computer systems such as critical-infrastructure and military systems.

In this book the author presents ten key laws governing information security. He addresses topics such as attacks, vulnerabilities, threats, designing security, identifying key IP assets, authentication, and social engineering. The informal style draws on his experience in the area of video protection and DRM, while the text is supplemented with introductions to the core formal technical ideas. It will be of interest to professionals and researchers engaged with information security.

Link reversal is a versatile algorithm design technique that has been used in numerous distributed algorithms for a variety of problems. The common thread in these algorithms is that the distributed system is viewed as a graph, with vertices representing the computing nodes and edges representing some other feature of the system (for instance, point-to-point communication channels or a conflict relationship). Each algorithm assigns a virtual direction to the edges of the graph, producing a directed version of the original graph. As the algorithm proceeds, the virtual directions of some of the links in the graph change in order to accomplish some algorithm-specific goal. The criterion for changing link directions is based on information that is local to a node (such as the node having no outgoing links) and thus this approach scales well, a feature that is desirable for distributed algorithms. This monograph presents, in a tutorial way, a representative sampling of the work on link-reversal-based distributed algorithms. The algorithms considered solve routing, leader election, mutual exclusion, distributed queueing, scheduling, and resource allocation. The algorithms can be roughly divided into two types, those that assume a more abstract graph model of the networks, and those that take into account more realistic details of the system. In particular, these more realistic details include the communication between nodes, which may be through asynchronous message passing, and possible changes in the graph, for instance, due to movement of the nodes. We have not attempted to provide a comprehensive survey of all the literature on these topics. Instead, we have focused in depth on a smaller number of fundamental papers, whose common thread is that link reversal provides a way for nodes in the system to observe their local neighborhoods, take only local actions, and yet cause global problems to be solved. We conjecture that future interesting uses of link reversal are yet to be discovered. Table of Contents: Introduction / Routing in a Graph: Correctness / Routing in a Graph: Complexity / Routing and Leader Election in a Distributed System / Mutual Exclusion in a Distributed System / Distributed Queueing / Scheduling in a Graph / Resource Allocation in a Distributed System / Conclusion

This book offers a novel approach to data privacy by unifying side-channel attacks within a general conceptual framework. This book then applies the framework in three concrete domains. First, the book examines privacy-preserving data publishing with publicly-known algorithms, studying a generic strategy independent of data utility measures and syntactic privacy properties before discussing an extended approach to improve the efficiency. Next, the book explores privacy-preserving traffic padding in Web applications, first via a model to quantify privacy and cost and then by introducing randomness to provide background knowledge-resistant privacy guarantee. Finally, the book considers privacy-preserving smart metering by proposing a light-weight approach to simultaneously preserving users' privacy and ensuring billing accuracy. Designed for researchers and professionals, this book is also suitable for advanced-level students interested in privacy, algorithms, or web applications.

The three volumes LNCS 10820, 10821, and 10822 constitute the thoroughly refereed proceedings of the 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2018, held in Tel Aviv, Israel, in April/May 2018. The 69 full papers presented were carefully reviewed and selected from 294 submissions. The papers are organized into the following topical sections: foundations; lattices; random oracle model; fully homomorphic encryption; permutations; galois counter mode; attribute-based encryption; secret sharing; blockchain; multi-collision resistance; signatures; private simultaneous messages; masking; theoretical multiparty computation; obfuscation; symmetric cryptanalysis; zero-knowledge; implementing multiparty computation; non-interactive zero-knowledge; anonymous communication; isogeny; leakage; key exchange; quantum; non-malleable codes; and provable symmetric cyptography.

The three volumes LNCS 10820, 10821, and 10822 constitute the thoroughly refereed proceedings of the 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2018, held in Tel Aviv, Israel, in April/May 2018. The 69 full papers presented were carefully reviewed and selected from 294 submissions. The papers are organized into the following topical sections: foundations; lattices; random oracle model; fully homomorphic encryption; permutations; galois counter mode; attribute-based encryption; secret sharing; blockchain; multi-collision resistance; signatures; private simultaneous messages; masking; theoretical multiparty computation; obfuscation; symmetric cryptanalysis; zero-knowledge; implementing multiparty computation; non-interactive zero-knowledge; anonymous communication; isogeny; leakage; key exchange; quantum; non-malleable codes; and provable symmetric cyptography.

A quorum system is a collection of subsets of nodes, called quorums, with the property that each pair of quorums have a non-empty intersection. Quorum systems are the key mathematical abstraction for ensuring consistency in fault-tolerant and highly available distributed computing. Critical for many applications since the early days of distributed computing, quorum systems have evolved from simple majorities of a set of processes to complex hierarchical collections of sets, tailored for general adversarial structures. The initial non-empty intersection property has been refined many times to account for, e.g., stronger (Byzantine) adversarial model, latency considerations or better availability. This monograph is an overview of the evolution and refinement of quorum systems, with emphasis on their role in two fundamental applications: distributed read/write storage and consensus. Table of Contents: Introduction / Preliminaries / Classical Quorum Systems / Classical Quorum-Based Emulations / Byzantine Quorum Systems / Latency-efficient Quorum Systems / Probabilistic Quorum Systems

This book constitutes the refereed proceedings of the Cryptographer's Track at the RSA Conference 2018, CT-RSA 2018, held in San Francisco, CA, USA, in March 2018.The 26 papers presented in this volume were carefully reviewed and selected from 79 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.

The two-volume set LNCS 10769 and 10770 constitutes the refereed proceedings of the 21st IACR International Conference on the Practice and Theory of Public-Key Cryptography, PKC 2018, held in Rio de Janeiro, Brazil, in March 2018. The 49 revised papers presented were carefully reviewed and selected from 186 submissions. They are organized in topical sections such as Key-Dependent-Message and Selective-Opening Security; Searchable and Fully Homomorphic Encryption; Public-Key Encryption; Encryption with Bad Randomness; Subversion Resistance; Cryptanalysis; Composable Security; Oblivious Transfer; Multiparty Computation; Signatures; Structure-Preserving Signatures; Functional Encryption; Foundations; Obfuscation-Based Cryptographic Constructions; Protocols; Blockchain; Zero-Knowledge; Lattices.

The two-volume set LNCS 10769 and 10770 constitutes the refereed proceedings of the 21st IACR International Conference on the Practice and Theory of Public-Key Cryptography, PKC 2018, held in Rio de Janeiro, Brazil, in March 2018. The 49 revised papers presented were carefully reviewed and selected from 186 submissions. They are organized in topical sections such as Key-Dependent-Message and Selective-Opening Security; Searchable and Fully Homomorphic Encryption; Public-Key Encryption; Encryption with Bad Randomness; Subversion Resistance; Cryptanalysis; Composable Security; Oblivious Transfer; Multiparty Computation; Signatures; Structure-Preserving Signatures; Functional Encryption; Foundations; Obfuscation-Based Cryptographic Constructions; Protocols; Blockchain; Zero-Knowledge; Lattices.

This book constitutes the refereed post-conference proceedings of the First International Conference on Number-Theoretic Methods in Cryptology, NuTMiC 2017, held in Warsaw, Poland, in September 2017.The 15 revised full papers presented in this book together with 3 invited talks were carefully reviewed and selected from 32 initial submissions. The papers are organized in topical sections on elliptic curves in cryptography; public-key cryptography; lattices in cryptography; number theory; pseudorandomness; and algebraic structures and analysis.

This book constitutes the revised selected papers from the 12th International Conference on Risk and Security of Internet and Systems, CRISIS 2017, held in Dinard, France, in September 2017.The 12 full papers and 5 short papers presented in this volume were carefully reviewed and selected from 42 submissions. They cover diverse research themes, ranging from classic topics, such as vulnerability analysis and classification; apps security; access control and filtering; cloud security; cyber-insurance and cyber threat intelligence; human-centric security and trust; and risk analysis.

The three volumes LNCS 10820, 10821, and 10822 constitute the thoroughly refereed proceedings of the 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2018, held in Tel Aviv, Israel, in April/May 2018. The 69 full papers presented were carefully reviewed and selected from 294 submissions. The papers are organized into the following topical sections: foundations; lattices; random oracle model; fully homomorphic encryption; permutations; galois counter mode; attribute-based encryption; secret sharing; blockchain; multi-collision resistance; signatures; private simultaneous messages; masking; theoretical multiparty computation; obfuscation; symmetric cryptanalysis; zero-knowledge; implementing multiparty computation; non-interactive zero-knowledge; anonymous communication; isogeny; leakage; key exchange; quantum; non-malleable codes; and provable symmetric cryptography.

Cooperative network supercomputing is becoming increasingly popular for harnessing the power of the global Internet computing platform. A typical Internet supercomputer consists of a master computer or server and a large number of computers called workers, performing computation on behalf of the master. Despite the simplicity and benefits of a single master approach, as the scale of such computing environments grows, it becomes unrealistic to assume the existence of the infallible master that is able to coordinate the activities of multitudes of workers. Large-scale distributed systems are inherently dynamic and are subject to perturbations, such as failures of computers and network links, thus it is also necessary to consider fully distributed peer-to-peer solutions. We present a study of cooperative computing with the focus on modeling distributed computing settings, algorithmic techniques enabling one to combine efficiency and fault-tolerance in distributed systems, and the exposition of trade-offs between efficiency and fault-tolerance for robust cooperative computing. The focus of the exposition is on the abstract problem, called Do-All, and formulated in terms of a system of cooperating processors that together need to perform a collection of tasks in the presence of adversity. Our presentation deals with models, algorithmic techniques, and analysis. Our goal is to present the most interesting approaches to algorithm design and analysis leading to many fundamental results in cooperative distributed computing. The algorithms selected for inclusion are among the most efficient that additionally serve as good pedagogical examples. Each chapter concludes with exercises and bibliographic notes that include a wealth of references to related work and relevant advanced results. Table of Contents: Introduction / Distributed Cooperation and Adversity / Paradigms and Techniques / Shared-Memory Algorithms / Message-Passing Algorithms / The Do-All Problem in Other Settings / Bibliography / Authors' Biographies

This book constitutes the thoroughly refereed post-conference proceedings of the 13th International Conference on Information Security and Cryptology, Inscrypt 2017, held in Xi'an, China, in November 2017. The 27 revised full papers presented together with 5 keynote speeches were carefully reviewed and selected from 80 submissions. The papers are organized in the following topical sections: cryptographic protocols and algorithms; digital signatures; encryption; cryptanalysis and attack; and applications.

This book constitutes the thoroughly refereed post-conference proceedings of the 16th International Conference on Smart Card Research and Advanced Applications, CARDIS 2017, held in Lugano, Switzerland, in November 2017.The 14 revised full papers presented together with 2 abstracts of invited talks in this book were carefully reviewed and selected from 48 submissions. CARDIS has provided a space for security experts from industry and academia to exchange on security of smart cards and related applications.

This book constitutes the refereed proceedings of the 10th International Conference on Security, Privacy and Anonymity in Computation, Communication, and Storage, SpaCCS 2017, held in Guangzhou, China, in December 2017. The 47 papers presented in this volume were carefully reviewed and selected from 140 submissions. They deal with research findings, achievements, innovations and perspectives in information security and related fields covering topics such as security algorithms and architectures, privacy-aware policies, regulations and techniques, anonymous computation and communication, encompassing fundamental theoretical approaches, practical experimental projects, and commercial application systems for computation, communication and storage.

Wireless sensor networks are about to be part of everyday life. Homes and workplaces capable of self-controlling and adapting air-conditioning for different temperature and humidity levels, sleepless forests ready to detect and react in case of a fire, vehicles able to avoid sudden obstacles or possibly able to self-organize routes to avoid congestion, and so on, will probably be commonplace in the very near future. Mobility plays a central role in such systems and so does passive mobility, that is, mobility of the network stemming from the environment itself. The population protocol model was an intellectual invention aiming to describe such systems in a minimalistic and analysis-friendly way. Having as a starting-point the inherent limitations but also the fundamental establishments of the population protocol model, we try in this monograph to present some realistic and practical enhancements that give birth to some new and surprisingly powerful (for these kind of systems) computational models. Table of Contents: Population Protocols / The Computational Power of Population Protocols / Enhancing the model / Mediated Population Protocols and Symmetry / Passively Mobile Machines that Use Restricted Space / Conclusions and Open Research Directions / Acronyms / Authors' Biographies