Unlocking Multi-Key Functional Encryption: A Breakthrough with Polynomial Loss πŸ”

Join UC Berkeley's Akshayaram Srinivasan as he explores innovative techniques to extend single-key to multi-key functional encryption, minimizing polynomial loss. A must-watch for cryptography enthusiasts!

Unlocking Multi-Key Functional Encryption: A Breakthrough with Polynomial Loss πŸ”
Rutgers University
391 views β€’ Apr 24, 2017
Unlocking Multi-Key Functional Encryption: A Breakthrough with Polynomial Loss πŸ”

About this video

Akshayaram Srinivasan of UC Berkeley presents a talk "Single-Key to Multi-key Functional Encryption With Polynomial Loss" at the DIMACS/CEF Workshop on Cryptography and Software Obfuscation event.

http://dimacs.rutgers.edu/Workshops/Obfuscation/

The workshop was held from Tuesday, November 8, 2016 to Wednesday November 9, 2016 at the Bechtel Conference Center at Stanford University.

Video Information

Views

391

Likes

5

Duration

33:21

Published

Apr 24, 2017

Related Trending Topics

LIVE TRENDS

Related trending topics. Click any trend to explore more videos.