Turbo Code Applications: a journey from a paper to realization presents c- temporary applications of turbo codes in thirteen technical chapters. Each chapter focuses on a particular communication technology utilizing turbo codes, and they are written by experts who have been working in related th areas from around the world. This book is published to celebrate the 10 year anniversary of turbo codes invention by Claude Berrou Alain Glavieux and Punya Thitimajshima (1993-2003). As known for more than a decade, turbo code is the astonishing error control coding scheme which its perf- mance closes to the Shannon's limit. It has been honored consequently as one of the seventeen great innovations during the ?rst ?fty years of information theory foundation. With the amazing performance compared to that of other existing codes, turbo codes have been adopted into many communication s- tems and incorporated with various modern industrial standards. Numerous research works have been reported from universities and advance companies worldwide. Evidently, it has successfully revolutionized the digital commu- cations. Turbo code and its successors have been applied in most communications startingfromthegroundorterrestrialsystemsofdatastorage, ADSLmodem, and ?ber optic communications. Subsequently, it moves up to the air channel applications by employing to wireless communication systems, and then ?ies up to the space by using in digital video broadcasting and satellite com- nications. Undoubtedly, with the excellent error correction potential, it has been selected to support data transmission in space exploring system as well.

Rapid formation and development of new theories of systems science have become an important part of modern science and technology. For - ample, since the 1940s, there have appeared systems theory, information theory, fuzzy mathematics, cybernetics, dissipative structures, synergetics, catastrophe theory, chaos theory, bifurcations, ultra circulations, dynamics, and many other systems theories. Grey systems theory is also one of such systems theories that appeared initially in the 1980s. When the research of systems science and the method and technology of systems engineering are applied in various traditional disciplines, such as management science, decision science, and various scienti?c disciplines, a whole new group of new results and breakthroughs are obtained. Such a historical background has provided the environment and soil for grey systems theory to form and to develop rapidly in the past 20-plus years. More speci?cally, in 1982, Professor Deng Ju-Long published the ?rst research paper in the area of grey systems in the international journal entitled Systems and Control Letters, published by North-Holland Co. His paper was titled "Control Problems of Grey Systems. " The publication of this paper signalled the birth of grey systems theory after many years of e ective research of the founding father. This new theory soon caught the attention of the international academic community and practitioners of science. Many well-known scholars, such as Chinese academicians Qian Xueshen, Song Jian, and Zhang Zhongjun. Professor Roger W.

This book focuses on the analysis and design of low-density parity-check (LDPC) coded modulations, which are becoming part of several current and future communication systems, such as high-throughput terrestrial and satellite wireless networks. In this book, a two-sided perspective on the design of LDPC coded systems is proposed, encompassing both code/modulation optimization (transmitter side) and detection algorithm design (receiver side). After introducing key concepts on error control coding, in particular LDPC coding, and detection techniques, the book presents several relevant applications. More precisely, by using advanced performance evaluation techniques, such as extrinsic information transfer charts, the optimization of coded modulation schemes are considered for (i) memoryless channels, (ii) dispersive and partial response channels, and (iii) concatenated systems including differential encoding. This book is designed to be used by graduate students working in the field of communication theory, with particular emphasis on LDPC coded communication schemes, and industry experts working on related fields.

Information and Its Role in Nature presents an in-depth interdisciplinary discussion of the concept of information and its role in the control of natural processes. After a brief review of classical and quantum information theory, the author addresses numerous central questions, including: Is information reducible to the laws of physics and chemistry? Does the Universe, in its evolution, constantly generate new information? Or are information and information-processing exclusive attributes of living systems, related to the very definition of life? If so, what is the role of information in classical and quantum physics? In what ways does information-processing in the human brain bring about self-consciousness? Accessible to graduate students and professionals from all scientific disciplines, this stimulating book will help to shed light on many controversial issues at the heart of modern science.

Information is precious. It reduces our uncertainty in making decisions. Knowledge about the outcome of an uncertain event gives the possessor an advantage. It changes the course of lives, nations, and history itself. Information is the food of Maxwell's demon. His power comes from know ing which particles are hot and which particles are cold. His existence was paradoxical to classical physics and only the realization that information too was a source of power led to his taming. Information has recently become a commodity, traded and sold like or ange juice or hog bellies. Colleges give degrees in information science and information management. Technology of the computer age has provided access to information in overwhelming quantity. Information has become something worth studying in its own right. The purpose of this volume is to introduce key developments and results in the area of generalized information theory, a theory that deals with uncertainty-based information within mathematical frameworks that are broader than classical set theory and probability theory. The volume is organized as follows."

Coordinated Multiuser Communications provides for the first time a unified treatment of multiuser detection and multiuser decoding in a single volume.

Many communications systems, such as cellular mobile radio and wireless local area networks, are subject to multiple-access interference, caused by a multitude of users sharing a common transmission medium. The performance of receiver systems in such cases can be greatly improved by the application of joint detection and decoding methods. Multiuser detection and decoding not only improve system reliability and capacity, they also simplify the problem of resource allocation.

Coordinated Multiuser Communications provides the reader with tools for the design and analysis of joint detection and joint decoding methods. These methods are developed within a unified framework of linear multiple-access channels, which includes code-division multiple-access, multiple antenna channels and orthogonal frequency division multiple access.

Emphasis is placed on practical implementation aspects and modern iterative processing techniques for systems both with, and without integrated error control coding.

Focusing on the theory and practice of unifying accessing and transmission aspects of communications, this book is a valuable reference for students, researchers and practicing engineers.

Noisy data appear very naturally in applications where the authentication is based on physical identifiers. This book provides a self-contained overview of the techniques and applications of security based on noisy data. It provides a comprehensive overview of the theory of extracting cryptographic keys from noisy data, and describes applications in the field of biometrics, secure key storage, and anti-counterfeiting.

One of the grand challenges for computational intelligence and biometrics is to understand how people process and recognize faces and to develop automated and reliable face recognition systems. Biometrics has become the major component in the complex decision making process associated with security applications. The many challenges addressed for face detection and authentication include cluttered environments, occlusion and disguise, temporal changes, and last but not least, robust training and open set testing.

Reliable Face Recognition Methods seeks to comprehensively address the face recognition problem while drawing inspiration and gaining new insights from complementary fields of endeavor such as neurosciences, statistics, signal and image processing, computer vision, and machine learning and data mining. The book examines the evolution of research surrounding the field to date, explores new directions, and offers specific guidance on the most promising venues for future R&D.

With its well-focused approach and clarity of presentation, this new text/reference is an excellent resource for computer scientists and engineers, researchers, and professionals who need to learn about face recognition. In addition, the book is ideally suited to students studying biometrics, pattern recognition, and human-computer interaction.

Coding is an highly integral component of viable and efficient computer and data communications, yet the often heavy mathematics that form the basis of coding can prevent a serious and practical understanding of this important area.

"Coding for Data and Computer Communications" eschews the complex mathematics and clearly describes the core concepts, principles, and methods of channel codes ( for error correction), source codes (for compressing data), and secure codes (for cryptography, data hiding, and privacy). Conveniently organized and segmented into three associated parts for these coding types, the book examines the most important approaches and techniques used to make the storage and transmission of information (data) fast, secure, and reliable.

Topics and features:

*Integrates the disciplines of error control, data compression, and cryptography and data hiding

*Presents material in a logical, clear, and lively way for rapid learning

*Highly inclusive, balanced coverage for specialists and nonspecialists

*Contains a chapter on the rarely covered topic of check digits

*Provides numerous examples, illustrations, and other helpful learning aids

An essential resource and monograph for all security researchers and professionals who need to understand and effectively use coding employed in computers and data communications. Anchored by a clear, nonmathematical exposition, the book presents all the major topics, principles, and methods in an accessible style suitable for professional specialists, nonspecialists, students, and individual self-study.

This book introduces turbo error correcting concept in a simple language, including a general theory and the algorithms for decoding turbo-like code. It presents a unified framework for the design and analysis of turbo codes and LDPC codes and their decoding algorithms.

A major focus is on high speed turbo decoding, which targets applications with data rates of several hundred million bits per second (Mbps).

Reflects recent developments in its emphasis on randomized and approximation algorithms and communication models

All topics are considered from an algorithmic point of view stressing the implications for algorithm design

This edition has been called startlingly up-to-date, and in this corrected second printing you can be sure that it 's even more contemporaneous. It surveys from a unified point of view both the modern state and the trends of continuing development in various branches of number theory. Illuminated by elementary problems, the central ideas of modern theories are laid bare. Some topics covered include non-Abelian generalizations of class field theory, recursive computability and Diophantine equations, zeta- and L-functions. This substantially revised and expanded new edition contains several new sections, such as Wiles' proof of Fermat's Last Theorem, and relevant techniques coming from a synthesis of various theories.

Understanding distributed computing is not an easy task. This is due to the many facets of uncertainty one has to cope with and master in order to produce correct distributed software. A previous book Communication and Agreement Abstraction for Fault-tolerant Asynchronous Distributed Systems (published by Morgan & Claypool, 2010) was devoted to the problems created by crash failures in asynchronous message-passing systems. The present book focuses on the way to cope with the uncertainty created by process failures (crash, omission failures and Byzantine behavior) in synchronous message-passing systems (i.e., systems whose progress is governed by the passage of time). To that end, the book considers fundamental problems that distributed synchronous processes have to solve. These fundamental problems concern agreement among processes (if processes are unable to agree in one way or another in presence of failures, no non-trivial problem can be solved). They are consensus, interactive consistency, k-set agreement and non-blocking atomic commit. Being able to solve these basic problems efficiently with provable guarantees allows applications designers to give a precise meaning to the words ""cooperate"" and ""agree"" despite failures, and write distributed synchronous programs with properties that can be stated and proved. Hence, the aim of the book is to present a comprehensive view of agreement problems, algorithms that solve them and associated computability bounds in synchronous message-passing distributed systems. Table of Contents: List of Figures / Synchronous Model, Failure Models, and Agreement Problems / Consensus and Interactive Consistency in the Crash Failure Model / Expedite Decision in the Crash Failure Model / Simultaneous Consensus Despite Crash Failures / From Consensus to k-Set Agreement / Non-Blocking Atomic Commit in Presence of Crash Failures / k-Set Agreement Despite Omission Failures / Consensus Despite Byzantine Failures / Byzantine Consensus in Enriched Models

The ubiquitous nature of the Internet is enabling a new generation of - pUcations to support collaborative work among geographically distant users. Security in such an environment is of utmost importance to safeguard the pri vacy of the communication and to ensure the integrity of the applications. 'Secure group communications' (SGC) refers to a scenario in which a group of participants can receive and send messages to group members, in a way that outsiders are unable to glean any information even when they are able to intercept the messages. SGC is becoming extremely important for researchers and practitioners because many applications that require SGC are now widely used, such as teleconferencing, tele-medicine, real-time information services, distributed interactive simulations, collaborative work, grid computing, and the deployment of VPN (Virtual Private Networks). Even though considerable research accomplishments have been achieved in SGC, few books exist on this very important topic. The purpose of this book is to provide a comprehensive survey of principles and state-of-the-art techniques for secure group communications over data net works. The book is targeted towards practitioners, researchers and students in the fields of networking, security, and software applications development. The book consists of 7 chapters, which are listed and described as follows."

This reference work looks at modern concepts of computer security. It introduces the basic mathematical background necessary to follow computer security concepts before moving on to modern developments in cryptography. The concepts are presented clearly and illustrated by numerous examples. Subjects covered include: private-key and public-key encryption, hashing, digital signatures, authentication, secret sharing, group-oriented cryptography, and many others. The section on intrusion detection and access control provide examples of security systems implemented as a part of operating system. Database and network security is also discussed. The final chapters introduce modern e- business systems based on digital cash.

The Third International Conference on Network Security and Applications (CNSA-2010) focused on all technical and practical aspects of security and its applications for wired and wireless networks. The goal of this conference is to bring together researchers and practitioners from academia and industry to focus on understanding modern security threats and countermeasures, and establishing new collaborations in these areas. Authors are invited to contribute to the conference by submitting articles that illustrate research results, projects, survey work and industrial experiences describing significant advances in the areas of security and its applications, including: * Network and Wireless Network Security * Mobile, Ad Hoc and Sensor Network Security * Peer-to-Peer Network Security * Database and System Security * Intrusion Detection and Prevention * Internet Security, and Applications Security and Network Management * E-mail Security, Spam, Phishing, E-mail Fraud * Virus, Worms, Trojon Protection * Security Threats and Countermeasures (DDoS, MiM, Session Hijacking, Replay attack etc. ) * Ubiquitous Computing Security * Web 2. 0 Security * Cryptographic Protocols * Performance Evaluations of Protocols and Security Application There were 182 submissions to the conference and the Program Committee selected 63 papers for publication. The book is organized as a collection of papers from the First International Workshop on Trust Management in P2P Systems (IWTMP2PS 2010), the First International Workshop on Database Management Systems (DMS- 2010), and the First International Workshop on Mobile, Wireless and Networks Security (MWNS-2010).

Modern cryptology increasingly employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research topics in complexity theory are often motivated by questions and problems from cryptology. This book takes account of this situation, and therefore its subject is what may be dubbed "cryptocomplexity'', a kind of symbiosis of these two areas.

This book is written for undergraduate and graduate students of computer science, mathematics, and engineering, and can be used for courses on complexity theory and cryptology, preferably by stressing their interrelation. Moreover, it may serve as a valuable source for researchers, teachers, and practitioners working in these fields. Starting from scratch, it works its way to the frontiers of current research in these fields and provides a detailed overview of their history and their current research topics and challenges.

Over the last decade, we have witnessed a growing dependency on information technologyresultingina wide rangeofnew opportunities. Clearly, ithas become almost impossible to imagine life without a personal computer or laptop, or without a cell phone. Social network sites (SNS) are competing with face-- face encounters and may even oust them. Most SNS-adepts have hundreds of "friends," happily sharing pictures and pro?les and endless chitchat. We are on the threshold of the Internet of Things, where every object will have its RFID-tag. This will not only e?ect companies, who will be able to optimize their production and delivery processes, but also end users, who will be able to enjoy many new applications, ranging from smart shopping, and smart fridges to geo-localized services. In the near future, elderly people will be able to stay longer at home due to clever health monitoring systems. The sky seems to be the limit However, we have also seen the other side of the coin: viruses, Trojan horses, breaches of privacy, identity theft, and other security threats. Our real and virtual worlds are becoming increasingly vulnerable to attack. In order to encouragesecurity researchby both academia and industry and to stimulate the dissemination of results, conferences need to be organized. With the 11th edition of the joint IFIP TC-6 TC-11 Conference on C- munications and Multimedia Security (CMS 2010), the organizers resumed the tradition of previous CMS conferences after a three-year recess.

Understanding distributed computing is not an easy task. This is due to the many facets of uncertainty one has to cope with and master in order to produce correct distributed software. Considering the uncertainty created by asynchrony and process crash failures in the context of message-passing systems, the book focuses on the main abstractions that one has to understand and master in order to be able to produce software with guaranteed properties. These fundamental abstractions are communication abstractions that allow the processes to communicate consistently (namely the register abstraction and the reliable broadcast abstraction), and the consensus agreement abstractions that allows them to cooperate despite failures. As they give a precise meaning to the words "communicate" and "agree" despite asynchrony and failures, these abstractions allow distributed programs to be designed with properties that can be stated and proved. Impossibility results are associated with these abstractions. Hence, in order to circumvent these impossibilities, the book relies on the failure detector approach, and, consequently, that approach to fault-tolerance is central to the book. Table of Contents: List of Figures / The Atomic Register Abstraction / Implementing an Atomic Register in a Crash-Prone Asynchronous System / The Uniform Reliable Broadcast Abstraction / Uniform Reliable Broadcast Abstraction Despite Unreliable Channels / The Consensus Abstraction / Consensus Algorithms for Asynchronous Systems Enriched with Various Failure Detectors / Constructing Failure Detectors

TheseproceedingscontainthepapersselectedforpresentationatCARDIS 2010, the 9th IFIP Conference on Smart Card Research and Advanced Application hosted by the Institute of IT-Security and Security Law (ISL) of the University ofPassau, Germany.CARDISisorganizedbyIFIPWorkingGroupsWG8.8and WG 11.2. Since 1994, CARDIS has been the foremost international conference dedicated to smart card research and applications. Every second year leading researchers and practitioners meet to present new ideas and discuss recent - velopments in smart card technologies. Thefastevolutioninthe?eldofinformationsecurityrequiresadequatemeans for representing the user in human-machine interactions. Smart cards, and by extension smart devices with their processing power and their direct association with the user, are considered the ?rst choice for this purpose. A wide range of areas including hardware design, operating systems, systems modelling, cr- tography, and distributed systems contribute to this fast-growing technology. The submissions to CARDIS were reviewed by at least three members of the ProgramCommittee, followedbyatwo-weekdiscussionphaseheldelectronically, wherecommittee memberscouldcomment onall papersand allreviews.Finally, 16 papers were selected for presentation at CARDIS. There aremany volunteerswho o?ered their time and energy to put together the symposium and who deserve our acknowledgment. We want to thank all the members of the Program Committee and the external reviewers for their hard work in evaluating and discussing the submissions. We are also very grateful to JoachimPosegga, the GeneralChairof CARDIS 2010, andhisteam for thelocal conference management. Last, but certainly not least, our thanks go to all the authors who submitted papers and all the attendees. We hope you ?nd the proceedings stimulat

Mobile agent computing is being used in fields as diverse as artificial intelligence, computational economics and robotics. Agents' ability to adapt dynamically and execute asynchronously and autonomously brings potential advantages in terms of fault-tolerance, flexibility and simplicity. This monograph focuses on studying mobile agents as modelled in distributed systems research and in particular within the framework of research performed in the distributed algorithms community. It studies the fundamental question of how to achieve rendezvous, the gathering of two or more agents at the same node of a network. Like leader election, such an operation is a useful subroutine in more general computations that may require the agents to synchronize, share information, divide up chores, etc. The work provides an introduction to the algorithmic issues raised by the rendezvous problem in the distributed computing setting. For the most part our investigation concentrates on the simplest case of two agents attempting to rendezvous on a ring network. Other situations including multiple agents, faulty nodes and other topologies are also examined. An extensive bibliography provides many pointers to related work not covered in the text. The presentation has a distinctly algorithmic, rigorous, distributed computing flavor and most results should be easily accessible to advanced undergraduate and graduate students in computer science and mathematics departments. Table of Contents: Models for Mobile Agent Computing / Deterministic Rendezvous in a Ring / Multiple Agent Rendezvous in a Ring / Randomized Rendezvous in a Ring / Other Models / Other Topologies

The past decade has seen tremendous growth in the demand for biometrics and data security technologies in applications ranging from law enforcement and immigration control to online security. The benefits of biometrics technologies are apparent as they become important technologies for information security of governments, business enterprises, and individuals. At the same time, however, the use of biometrics has raised concerns as to issues of ethics, privacy, and the policy implications of its wi- spread use. The large-scale deployment of biometrics technologies in e-governance, e-security, and e-commerce has required that we launch an international dialogue on these issues, a dialogue that must involve key stakeholders and that must consider the legal, poli- cal, philosophical and cultural aspects of the deployment of biometrics technologies. The Third International Conference on Ethics and Policy of Biometrics and Inter- tional Data Sharing was highly successful in facilitating such interaction among - searchers, policymakers, consumers, and privacy groups. This conference was supported and funded as part of the RISE project in its ongoing effort to develop wide consensus and policy recommendations on ethical, medical, legal, social, cultural, and political concerns in the usage of biometrics and data security technologies. The - tential concerns over the deployment of biometrics systems can be jointly addressed by developing smart biometrics technologies and by developing policies for the - ployment of biometrics technologies that clearly demarcate conflicts of interest - tween stakeholders.

This volume constitutes the refereed proceedings of the 4th International Conference on Information Systems, Technology and Management, ICISTM 2010, held in Bangkok, Thailand, in March 2010. The 28 revised full papers presented together with 3 keynote lectures, 9 short papers, and 2 tutorial papers were carefully reviewed and selected from 86 submissions. The papers are organized in topical sections on information systems, information technology, information management, and applications.

This book constitutes the thoroughly refereed post-conference proceedings of the two international workshops DPM 2009, the 4th International Workshop on Data Privacy Management, and SETOP 2009, the Second International Workshop on Autonomous and Spontaneous Security, collocated with the ESORICS 2009 symposium in St. Malo, France, in September 2009.

The 8 revised full papers for DPM 2009, selected from 23 submissions, presented together with two keynote lectures are accompanied by 9 revised full papers of SETOP 2009; all papers were carefully reviewed and selected for inclusion in the book. The DPM 2009 papers cover topics such as privacy in service oriented architectures, privacy-preserving mechanisms, crossmatching and indistinguishability techniques, privacy policies, and disclosure of information. The SETOP 2009 papers address all current issues within the sope of security policies, identification and privacy, as well as security mechanisms.

It is our pleasure to welcome you to the proceedings of the Second International Symposium on Engineering Secure Software and Systems. This unique event aimed at bringing together researchersfrom softwareen- neering and security engineering, which might help to unite and further develop the two communities in this and future editions. The parallel technical spons- ships from the ACM SIGSAC (the ACM interest group in security) and ACM SIGSOF (the ACM interest group in software engineering) is a clear sign of the importance of this inter-disciplinary research area and its potential. The di?culty of building secure software systems is no longer focused on mastering security technology such as cryptography or access control models. Other important factors include the complexity of modern networked software systems, the unpredictability of practical development life cycles, the intertw- ing of and trade-o? between functionality, security and other qualities, the d- culty of dealing with human factors, and so forth. Over the last years, an entire research domain has been building up around these problems. The conference program included two major keynotes from Any Gordon (Microsoft Research Cambridge) on the practical veri?cation of security pro- cols implementation and Angela Sasse (University College London) on security usability and an interesting blend of research, industry and idea papers.