PPT-The Round Complexity of Verifiable Secret Sharing

ReVisited CRYPTO 2009 Arpita Patra IIT Madras Ashish Choudhary IIT Madras Tal Rabin IBM Research C Pandu Rangan IIT Madras Verifiable Secret Sharing VSS Fundamental

sharing vss statistical wss vss sharing wss statistical reconstruction phase honest parties rounds points degree secret evaluation protocol corrupted

Presentation Embed Code

<iframe width="560" height="315" src="https://www.docslides.com/embed/652326" frameborder="0" allowfullscreen></iframe>

Download Presentation

Download Presentation The PPT/PDF document "The Round Complexity of Verifiable Secre..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.