<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Daniel Ellard</style></author><author><style face="normal" font="default" size="100%">David Alpert</style></author><author><style face="normal" font="default" size="100%">Ognjen Kavazovic</style></author><author><style face="normal" font="default" size="100%">Marc Scheff</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Receipt-Free Secure Elections</style></title><secondary-title><style face="normal" font="default" size="100%">6.857 Final Project</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">distrib</style></keyword><keyword><style  face="normal" font="default" size="100%">Security</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">1998</style></year><pub-dates><date><style  face="normal" font="default" size="100%">December 1998</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.eecs.harvard.edu/syrah/papers/6857-98/</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">This paper begins by describing Benaloh and Tuinstra's protocol for receipt-free elections, and then shows how this protocol, although correct, makes unrealistic assumptions and is impractical to implement.  We then show how to modify this protocol to make it very practical to implement, by adding an additional &quot;uncoercible&quot; party to the protocol. </style></abstract></record></records></xml>