000 04402nam a22005417a 4500
003 APU
005 20221028165308.0
007 cr cn |||m|||a
008 220307s2015 nyua fsb 000 0deng d
020 _a9781627055383 (pdf)
020 _a9781627055482 (epub)
020 _z9781627055376
020 _z9781627055499
035 _a(OCoLC)908155895
035 _a(CaBNVSL)swl00404865
040 _aCaBNVSL
_beng
_cAPU
_dSF
050 4 _aQA76.9.A25
_bG37 2015eb
082 0 4 _a005.8
_223
100 1 _aGarg, Sanjam.,
_947388
245 1 0 _aCandidate multilinear maps
_h[electronic resources] /
_cSanjam Garg.
250 _aFirst edition.
260 _a[New York] :
_bAssociation for Computing Machinery,
260 _a[San Rafael, California] :
_bMorgan & Claypool,
_cc2015.
300 _a1 online resources (xi, 108 pages) :
_billustrations.
490 1 _aACM books ;
_v#5
504 _aIncludes bibliographical references (pages 95-108).
505 0 _a1. Introduction -- 1.1 Our results -- 1.2 Brief overview -- 1.3 Organization --
505 8 _a2. Survey of applications -- 2.1 How flexible can we make access to encrypted data? -- 2.2 Program obfuscation -- 2.3 Other applications --
505 8 _a3. Multilinear maps and graded encoding systems -- 3.1 Cryptographic multilinear maps -- 3.1.1 Efficient procedures -- 3.1.2 Hardness assumptions -- 3.2 Graded encoding schemes -- 3.2.1 Efficient procedures, the dream version -- 3.2.2 Efficient procedures, the real-life version -- 3.2.3 Hardness assumptions --
505 8 _a4. Preliminaries I: lattices -- 4.1 Lattices -- 4.2 Gaussians on lattices -- 4.3 Sampling from discrete Gaussian --
505 8 _a5. Preliminaries II: algebraic number theory background -- 5.1 Number fields and rings of integers -- 5.2 Embeddings and geometry -- 5.3 Ideals in the ring of integers -- 5.4 Prime ideals, unique factorization and distributions -- 5.5 Ideal lattices --
505 8 _a6. The new encoding schemes -- 6.1 The basic graded encoding scheme -- 6.2 Setting the parameters -- 6.3 Extensions and variants --
505 8 _a7. Security of our constructions -- 7.1 Our hardness assumption -- 7.2 Simplistic models of attacks -- 7.2.1 Hardness of GCDH in the arithmetic straight-line program model -- 7.3 Cryptanalysis beyond the generic models -- 7.3.1 Easily computable quantities -- 7.3.2 Using averaging attacks -- 7.3.3 Cryptanalysis with extra help -- 7.4 Some countermeasures -- 7.5 Easiness of other problems --
505 8 _a8. Preliminaries III: computation in a number field -- 8.1 Some computational aspects of number fields and ideal lattices -- 8.2 Computational hardness assumptions over number fields --
505 8 _a9. Survey of lattice cryptanalysis -- 9.1 Averaging attacks -- 9.2 Gentry-Szydlo: recovering v from v.v and (v) -- 9.3 Nguyen-Regev: a gradient descent attack -- 9.4 Ducas-Nguyen: gradient descent over zonotopes and deformed parallelepipeds -- 9.5 A new algorithm for the closest principal ideal generator problem -- 9.6 Coppersmith attacks -- 9.7 Dimension halving in principal ideal lattices --
505 8 _a10. One-round key exchange -- 10.1 Definitions -- 10.2 Our construction --
505 8 _aAppendix A. Generalizing graded encoding systems -- Efficient procedures, the dream version -- Efficient procedures, the real-life version -- Hardness assumptions -- Bibliography -- Author's biography.
506 _aAbstract freely available; full-text restricted to subscribers or individual document purchasers.
506 _aOnline version restricted to APU staff and students only.
520 3 _aCryptography to me is "black magic," enabling tasks that often seem paradoxical or simply just impossible. Like the space explorers, we cryptographers often wonder, "What are the boundaries of this world of 'black magic'?" This book lays one of the founding stones in furthering our understanding of these edges.
538 _aMode of access: World Wide Web.
538 _aSystem requirements: Internet connectivity; World Wide Web browser.and Adobe Acrobat Reader.
650 0 _aData encryption (Computer science)
650 0 _aCryptography.
_911359
830 0 _aACM books ;
_v#5.
_947379
856 4 8 _uhttps://dl-acm-org.ezproxy.apu.edu.my/doi/book/10.1145/2714451
_yAvailable in ACM Digital Library. Requires Log In to view full text.
942 _2lcc
_cE-Book
999 _c383688
_d383688