next up previous contents
Next: 2.2.1.1 Shamir Secret Sharing Up: 2.2 Cryptographic Foundations Previous: 2.2 Cryptographic Foundations

2.2.1 Secret Sharing

One key part of all of our voting protocols are methods to allow for secure distributed computation. Here we outline three results which have proven useful in designing voting protocols. Please note that all computations below are carried out over a finite field F.



 

Ken Shan (ken@digitas.harvard.edu), 1998-05-15