Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Learn about succinct Learning With Errors (LWE) assumptions and their cryptographic applications in this 57-minute conference talk from the Simons Institute. Explore how lattice-based cryptographic assumptions can be enhanced with "hints" to create more efficient constructions, with particular focus on obfuscation techniques. Discover the theoretical foundations of succinct LWE, understand how hints can be incorporated into lattice problems to improve efficiency while maintaining security, and examine practical applications in modern cryptography including program obfuscation schemes.
