Author:
Publisher:
ISBN: 9780769518220
Category : Computers
Languages : en
Pages : 836
Get Book Here
Book Description
Collects the 77 papers presented during the November 2002 symposium on the mathematical foundations of computing. Among the topics are abstract combinatorial programs and efficient property testers, a lower bound for testing 3-colorability in bounded degree graphs, a spectral algorithm for learning
Author: Sanguthevar Rajasekaran
Publisher: Springer Science & Business Media
ISBN: 9780792369585
Category : Computers
Languages : en
Pages : 554
Get Book Here
Book Description
Author: Lian Li
Publisher: Springer
ISBN: 9811327122
Category : Computers
Languages : en
Pages : 168
Get Book Here
Book Description
This book constitutes the thoroughly refereed proceedings of the National Conference of Theoretical Computer Science, NCTCS 2018, held in Shanghai, China, in October 2018. The 11 full papers presented were carefully reviewed and selected from 31 submissions. They present relevant trends of current research in the area of algorithms and complexity, software theory and method, data science and machine learning theory.
Author: Ronald Cramer
Publisher: Springer
ISBN: 3642289142
Category : Computers
Languages : en
Pages : 669
Get Book Here
Book Description
This book constitutes the thoroughly refereed proceedings of the 9th Theory of Cryptography Conference, TCC 2012, held in Taormina, Sicily, Italy, in March 2012. The 36 revised full papers presented were carefully reviewed and selected from 131 submissions. The papers are organized in topical sections on secure computation; (blind) signatures and threshold encryption; zero-knowledge and security models; leakage-resilience; hash functions; differential privacy; pseudorandomness; dedicated encryption; security amplification; resettable and parallel zero knowledge.
Author: Jonathan Katz
Publisher: Springer
ISBN: 3319637150
Category : Computers
Languages : en
Pages : 738
Get Book Here
Book Description
The three volume-set, LNCS 10401, LNCS 10402, and LNCS 10403, constitutes the refereed proceedings of the 37th Annual International Cryptology Conference, CRYPTO 2017, held in Santa Barbara, CA, USA, in August 2017. The 72 revised full papers presented were carefully reviewed and selected from 311 submissions. The papers are organized in the following topical sections: functional encryption; foundations; two-party computation; bitcoin; multiparty computation; award papers; obfuscation; conditional disclosure of secrets; OT and ORAM; quantum; hash functions; lattices; signatures; block ciphers; authenticated encryption; public-key encryption, stream ciphers, lattice crypto; leakage and subversion; symmetric-key crypto, and real-world crypto.
Author: Arno Mittelbach
Publisher: Springer Nature
ISBN: 3030632873
Category : Computers
Languages : en
Pages : 798
Get Book Here
Book Description
Hash functions are the cryptographer’s Swiss Army knife. Even though they play an integral part in today’s cryptography, existing textbooks discuss hash functions only in passing and instead often put an emphasis on other primitives like encryption schemes. In this book the authors take a different approach and place hash functions at the center. The result is not only an introduction to the theory of hash functions and the random oracle model but a comprehensive introduction to modern cryptography. After motivating their unique approach, in the first chapter the authors introduce the concepts from computability theory, probability theory, information theory, complexity theory, and information-theoretic security that are required to understand the book content. In Part I they introduce the foundations of hash functions and modern cryptography. They cover a number of schemes, concepts, and proof techniques, including computational security, one-way functions, pseudorandomness and pseudorandom functions, game-based proofs, message authentication codes, encryption schemes, signature schemes, and collision-resistant (hash) functions. In Part II the authors explain the random oracle model, proof techniques used with random oracles, random oracle constructions, and examples of real-world random oracle schemes. They also address the limitations of random oracles and the random oracle controversy, the fact that uninstantiable schemes exist which are provably secure in the random oracle model but which become insecure with any real-world hash function. Finally in Part III the authors focus on constructions of hash functions. This includes a treatment of iterative hash functions and generic attacks against hash functions, constructions of hash functions based on block ciphers and number-theoretic assumptions, a discussion of privately keyed hash functions including a full security proof for HMAC, and a presentation of real-world hash functions. The text is supported with exercises, notes, references, and pointers to further reading, and it is a suitable textbook for undergraduate and graduate students, and researchers of cryptology and information security.
Author: Klaus Jansen
Publisher: Springer
ISBN: 354044436X
Category : Computers
Languages : en
Pages : 290
Get Book Here
Book Description
This book constitutes the refereed proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2000, held in Saarbrcken, Germany in September 2000. The 22 revised full papers presented together with four invited contributions were carefully reviewed and selected from 68 submissions. The topics dealt with include design and analysis of approximation algorithms, inapproximibility results, on-line problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and various applications.
Author: Michele Bugliesi
Publisher: Springer
ISBN: 3540359052
Category : Computers
Languages : en
Pages : 752
Get Book Here
Book Description
The two-volume set LNCS 4051 and LNCS 4052 constitutes the refereed proceedings of the 33rd International Colloquium on Automata, Languages and Programming, ICALP 2006, held in Venice, Italy, July 2006. In all, these volumes present more 100 papers and lectures. Volume I (4051) presents 61 revised full papers together with 1 invited lecture, focusing on algorithms, automata, complexity and games, on topics including graph theory, quantum computing, and more.
Author: Gholamreza B. Khosrovshahi
Publisher: Springer
ISBN: 3540458786
Category : Computers
Languages : en
Pages : 230
Get Book Here
Book Description
This book presents the revised final versions of eight lectures given by leading researchers at the First Summer School on Theoretical Aspects of Computer Science in Tehran, Iran, in July 2000. The lectures presented are devoted to quantum computation, approximation algorithms, self-testing/correction, algebraic modeling of data, the regularity lemma, multiple access communication and combinatorial designs, graph-theoretical methods in computer vision, and low-density parity-check codes.
Author: Jos C.M. Baeten
Publisher: Springer
ISBN: 3540450610
Category : Computers
Languages : en
Pages : 1218
Get Book Here
Book Description
The refereed proceedings of the 30th International Colloquium on Automata, Languages and Programming, ICALP 2003, held in Eindhoven, The Netherlands in June/July 2003. The 84 revised full papers presented together with six invited papers were carefully reviewed and selected from 212 submissions. The papers are organized in topical sections on algorithms, process algebra, approximation algorithms, languages and programming, complexity, data structures, graph algorithms, automata, optimization and games, graphs and bisimulation, online problems, verification, the Internet, temporal logic and model checking, graph problems, logic and lambda-calculus, data structures and algorithms, types and categories, probabilistic systems, sampling and randomness, scheduling, and geometric problems.
