-
3
-
-
0003945449
-
-
Yale University Ph.D. Thesis YALEU/DCS/TR-561. New Haven, CT (Dec)
-
Benaloh, J. “Verifiable Secret-Ballot Elections.” Yale University Ph.D. Thesis YALEU/DCS/TR-561. New Haven, CT (Dec. 1987).
-
(1987)
Verifiable Secret-Ballot Elections
-
-
Benaloh, J.1
-
5
-
-
74049157498
-
A Modular Voting Architecture (“Frogs”)
-
Tomales Bay, CA (Aug)
-
Bruck, S., Jefferson, D., and Rivest, R. “A Modular Voting Architecture (“Frogs”).” Workshop on Theory of Elections. Tomales Bay, CA (Aug. 2001).
-
(2001)
Workshop on Theory of Elections
-
-
Bruck, S.1
Jefferson, D.2
Rivest, R.3
-
6
-
-
2342617507
-
Secret-Ballot Receipts: True Voter-Verifiable Elections
-
(Feb)
-
Chaum, D. “Secret-Ballot Receipts: True Voter-Verifiable Elections.” IEEE Security & Privacy 2 1, (Feb. 2004), 38-47.
-
(2004)
IEEE Security & Privacy
, vol.2
, Issue.1
, pp. 38-47
-
-
Chaum, D.1
-
7
-
-
85092046258
-
Recent Results in Electronic Voting
-
Milan, Italy (Sep)
-
Chaum, D. “Recent Results in Electronic Voting.” Fronteers in Electronic Elections. Milan, Italy (Sep. 2005).
-
(2005)
Fronteers in Electronic Elections
-
-
Chaum, D.1
-
8
-
-
0019532104
-
Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms
-
(Feb)
-
Chaum, D. “Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms.” Communications of the ACM 24, 2, (Feb. 1981), 84-88.
-
(1981)
Communications of the ACM
, vol.24
, Issue.2
, pp. 84-88
-
-
Chaum, D.1
-
9
-
-
84957375076
-
A Secure and Optimally Efficient Mult-Authority Election Scheme
-
Konstanz, Germany (May)
-
Cramer, R., Gennaro, R., and Schoenmakers, B. “A Secure and Optimally Efficient Mult-Authority Election Scheme.” Proceedings of Eurocrypt'97. Konstanz, Germany (May 1997) 103-118.
-
(1997)
Proceedings of Eurocrypt'97
, pp. 103-118
-
-
Cramer, R.1
Gennaro, R.2
Schoenmakers, B.3
-
11
-
-
33646028830
-
A Pracital Voter-Verifiable Election Scheme
-
Milan, Italy (Sep)
-
Chaum, D., Ryan, P. Y. A., and Schneider, S. “A Pracital Voter-Verifiable Election Scheme.” Proceedings of European Symposium on Research in Computer Security. Milan, Italy (Sep 2005) 118-139.
-
(2005)
Proceedings of European Symposium on Research in Computer Security
, pp. 118-139
-
-
Chaum, D.1
Ryan, P. Y. A.2
Schneider, S.3
-
12
-
-
84976671974
-
Cryptographic Protocols
-
San Francisco, CA (May)
-
De Millo, R., Lynch, N., and Merritt, M. “Cryptographic Protocols.” Proceedings of the 14th ACM Symposium on Theory of Computing. San Francisco, CA (May 1982), 383-400.
-
(1982)
Proceedings of the 14th ACM Symposium on Theory of Computing
, pp. 383-400
-
-
De Millo, R.1
Lynch, N.2
Merritt, M.3
-
13
-
-
35048861845
-
Efficient, Verifiable Shuffle Decryption and Its Requirement of Unlinkability
-
Singapore (Mar)
-
Furukawa, J. “Efficient, Verifiable Shuffle Decryption and Its Requirement of Unlinkability.” Proceedings of PKC 2004. Singapore (Mar. 2004) 319-332.
-
(2004)
Proceedings of PKC 2004
, pp. 319-332
-
-
Furukawa, J.1
-
14
-
-
84880857711
-
An Efficient Scheme for Proving a Shuffle
-
Santa Barbara, CA (Aug)
-
Furukawa, J. and Sako, K. “An Efficient Scheme for Proving a Shuffle.” Proceedings of Crypto 2001. Santa Barbara, CA (Aug. 2001) 368-387.
-
(2001)
Proceedings of Crypto 2001
, pp. 368-387
-
-
Furukawa, J.1
Sako, K.2
-
15
-
-
35248822599
-
A Verifiable Secret Shuffle of Homomorphic Encryptions
-
Miami, FL (Jan)
-
Groth, J. “A Verifiable Secret Shuffle of Homomorphic Encryptions.” Proceedings of PKC 2003. Miami, FL (Jan. 2003) 145-160.
-
(2003)
Proceedings of PKC 2003
, pp. 145-160
-
-
Groth, J.1
-
16
-
-
84958742387
-
Optimistic Mixing for Exit-Polls
-
Queenstown, New Zealand (Dec)
-
Golle, P., Zhong, S., Boneh, D., Jakobsson, M., and Juels, A. “Optimistic Mixing for Exit-Polls.” Proceedings of Asiacrypt 2002. Queenstown, New Zealand (Dec. 2002) 451-465.
-
(2002)
Proceedings of Asiacrypt 2002
, pp. 451-465
-
-
Golle, P.1
Zhong, S.2
Boneh, D.3
Jakobsson, M.4
Juels, A.5
-
17
-
-
85084162002
-
Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking
-
San Francisco, CA (Aug)
-
Jakobsson, M., Juels, A., and Rivest, R. “Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking.” Proceedings of the 2002 USENIX Security Symposium. San Francisco, CA (Aug. 2002), 339-353.
-
(2002)
Proceedings of the 2002 USENIX Security Symposium
, pp. 339-353
-
-
Jakobsson, M.1
Juels, A.2
Rivest, R.3
-
20
-
-
33745162938
-
Simple and Efficient Shuffling with Provable Correctness and ZK Privacy
-
Santa Barbara, CA (Aug)
-
Peng, K., Boyd, C., and Dawson, E. “Simple and Efficient Shuffling with Provable Correctness and ZK Privacy.” Proceedings of Crypto 2005. Santa Barbara, CA (Aug. 2005) 188-204.
-
(2005)
Proceedings of Crypto 2005
, pp. 188-204
-
-
Peng, K.1
Boyd, C.2
Dawson, E.3
-
21
-
-
85027158725
-
Efficient Anonymous Channel and All/Nothing Election Scheme
-
Lofthus, Norway (May)
-
Park, C., Itoh, K., and Kurosawa, K. “Efficient Anonymous Channel and All/Nothing Election Scheme.” Proceedings of Eurocrypt '93. Lofthus, Norway (May 1993), 248-259.
-
(1993)
Proceedings of Eurocrypt '93
, pp. 248-259
-
-
Park, C.1
Itoh, K.2
Kurosawa, K.3
-
22
-
-
0001574460
-
Receipt-Free Mix-Type Voting Scheme
-
St. Malo, France (May)
-
Sako, K. and Kilian, J. “Receipt-Free Mix-Type Voting Scheme.” Proceedings of Eurocrypt '95. St. Malo, France (May 1995) 394-403.
-
(1995)
Proceedings of Eurocrypt '95
, pp. 394-403
-
-
Sako, K.1
Kilian, J.2
|