Shortcuts
Top of page (Alt+0)
Page content (Alt+9)
Page menu (Alt+8)
Your browser does not support javascript, some WebOpac functionallity will not be available.
.
Default
.
PageMenu
-
Main Menu
-
Simple Search
.
Advanced Search
.
Journal Search
.
Refine Search Results
.
Preferences
.
Search Menu
Simple Search
.
Advanced Search
.
New Items Search
.
Journal Search
.
Refine Search Results
.
Bottom Menu
Help
Italian
.
English
.
German
.
New Item Menu
New Items Search
.
New Items List
.
Links
SISSA Library
.
ICTP library
.
Italian National web catalog (SBN)
.
Trieste University web catalog
.
Udine University web catalog
.
© LIBERO v6.4.1sp220816
Page content
You are here
:
Catalogue Display
Catalogue Display
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
.
Bookmark this Record
Catalogue Record 46111
.
.
Author info on Wikipedia
.
.
LibraryThing
.
.
Google Books
.
.
Amazon Books
.
Catalogue Information
Catalogue Record 46111
.
Reviews
Catalogue Record 46111
.
British Library
Resolver for RSN-46111
Google Scholar
Resolver for RSN-46111
WorldCat
Resolver for RSN-46111
Catalogo Nazionale SBN
Resolver for RSN-46111
GoogleBooks
Resolver for RSN-46111
ICTP Library
Resolver for RSN-46111
.
Share Link
Jump to link
Catalogue Information
Field name
Details
Dewey Class
511.6
Title
Modern Cryptography, Probabilistic Proofs and Pseudorandomness ([EBook] /) / by Oded Goldreich.
Author
Goldreich, Oded
Other name(s)
SpringerLink (Online service)
Publication
Berlin, Heidelberg : : Springer Berlin Heidelberg : : Imprint: Springer, , 1999.
Physical Details
XV, 183 p. 1 illus. : online resource.
Series
Algorithms and Combinatorics
0937-5511 ; ; 17
ISBN
9783662125212
Summary Note
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.:
Contents note
1. The Foundations of Modern Cryptography -- 2. Probabilistic Proof Systems -- 3. Pseudorandom Generators -- A. Background on Randomness and Computation -- A.1 Probability Theory — Three Inequalities -- A.2 Computational Models and Complexity Classes -- A.2.1 P, NP, and More -- A.2.2 Probabilistic Polynomial-Time -- A.2.3 Non-Uniform Polynomial-Time -- A.2.4 Oracle Machines -- A.2.5 Space Bounded Machines -- A.2.6 Average-Case Complexity -- A.3 Complexity Classes — Glossary -- A.4 Some Basic Cryptographic Settings -- A.4.1 Encryption Schemes -- A.4.2 Digital Signatures and Message Authentication -- A.4.3 The RSA and Rabin Functions -- B. Randomized Computations -- B.1 Randomized Algorithms -- B.1.1 Approx. Counting of DNF Satisfying Assignments -- B.1.2 Finding a Perfect Matching -- B.1.3 Testing Whether Polynomials Are Identical -- B.1.4 Randomized Rounding Applied to MaxSAT -- B.1.5 Primality Testing -- B.1.6 Testing Graph Connectivity via a Random Walk -- B.1.7 Finding Minimum Cuts in Graphs -- B.2 Randomness in Complexity Theory -- B.2.1 Reducing (Approximate) Counting to Deciding -- B.2.2 Two-sided Error Versus One-sided Error -- B.2.3 The Permanent: Worst-Case vs Average Case -- B.3 Randomness in Distributed Computing -- B.3.1 Testing String Equality -- B.3.2 Routing in Networks -- B.3.3 Byzantine Agreement -- B.4 Bibliographic Notes -- C. Two Proofs -- C.1 Parallel Repetition of Interactive Proofs -- C.2 A Generic Hard-Core Predicate -- C.2.1 A Motivating Discussion -- C.2.2 Back to the Formal Argument -- D. Related Surveys by the Author.
System details note
Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site
http://dx.doi.org/10.1007/978-3-662-12521-2
Links to Related Works
Subject References:
Combinatorics
.
Computer Science
.
Computers
.
Data Encryption
.
Data encryption (Computer science)
.
Mathematics
.
Mathematics of Computing
.
Probabilities
.
Probability theory and stochastic processes
.
Theory of Computation
.
Authors:
Goldreich, Oded
.
Corporate Authors:
SpringerLink (Online service)
.
Series:
Algorithms and Combinatorics
.
Classification:
511.6
.
.
ISBD Display
Catalogue Record 46111
.
Tag Display
Catalogue Record 46111
.
Related Works
Catalogue Record 46111
.
Marc XML
Catalogue Record 46111
.
Add Title to Basket
Catalogue Record 46111
.
Catalogue Information 46111
Beginning of record
.
Catalogue Information 46111
Top of page
.
Download Title
Catalogue Record 46111
Export
This Record
As
Labelled Format
Bibliographic Format
ISBD Format
MARC Format
MARC Binary Format
MARCXML Format
User-Defined Format:
Title
Author
Series
Publication Details
Subject
To
File
Email
Reviews
This item has not been rated.
Add a Review and/or Rating
46111
1
46111
-
2
46111
-
3
46111
-
4
46111
-
5
46111
-
Quick Search
Search for