Candidate Multilinear Maps (Hardcover)

The aim of cryptography is to design primitives and protocols that withstand adversarial behavior. Information theoretic cryptography, how-so-ever desirable, is extremely restrictive and most non-trivial cryptographic tasks are known to be information theoretically impossible. In order to realize sophisticated cryptographic primitives, we forgo information theoretic security and assume limitations on what can be efficiently computed. In other words we attempt to build secure systems conditioned on some computational intractability assumption such as factoring, discrete log, decisional Diffie-Hellman, learning with errors, and many more. In this work, based on the 2013 ACM Doctoral Dissertation Award-winning thesis, we put forth new plausible lattice-based constructions with properties that approximate the sought after multilinear maps. The multilinear analog of the decision Diffie-Hellman problem appears to be hard in our construction, and this allows for their use in cryptography. These constructions open doors to providing solutions to a number of important open problems.

General

Imprint:	Morgan and Claypool Life Sciences
Country of origin:	United States
Series:	ACM Books
Release date:	March 2015
Authors:	Sanjam Garg
Dimensions:	235 x 191 x 13mm (L x W x T)
Format:	Hardcover - Cloth over boards
Pages:	122
ISBN-13:	978-1-62705-549-9
Categories:	Books > Computing & IT > General theory of computing > General Books > Computing & IT > Computer communications & networking > Network security Books > Computing & IT > Applications of computing > Databases > Data security & data encryption Promotions
LSN:	1-62705-549-5
Barcode:	9781627055499

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!