Data processing: financial – business practice – management – or co – Automated electrical financial or business practice or... – Voting or election arrangement
Reexamination Certificate
2008-06-17
2008-06-17
Diaz, Susanna M (Department: 3692)
Data processing: financial, business practice, management, or co
Automated electrical financial or business practice or...
Voting or election arrangement
Reexamination Certificate
active
07389250
ABSTRACT:
A facility for conducting a coercion-resistant electronic collection is described. The facility receives from the voter a first voter conformation value. At a later time, the facility receives from the voter an encrypted ballot and a second voter confirmation value. Without regard for the value of the received second voter confirmation value, the facility adds the received ballot to a publicly-available list of cast ballots. After the addition, members of the public are able to verify the addition of the received ballot to the list without being able to determine whether the ballot will be counted. The facility counts the ballot if and only the second voter confirmation value received with the ballot matches the received first voter confirmation value.
REFERENCES:
patent: 4774665 (1988-09-01), Webb
patent: 5278753 (1994-01-01), Graft, III
patent: 5400248 (1995-03-01), Chisholm
patent: 5495532 (1996-02-01), Kilian et al.
patent: 5521980 (1996-05-01), Brands
patent: 5610383 (1997-03-01), Chumbley
patent: 5682430 (1997-10-01), Kilian et al.
patent: 5708714 (1998-01-01), López et al.
patent: 5717759 (1998-02-01), Micali
patent: 5864667 (1999-01-01), Barkan
patent: 5875432 (1999-02-01), Sehr
patent: 5878399 (1999-03-01), Peralto
patent: 5970385 (1999-10-01), Pykalisto
patent: 6021200 (2000-02-01), Fischer
patent: 6081793 (2000-06-01), Challener et al.
patent: 6092051 (2000-07-01), Kilian et al.
patent: 6250548 (2001-06-01), McClure et al.
patent: 6317833 (2001-11-01), Jakobsson
patent: 6317883 (2001-11-01), Marics
patent: 6523115 (2003-02-01), Ono et al.
patent: 6540138 (2003-04-01), Hall et al.
patent: 6550675 (2003-04-01), Davis et al.
patent: 6769613 (2004-08-01), McDermott et al.
patent: 6845447 (2005-01-01), Fujioka et al.
patent: 2001/0034640 (2001-10-01), Chaum
patent: 2002/0077885 (2002-06-01), Karro et al.
patent: 2002/0077887 (2002-06-01), London Shrader et al.
patent: 2002/0133396 (2002-09-01), Barnhart
patent: 2003/0158775 (2003-08-01), Chaum
patent: 2176990 (1996-11-01), None
patent: 0 697 776 (1996-02-01), None
patent: 0 743 620 (1996-11-01), None
patent: 08-263575 (1996-10-01), None
patent: 08-315053 (1996-11-01), None
patent: 10-257047 (1998-09-01), None
patent: 10-285157 (1998-10-01), None
patent: WO92/03805 (1992-03-01), None
patent: WO98/14921 (1998-04-01), None
patent: WO01/22200 (2001-03-01), None
Cranor et al., Design and Implementation of a Practical Security-Conscious Electronic Polling System, Department of Computer Science, Washington University, St. Louis, Missouri, Jan. 23, 1996 [Google].
International Preliminary Examination Report, International Application No. PCT/US01/43962, Jun. 3, 2003, 4 pages.
Benaloh, J., “Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret”, Advances in Cryptology—Crypto 1986, Lecture Notes in Computer Science, pp. 251-260, Springer-Verlag, Berlin, 1987.
Benaloh, J., et al., “Distributing the Power of a Government to Enhance the Privacy of Voters”, ACM Symposium on Principles of Distributed Computing, pp. 52-62, 1986.
Borrell, Joan et al., “An implementable secure voting scheme”,Computers&Security, Elsevier Science, Ltd., Great Britian, 1996, vol. 15, No. 4, pp. 327-338.
Chaum, D, “Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA”, Eurocrypt 1988, pp. 177-182.
Chaum, D., “Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms”, Communications of the ACM, 24(2):84-88, 1981.
Cramer, R, et al., “A Secure and Optimally Efficient Multi-Authority Election Scheme”, Advances in Cryptology—Eurocrypt 1997, Lecture Notes in Computer Science, Springer-Verlag, 1997.
Cramer, R., et al., “Multi-Authority, Secret-Ballot Elections with Linear Work”, Advances in Cryptology—Eurocrypt 1996, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1996.
Cramer, R., et al., Proofs of Partial Knowledge and Simplified Design of Cryptology—Crypto 1994, Lecture Notes in Computer Science, pp. 174-187, Springer-Verlag, Berlin, 1994.
Cranor, L. F., “Electronic Voting, Computerized polls may save money, protect privacy,” Crossroads, The ACM's First Electronic Publication, May 6, 1999, 4 pages.
Cranor, Lorrie et al., “Sensus: A Security-Conscious Electronic Polling System for the Internet”, Proceedings of the Hawaii International Conference on System Sciences, IEEE 1997, pp. 561-570.
Diffie, W., et al., “New Directions in Cryptography”, IEEE Transactions on Information Theory, 22(6):644-654, 1976.
ElGamal, T., “A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms”, IEEE Transactions on Information Theory, IT-31(4):469-472, 1985.
Fiat, A., et al., “How to Prove Yourself: Practical Solutions to Identification and Signature Problems”, Advances in Cryptology—Crypto 1986, Lecture Notes in Computer Science, pp. 186-194, Springer-Verlag, New York, 1987.
Fujioka, A., et al., “A Practical Secret Voting Scheme for Large Scale Elections”, Advances in Cryptology—Auscrypt 1992, Lecture Notes in Computer Science, pp. 244-251, Springer-Verlag, 1992.
Gennaro, R., “Achieving independence efficiently and securely”, Proceedings 14thACM Symposium on Principles of Distributed Computing (PODC 1995), New York, 1995.
Herschberg, M. A., “Secure Electronic Voting Over the World Wide Web,” Massachusetts Institute of Technology, May 27, 1997, 81 pages.
Iversen, K., “A Cryptographic Scheme for Computerized General Elections”, Crypto 1991, pp. 405-419.
Jan, Jin-Ke et al., “A Secure Electronic Voting Protocol with IC Cards”, Elsevier Science Inc., New York, J. Systems Software 1997, 39:93-101.
Mu, Yi et al., “Anonymous Secure E-Voting over a Network”, Proceedings, Annual Computer Security Applications Conference, IEEE 1998, pp. 293-299.
Odlyzko, A. M., “Discrete logarithms in finite fields and their cryptographic significance”, Advances in Cryptology—Eurocrypt 1984, Notes in Computer Science, Springer-Verlag, 1984.
Park, C., et al., “Efficient Anonymous Channel and All/Nothing Election Scheme”, Advances in Cryptology—Eurocrypt 1993, Lecture Notes in Computer Science, pp. 248-259, Springer-Verlag, 1993.
Pedersen, T., “A Threshold Cryptosystem without a Trusted Party”, Advances in Cryptology—Eurocrypt 1991, Lecture Notes in Computer Science, pp. 522-526, Springer-Verlag, 1991.
Sako, K., et al, “Receipt-Free Mix-Type Voting Scheme—A practical solution to the implementation of a voting booth”, Eurocrypt 1995, pp. 393-403.
Sako, K., et al., “Secure Voting Using Partially Compatible Homomorphisms”, Advances in Cryptology—Crypto 1994, Lecture Notes in Computer Science, Springer-Verlag, 1994.
Schnorr, C.P., “Efficient Signature Generation by Smart Cards”, Journal of Cryptology, 4(3):161-174, 1991.
Schoenmakers, B., “A Simple Publicly Verifiable Secret Sharing Scheme and its Application to Electronic Voting”, Advances in Cryptology—Crypto 1999, Lecture Notes in Computer Science, pp. 1-17, Springer-Verlag 1999.
Shamir, A., “How to Share a Secret”, Communications of the ACM, 22(11):612-613, 1979.
Schneier, Bruce, “Applied Cryptography, Second Edition,” John Wiley & Sons, Inc., 1996, pp. 476-481, 490-491, and 532-533.
Davies, D. W., et al., “Security for Computer Networks,” John Wiley & Sons, Ltd., Great Britain, 1984, pp. 253-257.
Benaloh, J. et al., “Receipt-Free Secret-Ballot Elections,” Proceedings of 26th ACM Symposium on Theory of computing, Montreal, May 1994, pp. 544-553.
Chaum, D., “Secret-Ballot Receipts: True Voter-Verifiable Elections,” IEEE Computer Society, IEEE Security & Privacy, Jan.-Feb. 2004, vol. 2, No. 1, pp. 38-47.
Chaum, D., et al., “Wallet Databases with Obs
Demoxi, Inc.
Diaz Susanna M
Perkins Coie LLP
LandOfFree
Coercion-free voting scheme does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Coercion-free voting scheme, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coercion-free voting scheme will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2803051