메뉴 건너뛰기




Volumn , Issue , 2007, Pages

Ballot Casting assurance via voter-initiated poll station auditing

Author keywords

[No Author keywords available]

Indexed keywords

VOTING MACHINES;

EID: 84867450826     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (86)

References (22)
  • 3
    • 0003945449 scopus 로고
    • 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
  • 6
    • 2342617507 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 10
    • 0022188127 scopus 로고
    • A Robust and Verifiable Cryptographically Secure Election Scheme
    • (now Benaloh), J. and, Portland, OR (Oct)
    • Cohen (now Benaloh), J. and Fischer, M. “A Robust and Verifiable Cryptographically Secure Election Scheme.” Proceedings of the 26th IEEE Symposium on Foundations of Computer Science. Portland, OR (Oct. 1985), 372-382.
    • (1985) Proceedings of the 26th IEEE Symposium on Foundations of Computer Science , pp. 372-382
    • Cohen1    Fischer, M.2
  • 13
    • 35048861845 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 17
    • 85084162002 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고
    • 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


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.