Regular work session on Thursday - note: ending early for Rivest lecture
7 views
Skip to first unread message
Myfanwy Johnston
Nov 29, 2016, 11:52:51 PM11/29/16
to davi...@googlegroups.com
Hi All,
We'll have our regular work session on Thursday in Wickson 2124, hope to see you there! Please note that I'll likely be closing the doors around 2:45pm so that I can go grab a seat for the talk below - feel free to come along!
Best,
Myfanwy
------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
*From:* csis-r...@ucdavis.edu <csis-r...@ucdavis.edu> on behalf of Mario Biagioli <mbia...@ucdavis.edu>
*Sent:* Monday, November 28, 2016 4:04 PM
*To:* cs...@ucdavis.edu
*Subject:* [CSIS] Ron Rivest talk, Thur 3pm, AUDITABILITY AND VERIFICATION OF ELECTIONS
On Thursday Prof. Ronald Rivest will give a talk “Auditability and Verification of Elections”.
Ron is one of the top computer scientists in the world. He has also been much in the news, in recent days, following the editorial he did with Philip Stark https://goo.gl/joF0lJ . Seating is limited.
*** CS Distinguished Lecturer ***
Speaker: Ronald L. Rivest, MIT
Title: Auditability and Verification of Elections
Date: Thursday, December 1, 2016
Time: 3:10 pm (reception starts at 2:30 pm)
Where: 1131 Kemper Hall
Host: Phil Rogaway
Poster: https://goo.gl/jeM6eu
Abstract: Democracy requires that elections have credible results—otherwise the winner lacks a political mandate and the supporters of losing candidates react with anything from protests to revolution.
Yet (U.S.) elections have become larger and increasingly complex, and politics seems more polarized. Software-based voting systems inspire little trust. Voting systems purchased with funds allocated after the 2000 U.S. presidential election fiasco are rapidly becoming obsolete.
How can good definitions, statistics, and cryptography help?
We present the notion of software independence, describe several methods for effective auditing of paper ballots, and give an overview of “end-to-end” cryptographic voting systems that allow voters to confirm that their votes were counted exactly as intended, without violating voter privacy or enabling vote-selling. We close with a (pessimistic) assessment of the prospects for “voting over the internet”.
--------------------------------------------------------------------------------------
Bio: Professor Rivest is an Institute Professor at MIT, a member of its Department of Electrical Engineering and Computer Science, a member of MIT’s Computer Science and Artificial Intelligence Laboratory (CSAIL), a member of that lab’s Theory of Computation Group and a leader of its Cryptography and Information Security Group.
He received a B.A. in Mathematics from Yale University in 1969, and a Ph.D. in Computer Science from Stanford University in 1974.
Rivest is a co-inventor of the RSA public-key cryptosystem, has extensive experience in cryptographic design and cryptanalysis. He is also a founder of RSA Data Security and of Verisign. Together with Adi Shamir and Len Adleman, he has received the 2002 ACM Turing Award.
He is also well-known as a co-author of the text, “Introduction to Algorithms” (with Cormen, Leiseron, and Stein).
He is a member of the National Academy of Engineering and the National Academy of Sciences, and is a Fellow of the Association for Computing Machinery, the International Association for Cryptographic Research, and the American Academy of Arts and Sciences.
He is on the Advisory Board for the Electronic Privacy Information Center and on the board of Verified Voting.
His research interests include cryptography, computer and network security, algorithms, and voting system security. His recent research emphasizes election integrity—methods involving statistical audits and methods based on the “end-to-end verifiable voting” paradigm.
*From:* csis-r...@ucdavis.edu <csis-r...@ucdavis.edu> on behalf of Mario Biagioli <mbia...@ucdavis.edu>
*Sent:* Monday, November 28, 2016 4:04 PM
*To:* cs...@ucdavis.edu
*Subject:* [CSIS] Ron Rivest talk, Thur 3pm, AUDITABILITY AND VERIFICATION OF ELECTIONS
On Thursday Prof. Ronald Rivest will give a talk “Auditability and Verification of Elections”.
Ron is one of the top computer scientists in the world. He has also been much in the news, in recent days, following the editorial he did with Philip Stark https://goo.gl/joF0lJ . Seating is limited.
*** CS Distinguished Lecturer ***
Speaker: Ronald L. Rivest, MIT
Title: Auditability and Verification of Elections
Date: Thursday, December 1, 2016
Time: 3:10 pm (reception starts at 2:30 pm)
Where: 1131 Kemper Hall
Host: Phil Rogaway
Poster: https://goo.gl/jeM6eu
Abstract: Democracy requires that elections have credible results—otherwise the winner lacks a political mandate and the supporters of losing candidates react with anything from protests to revolution.
Yet (U.S.) elections have become larger and increasingly complex, and politics seems more polarized. Software-based voting systems inspire little trust. Voting systems purchased with funds allocated after the 2000 U.S. presidential election fiasco are rapidly becoming obsolete.
How can good definitions, statistics, and cryptography help?
We present the notion of software independence, describe several methods for effective auditing of paper ballots, and give an overview of “end-to-end” cryptographic voting systems that allow voters to confirm that their votes were counted exactly as intended, without violating voter privacy or enabling vote-selling. We close with a (pessimistic) assessment of the prospects for “voting over the internet”.
--------------------------------------------------------------------------------------
Bio: Professor Rivest is an Institute Professor at MIT, a member of its Department of Electrical Engineering and Computer Science, a member of MIT’s Computer Science and Artificial Intelligence Laboratory (CSAIL), a member of that lab’s Theory of Computation Group and a leader of its Cryptography and Information Security Group.
He received a B.A. in Mathematics from Yale University in 1969, and a Ph.D. in Computer Science from Stanford University in 1974.
Rivest is a co-inventor of the RSA public-key cryptosystem, has extensive experience in cryptographic design and cryptanalysis. He is also a founder of RSA Data Security and of Verisign. Together with Adi Shamir and Len Adleman, he has received the 2002 ACM Turing Award.
He is also well-known as a co-author of the text, “Introduction to Algorithms” (with Cormen, Leiseron, and Stein).
He is a member of the National Academy of Engineering and the National Academy of Sciences, and is a Fellow of the Association for Computing Machinery, the International Association for Cryptographic Research, and the American Academy of Arts and Sciences.
He is on the Advisory Board for the Electronic Privacy Information Center and on the board of Verified Voting.
His research interests include cryptography, computer and network security, algorithms, and voting system security. His recent research emphasizes election integrity—methods involving statistical audits and methods based on the “end-to-end verifiable voting” paradigm.
--
Ph.D Candidate, UC Davis
Animal Behavior Graduate Group
Biotelemetry Laboratory
Reply all
Reply to author
Forward
0 new messages