Efficient 1-Out-of-n Oblivious Transfer Schemes with Universally Usable Parameters
IEEE Transactions on Computers
Three voting protocols: ThreeBallot, VAV, and twin
EVT'07 Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology
Secret-Ballot Receipts: True Voter-Verifiable Elections
IEEE Security and Privacy
The alignment problem of visual cryptography schemes
Designs, Codes and Cryptography
EVT'08 Proceedings of the conference on Electronic voting technology
Fingerprinting Blank Paper Using Commodity Scanners
SP '09 Proceedings of the 2009 30th IEEE Symposium on Security and Privacy
A practical voter-verifiable election scheme
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Prêt à voter with confirmation codes
EVT/WOTE'11 Proceedings of the 2011 conference on Electronic voting technology/workshop on trustworthy elections
Using Prêt à Voter in Victorian state elections
EVT/WOTE'12 Proceedings of the 2012 international conference on Electronic Voting Technology/Workshop on Trustworthy Elections
Single layer optical-scan voting with fully distributed trust
VoteID'11 Proceedings of the Third international conference on E-Voting and Identity
| Hi-index | 0.01 |
We consider the problem of how to print a human-readable message, or image, on a piece of paper, while simultaneously preventing the participating printing agents or devices from learning its contents. We examine the problem in two settings: with a trusted dealer who knows the message, and in a distributed scenario that allows two non-colluding printers to obliviously generate the secret message and print it without ever learning it. We present a basic protocol for printing arbitrary-length messages in the trusted dealer model, as well as protocols for printing diffierent types of messages in the distributed model: a randomly selected element from a set, a random permutation of elements in a set, and an optimization for printing alphanumeric characters using 16- segment display logic.