Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/1669
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLindell, Yehuda. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:31:03Z-
dc.date.available2020-05-17T08:31:03Z-
dc.date.issued2017en_US
dc.identifier.isbn9783319570488 ;en_US
dc.identifier.isbn9783319570471 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/1669-
dc.descriptionen_US
dc.descriptionPrinted edition: ; 9783319570471. ;en_US
dc.descriptionen_US
dc.description005.74 ; 23 ;en_US
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis is a graduate textbook of advanced tutorials on the theory of cryptography and computational complexity. In particular, the chapters explain aspects of garbled circuits, public-key cryptography, pseudorandom functions, one-way functions, homomorphic encryption, the simulation proof technique, and the complexity of differential privacy. Most chapters progress methodically through motivations, foundations, definitions, major results, issues surrounding feasibility, surveys of recent developments, and suggestions for further study. This book honors Professor Oded Goldreich, a pioneering scientist, educator, and mentor. Oded was instrumental in laying down the foundations of cryptography, and he inspired the contributing authors, Benny Applebaum, Boaz Barak, Andrej Bogdanov, Iftach Haitner, Shai Halevi, Yehuda Lindell, Alon Rosen, and Salil Vadhan, themselves leading researchers on the theory of cryptography and computational complexity. The book is appropriate for graduate tutorials and seminars, and for self-study by experienced researchers, assuming prior knowledge of the theory of cryptography. ;en_US
dc.description.statementofresponsibilityedited by Yehuda Lindell.en_US
dc.description.tableofcontentsGarbled Circuits as Randomized Encodings of Functions: A Primer -- The Complexity of Public-Key Cryptography -- Pseudorandom Functions: Three Decades Later -- The Many Entropies in One-Way Functions -- Homomorphic Encryption -- How to Simulate It: A Tutorial on the Simulation Proof Technique -- The Complexity of Differential Privacy. ;en_US
dc.format.extentXV, 450 p. 26 illus., 5 illus. in color. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesInformation Security and Cryptography, ; 1619-7100. ;en_US
dc.relation.ispartofseriesInformation Security and Cryptography, ; 1619-7100. ;en_US
dc.relation.haspart9783319570488.pdfen_US
dc.subjectComputer Scienceen_US
dc.subjectData structures (Computer science). ;en_US
dc.subjectComputersen_US
dc.subjectComputer Scienceen_US
dc.subjectData Structures, Cryptology and Information Theory. ;en_US
dc.subjectTheory of Computation. ;en_US
dc.titleTutorials on the Foundations of Cryptographyen_US
dc.title.alternativeDedicated to Oded Goldreich /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
dc.classification.lcQA76.9.D35 ;en_US
Appears in Collections:مهندسی فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319570488.pdf4.52 MBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLindell, Yehuda. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:31:03Z-
dc.date.available2020-05-17T08:31:03Z-
dc.date.issued2017en_US
dc.identifier.isbn9783319570488 ;en_US
dc.identifier.isbn9783319570471 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/1669-
dc.descriptionen_US
dc.descriptionPrinted edition: ; 9783319570471. ;en_US
dc.descriptionen_US
dc.description005.74 ; 23 ;en_US
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis is a graduate textbook of advanced tutorials on the theory of cryptography and computational complexity. In particular, the chapters explain aspects of garbled circuits, public-key cryptography, pseudorandom functions, one-way functions, homomorphic encryption, the simulation proof technique, and the complexity of differential privacy. Most chapters progress methodically through motivations, foundations, definitions, major results, issues surrounding feasibility, surveys of recent developments, and suggestions for further study. This book honors Professor Oded Goldreich, a pioneering scientist, educator, and mentor. Oded was instrumental in laying down the foundations of cryptography, and he inspired the contributing authors, Benny Applebaum, Boaz Barak, Andrej Bogdanov, Iftach Haitner, Shai Halevi, Yehuda Lindell, Alon Rosen, and Salil Vadhan, themselves leading researchers on the theory of cryptography and computational complexity. The book is appropriate for graduate tutorials and seminars, and for self-study by experienced researchers, assuming prior knowledge of the theory of cryptography. ;en_US
dc.description.statementofresponsibilityedited by Yehuda Lindell.en_US
dc.description.tableofcontentsGarbled Circuits as Randomized Encodings of Functions: A Primer -- The Complexity of Public-Key Cryptography -- Pseudorandom Functions: Three Decades Later -- The Many Entropies in One-Way Functions -- Homomorphic Encryption -- How to Simulate It: A Tutorial on the Simulation Proof Technique -- The Complexity of Differential Privacy. ;en_US
dc.format.extentXV, 450 p. 26 illus., 5 illus. in color. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesInformation Security and Cryptography, ; 1619-7100. ;en_US
dc.relation.ispartofseriesInformation Security and Cryptography, ; 1619-7100. ;en_US
dc.relation.haspart9783319570488.pdfen_US
dc.subjectComputer Scienceen_US
dc.subjectData structures (Computer science). ;en_US
dc.subjectComputersen_US
dc.subjectComputer Scienceen_US
dc.subjectData Structures, Cryptology and Information Theory. ;en_US
dc.subjectTheory of Computation. ;en_US
dc.titleTutorials on the Foundations of Cryptographyen_US
dc.title.alternativeDedicated to Oded Goldreich /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
dc.classification.lcQA76.9.D35 ;en_US
Appears in Collections:مهندسی فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319570488.pdf4.52 MBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLindell, Yehuda. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:31:03Z-
dc.date.available2020-05-17T08:31:03Z-
dc.date.issued2017en_US
dc.identifier.isbn9783319570488 ;en_US
dc.identifier.isbn9783319570471 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/1669-
dc.descriptionen_US
dc.descriptionPrinted edition: ; 9783319570471. ;en_US
dc.descriptionen_US
dc.description005.74 ; 23 ;en_US
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis is a graduate textbook of advanced tutorials on the theory of cryptography and computational complexity. In particular, the chapters explain aspects of garbled circuits, public-key cryptography, pseudorandom functions, one-way functions, homomorphic encryption, the simulation proof technique, and the complexity of differential privacy. Most chapters progress methodically through motivations, foundations, definitions, major results, issues surrounding feasibility, surveys of recent developments, and suggestions for further study. This book honors Professor Oded Goldreich, a pioneering scientist, educator, and mentor. Oded was instrumental in laying down the foundations of cryptography, and he inspired the contributing authors, Benny Applebaum, Boaz Barak, Andrej Bogdanov, Iftach Haitner, Shai Halevi, Yehuda Lindell, Alon Rosen, and Salil Vadhan, themselves leading researchers on the theory of cryptography and computational complexity. The book is appropriate for graduate tutorials and seminars, and for self-study by experienced researchers, assuming prior knowledge of the theory of cryptography. ;en_US
dc.description.statementofresponsibilityedited by Yehuda Lindell.en_US
dc.description.tableofcontentsGarbled Circuits as Randomized Encodings of Functions: A Primer -- The Complexity of Public-Key Cryptography -- Pseudorandom Functions: Three Decades Later -- The Many Entropies in One-Way Functions -- Homomorphic Encryption -- How to Simulate It: A Tutorial on the Simulation Proof Technique -- The Complexity of Differential Privacy. ;en_US
dc.format.extentXV, 450 p. 26 illus., 5 illus. in color. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesInformation Security and Cryptography, ; 1619-7100. ;en_US
dc.relation.ispartofseriesInformation Security and Cryptography, ; 1619-7100. ;en_US
dc.relation.haspart9783319570488.pdfen_US
dc.subjectComputer Scienceen_US
dc.subjectData structures (Computer science). ;en_US
dc.subjectComputersen_US
dc.subjectComputer Scienceen_US
dc.subjectData Structures, Cryptology and Information Theory. ;en_US
dc.subjectTheory of Computation. ;en_US
dc.titleTutorials on the Foundations of Cryptographyen_US
dc.title.alternativeDedicated to Oded Goldreich /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
dc.classification.lcQA76.9.D35 ;en_US
Appears in Collections:مهندسی فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319570488.pdf4.52 MBAdobe PDFThumbnail
Preview File