Candidate Multilinear Maps

Channel:
Microsoft Research
Subscribers:
351,000
Published on ● Video Link: https://www.youtube.com/watch?v=4axRH6L6Iiw


Duration: 1:16:23
150 views
0

I will describe plausible lattice-based constructions with properties that approximate the sought-after multilinear maps in hard-discrete-logarithm groups. These new constructions radically enhance our tool set and open a floodgate of applications. I will present some of these applications. (joint work with Craig Gentry and Shai Halevi)



Other Videos By Microsoft Research


2016-07-11Botness 2016 - Day 2, Part 2: Unconference Session Report Backs, Afternoon Short Talks
2016-07-11Botness 2016 - Day 2, Part 1: Morning Rapid Fire Presentations
2016-07-11Botness 2016 - Welcome and Introductions
2016-07-11Botness 2016 - Day 1, Part 3: Unconference Session Report Backs and Audience Choice Talks
2016-07-08Social Computing Symposium 2015: Consequences of Design - Alexis Hope and Catherine D'Ignazio
2016-07-08Social Computing Symposium 2015: Consequences of Crowdsourcing
2016-07-08Long-Range Planning with Time-Inconsistency
2016-07-07Preference Reasoning and Aggregation
2016-07-07Machine Learning Class (Session #17)
2016-07-07Scaling up Extraction Over Entities (and Relations)
2016-07-07Candidate Multilinear Maps
2016-07-07A Crash Course on Model Checking - session 1
2016-07-07Frameworks for Distributed Machine Learning
2016-07-07Lattice Signatures Schemes
2016-07-07Machine Learning Course - Lecture 11
2016-07-07Fast Online Tensor Method for Overlapping Community Detection
2016-07-07Approximate Common Divisors via Lattices
2016-07-07Social Computing Symposium 2016: Post Screen Personas and Listening Machines
2016-07-07Solving Global Challenges Through Diverse Perspectives
2016-07-07Computational Discovery of Directional Pioneer Factors
2016-07-07The Learning with Rounding Problem: Reductions and Applications


Tags:
microsoft research