Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

You can start by putting the DO NOT DISTURB sign. Cay, in Desert Hearts (1985). The interplay between randomness and computation is one of the most fas­ cinating scientific phenomena uncovered in the last couple of decades. This interplay is at the heart of modern cryptography and plays a fundamental role in complexity theory at large. Specifically, the interplay of randomness and computation is pivotal to several intriguing notions of probabilistic proof systems and is the focal of the computational approach to randomness. This book provides an introduction to these three, somewhat interwoven domains (i.e., cryptography, proofs and randomness). Modern Cryptography. Whereas classical cryptography was confined to the art of designing and breaking encryption schemes (or "secrecy codes"), Modern Cryptography is concerned with the rigorous analysis of any system which should withstand malicious attempts to abuse it. We emphasize two aspects of the transition from classical to modern cryptography: ( 1) the wide­ ning of scope from one specific task to an utmost wide general class of tasks; and (2) the move from an engineering-art which strives on ad-hoc tricks to a scientific discipline based on rigorous approaches and techniques.

Mathematical control systems --- cryptografie --- Discrete mathematics --- Computer security. --- Cryptography. --- Sécurité informatique --- Cryptographie --- Sécurité informatique --- Combinatorics. --- Data encryption (Computer science). --- Probabilities. --- Computer science—Mathematics. --- Computers. --- Cryptology. --- Probability Theory and Stochastic Processes. --- Mathematics of Computing. --- Theory of Computation. --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Machine theory --- Calculators --- Cyberspace --- Probability --- Statistical inference --- Combinations --- Mathematics --- Chance --- Least squares --- Mathematical statistics --- Risk --- Data encoding (Computer science) --- Encryption of data (Computer science) --- Computer security --- Cryptography --- Combinatorics --- Algebra --- Mathematical analysis

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This volume contains a collection of studies in the areas of complexity theory and property testing. The 21 pieces of scientific work included were conducted at different times, mostly during the last decade. Although most of these works have been cited in the literature, none of them was formally published before. Within complexity theory the topics include constant-depth Boolean circuits, explicit construction of expander graphs, interactive proof systems, monotone formulae for majority, probabilistically checkable proofs (PCPs), pseudorandomness, worst-case to average-case reductions, and zero-knowledge proofs. Within property testing the topics include distribution testing, linearity testing, lower bounds on the query complexity (of property testing), testing graph properties, and tolerant testing. A common theme in this collection is the interplay between randomness and computation.

Maths for computer scientists. --- Computer networking & communications. --- Computers. --- Computer organization. --- Mathematical statistics. --- Artificial intelligence. --- Computer logic. --- Application software. --- Data structures (Computer science). --- Theory of Computation. --- Computer Systems Organization and Communication Networks. --- Probability and Statistics in Computer Science. --- Logic in AI. --- Information Systems Applications (incl. Internet). --- Data Structures. --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- Electronic data processing --- File organization (Computer science) --- Abstract data types (Computer science) --- Application computer programs --- Application computer software --- Applications software --- Apps (Computer software) --- Computer software --- Computer science logic --- Logic, Symbolic and mathematical --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Mathematics --- Statistical inference --- Statistics, Mathematical --- Statistics --- Probabilities --- Sampling (Statistics) --- Organization, Computer --- Electronic digital computers --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Calculators --- Cyberspace --- Statistical methods --- Computer science. --- Computer engineering. --- Computer networks. --- Computer science—Mathematics. --- Logic programming. --- Information theory. --- Computer Engineering and Networks. --- Computer and Information Systems Applications. --- Data Structures and Information Theory. --- Communication theory --- Communication --- Computer programming --- Communication systems, Computer --- Computer communication systems --- Data networks, Computer --- ECNs (Electronic communication networks) --- Electronic communication networks --- Networks, Computer --- Teleprocessing networks --- Data transmission systems --- Digital communications --- Electronic systems --- Information networks --- Telecommunication --- Cyberinfrastructure --- Network computers --- Computers --- Informatics --- Science --- Distributed processing --- Design and construction

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Cryptography is concerned with the conceptualization, definition and construction of computing systems that address security concerns. The design of cryptographic systems must be based on firm foundations. This book presents a rigorous and systematic treatment of the foundational issues: defining cryptographic tasks and solving new cryptographic problems using existing tools. It focuses on the basic mathematical tools: computational difficulty (one-way functions), pseudorandomness and zero-knowledge proofs. The emphasis is on the clarification of fundamental concepts and on demonstrating the feasibility of solving cryptographic problems, rather than on describing ad-hoc approaches. The book is suitable for use in a graduate course on cryptography and as a reference book for experts. The author assumes basic familiarity with the design and analysis of algorithms; some knowledge of complexity theory and probability is also useful.

Coding theory. --- Cryptography --- Cryptanalysis --- Cryptology --- Secret writing --- Steganography --- Signs and symbols --- Symbolism --- Writing --- Ciphers --- Data encryption (Computer science) --- Data compression (Telecommunication) --- Digital electronics --- Information theory --- Machine theory --- Signal theory (Telecommunication) --- Computer programming --- Mathematics. --- 519.72 --- Coding theory --- 652.8 --- 519.72 Information theory: mathematical aspects --- Information theory: mathematical aspects --- Mathematics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Mathematical logic --- Discrete mathematics --- Computer science --- DES (data encryption standard) --- discrete wiskunde --- informatica --- wiskunde --- algoritmen