The Learning with Rounding Problem: Reductions and Applications

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


Duration: 57:51
635 views
2

In this talk I will survey a recently introduced cryptographic problem called Learning with Rounding (LWR). I will show reductions from and to the more well-established Learning with Errors (LWE) problem, and demonstrate the applicability of LWR to the construction of efficient Pseudorandom Functions and other cryptographic primitives.



Other Videos By Microsoft Research


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
2016-07-07Perceptual Annotation: from Biologically Inspired, to Biologically Informed Machine Learning
2016-07-07Distributed Newton Methods for CTR (Click Through Rate) Prediction
2016-07-07Social Computing Symposium 2016: Architectural Intelligence in the Age Of Social Computing
2016-07-07An Overview of Lattice Reduction Algorithms
2016-07-07Divide & Conquer Methods for Big Data Analytics
2016-07-07Machine Learning Class (Session #1)
2016-07-07Analysis of Cell-Cell Communication Networks in Inflammatory Pathologies
2016-07-07Instrumenting the Healthcare Enterprise
2016-07-07Interpreting Cancer Copy-Number Alterations
2016-07-07Message Passing: Modeling the Flow of Information in Cellular Networks


Tags:
microsoft research