Get Free Shipping on orders over $79
Candidate Multilinear Maps : Acm Books - Sanjam Garg

Candidate Multilinear Maps

By: Sanjam Garg

Paperback | 1 March 2015

At a Glance

Paperback


$149.75

or 4 interest-free payments of $37.44 with

 or 

Ships in 10 to 15 business days

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.

More in Computer Science

Empire of AI : Inside the reckless race for total domination - Karen Hao
Python & AI For Dummies - John C. Shovic

RRP $57.95

$44.75

23%
OFF
Co-Intelligence : Living and Working with AI - Ethan Mollick

RRP $36.99

$29.75

20%
OFF
Our Artificial Future : What Generative AI Means for Law and Society - David  Atkinson
Operationalizing Responsible AI - Daniele  Quercia

RRP $56.95

$56.75

Reinforcement Learning Foundations - Aviv  Tamar

RRP $99.95

$89.75

10%
OFF
Dynamics of Marine Structures - Yingguang  Wang

RRP $503.95

$442.99

12%
OFF