Limits on the security of coin flips when half the processors are faulty
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Receipt-free secret-ballot elections (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Comparing information without leaking it
Communications of the ACM
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Visual Authentication and Identification
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Stochastic Voting Protocol To Protect Voters Privacy
WIAPP '99 Proceedings of the 1999 IEEE Workshop on Internet Applications
Incoercible multiparty computation
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Achieving oblivious transfer using weakened security assumptions
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Secret-Ballot Receipts: True Voter-Verifiable Elections
IEEE Security and Privacy
Receipt-free mix-type voting scheme: a practical solution to the implementation of a voting booth
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Basing cryptographic protocols on tamper-evident seals
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Six-Card Secure AND and Four-Card Secure XOR
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Plinko: polling with a physical implementation of a noisy channel
Proceedings of the 8th ACM workshop on Privacy in the electronic society
Basing cryptographic protocols on tamper-evident seals
Theoretical Computer Science
Cryptographic and physical zero-knowledge proof systems for solutions of sudoku puzzles
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Secure multiparty computations using a dial lock
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Secure multiparty computations using the 15 puzzle
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Authentication protocols based on low-bandwidth unspoofable channels: A comparative survey
Journal of Computer Security
SIAM Journal on Computing
Attacking paper-based e2e voting systems
Towards Trustworthy Elections
Several weak bit-commitments using seal-once tamper-evident devices
ProvSec'12 Proceedings of the 6th international conference on Provable Security
The five-card trick can be done with four cards
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
| Hi-index | 0.00 |
We propose simple, realistic protocols for polling that allow the responder to plausibly repudiate his response, while at the same time allow accurate statistical analysis of poll results. The protocols use simple physical objects (envelopes or scratch-off cards) and can be performed without the aid of computers. One of the main innovations of this work is the use of techniques from theoretical cryptography to rigorously prove the security of a realistic, physical protocol. We show that, given a few properties of physical envelopes, the protocols are unconditionally secure in the universal composability framework.