Precise Round Complexity Analysis in Secure Computation 🔐
Discover the latest insights into the exact number of rounds needed for secure computation, based on Eurocrypt 2016 research by Garg, Mukherjee, Pandey, and Polychroniadou. Enhance your understanding of cryptographic efficiency!
IACR
211 views • Jun 7, 2016
About this video
Eurocrypt 2016. Sanjam Garg and Pratyay Mukherjee and Omkant Pandey and Antigoni Polychroniadou. See http://www.iacr.org/cryptodb/data/paper.php?pubkey=27619
Video Information
Views
211
Duration
23:30
Published
Jun 7, 2016
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now