|
|
|
|
LEADER |
03116nam a22004695i 4500 |
001 |
978-3-319-57048-8 |
003 |
DE-He213 |
005 |
20170405141650.0 |
007 |
cr nn 008mamaa |
008 |
170405s2017 gw | s |||| 0|eng d |
020 |
|
|
|a 9783319570488
|9 978-3-319-57048-8
|
024 |
7 |
|
|a 10.1007/978-3-319-57048-8
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA76.9.D35
|
072 |
|
7 |
|a UMB
|2 bicssc
|
072 |
|
7 |
|a URY
|2 bicssc
|
072 |
|
7 |
|a COM031000
|2 bisacsh
|
082 |
0 |
4 |
|a 005.74
|2 23
|
245 |
1 |
0 |
|a Tutorials on the Foundations of Cryptography
|h [electronic resource] :
|b Dedicated to Oded Goldreich /
|c edited by Yehuda Lindell.
|
264 |
|
1 |
|a Cham :
|b Springer International Publishing :
|b Imprint: Springer,
|c 2017.
|
300 |
|
|
|a XV, 450 p. 26 illus., 5 illus. in color.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Information Security and Cryptography,
|x 1619-7100
|
505 |
0 |
|
|a Garbled 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.
|
520 |
|
|
|a This 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.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Data structures (Computer science).
|
650 |
|
0 |
|a Computers.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Data Structures, Cryptology and Information Theory.
|
650 |
2 |
4 |
|a Theory of Computation.
|
700 |
1 |
|
|a Lindell, Yehuda.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783319570471
|
830 |
|
0 |
|a Information Security and Cryptography,
|x 1619-7100
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-319-57048-8
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
950 |
|
|
|a Computer Science (Springer-11645)
|