Research & Development Workshop on e-Voting and e-Government in the UK - February 27, 2006 Votinbox - a voting system based on smart cards Sébastien Canard.

Slides:



Advertisements
Similar presentations
Public Key Infrastructure and Applications
Advertisements

Secure Naming structure and p2p application interaction IETF - PPSP WG July 2010 Christian Dannewitz, Teemu Rautio and Ove Strandberg.
1 ABCs of PKI TAG Presentation 18 th May 2004 Paul Butler.
Trusted Symbol of the Digital Economy 1 Bill Holmes – VP Marketing ID Platform - Smart Cards.
Authentication Applications Kerberos And X.509. Kerberos Motivation –Secure against eavesdropping –Reliable – distributed architecture –Transparent –
Chapter 14 – Authentication Applications
Public Key Infrastructure A Quick Look Inside PKI Technology Investigation Center 3/27/2002.
Spring 2000CS 4611 Security Outline Encryption Algorithms Authentication Protocols Message Integrity Protocols Key Distribution Firewalls.
Requirements for a Secure Voting System  Only authorized voters can vote  No one can vote more than once  No one can determine for whom anyone else.
The Italian Academic Community’s Electronic Voting System Pierluigi Bonetti Lisbon, May 2000.
Civitas Security and Transparency for Remote Voting Swiss E-Voting Workshop September 6, 2010 Michael Clarkson Cornell University with Stephen Chong (Harvard)
SSL CS772 Fall Secure Socket layer Design Goals: SSLv2) SSL should work well with the main web protocols such as HTTP. Confidentiality is the top.
Efficient Public Key Infrastructure Implementation in Wireless Sensor Networks Wireless Communication and Sensor Computing, ICWCSC International.
1 Network Security Outline Encryption Algorithms Authentication Protocols Message Integrity Protocols Key Distribution Firewalls.
Claudia Diaz, Hannelore Dekeyser, Markulf Kohlweiss, Girma Nigusse K.U.Leuven IDIS Workshop 29/05/2008 [Work done in the context of the ADAPID project]
SECURITY IN E-COMMERCE VARNA FREE UNIVERSITY Prof. Teodora Bakardjieva.
Digital Signatures and Hash Functions. Digital Signatures.
Cryptographic Security Presented by: Josh Baker October 9 th, CS5204 – Operating Systems.
Lect. 18: Cryptographic Protocols. 2 1.Cryptographic Protocols 2.Special Signatures 3.Secret Sharing and Threshold Cryptography 4.Zero-knowledge Proofs.
Chapter 14 From Cryptography and Network Security Fourth Edition written by William Stallings, and Lecture slides by Lawrie Brown, the Australian Defence.
Raphael Frank 20 October 2007 Authentication & Intrusion Prevention for Multi-Link Wireless Networks.
Lesson 12 Cryptography for E-Commerce. Approaches to Network Security Separate Security Protocol--SSL Application-Specific Security--SHTTP Security with.
Kerberos and PKI Cooperation Daniel Kouřil, Luděk Matyska, Michal Procházka Masaryk University AFS & Kerberos Best Practices Workshop 2006.
Implementation of LSI for Privacy Enhancing Computation Kazue Sako, Sumio Morioka
Session 5 Hash functions and digital signatures. Contents Hash functions – Definition – Requirements – Construction – Security – Applications 2/44.
CMSC 414 Computer and Network Security Lecture 7 Jonathan Katz.
Spring 2002CS 4611 Security Outline Encryption Algorithms Authentication Protocols Message Integrity Protocols Key Distribution Firewalls.
BY MUKTADIUR RAHMAN MAY 06, 2010 INTERODUCTION TO CRYPTOGRAPHY.
November 1, 2006Sarah Wahl / Graduate Student UCCS1 Public Key Infrastructure By Sarah Wahl.
CMSC 414 Computer and Network Security Lecture 9 Jonathan Katz.
Overview of Cryptography Anupam Datta CMU Fall A: Foundations of Security and Privacy.
SSH : The Secure Shell By Rachana Maheswari CS265 Spring 2003.
CMSC 414 Computer and Network Security Lecture 8 Jonathan Katz.
How cryptography is used to secure web services Josh Benaloh Cryptographer Microsoft Research.
Network Security – Part 2 V.T. Raja, Ph.D., Oregon State University.
Cryptography1 CPSC 3730 Cryptography Chapter 11, 12 Message Authentication and Hash Functions.
CSE 597E Fall 2001 PennState University1 Digital Signature Schemes Presented By: Munaiza Matin.
Chapter 8.  Cryptography is the science of keeping information secure in terms of confidentiality and integrity.  Cryptography is also referred to as.
Lecture 8 Digital Signatures. This lecture considers techniques designed to provide the digital counterpart to a handwritten signature. A digital signature.
1 Introduction to Security and Cryptology Enterprise Systems DT211 Denis Manley.
.Net Security and Performance -has security slowed down the application By Krishnan Ganesh Madras.
Scalable Security and Accounting Services for Content-based Publish/Subscribe Systems Himanshu Khurana NCSA, University of Illinois.
Network Security – Part 2 (Continued) Lecture Notes for May 8, 2006 V.T. Raja, Ph.D., Oregon State University.
Csci5233 Computer Security1 Bishop: Chapter 10 (Cont.) Key Management: Storage & Revoking.
E-Commerce Security Technologies : Theft of credit card numbers Denial of service attacks (System not availability ) Consumer privacy (Confidentiality.
Cryptography Encryption/Decryption Franci Tajnik CISA Franci Tajnik.
Cryptography, Authentication and Digital Signatures
How cryptography is used to secure web services Josh Benaloh Cryptographer Microsoft Research.
Certificate-Based Operations. Module Objectives By the end of this module participants will be able to: Define how cryptography is used to secure information.
Evoting using collaborative clustering Justin Gray Osama Khaleel Joey LaConte Frank Watson.
Presented by: Sanketh Beerabbi University of Central Florida.
Middleware for Secure Environments Presented by Kemal Altıntaş Hümeyra Topcu-Altıntaş Osman Şen.
A Quick Tour of Cryptographic Primitives Anupam Datta CMU Fall A: Foundations of Security and Privacy.
Security Many secure IT systems are like a house with a locked front door but with a side window open -somebody.
DIGITAL SIGNATURE.
Electronic Voting R. Newman. Topics Defining anonymity Need for anonymity Defining privacy Threats to anonymity and privacy Mechanisms to provide anonymity.
Lecture 11 Overview. Digital Signature Properties CS 450/650 Lecture 11: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.
Secure, verifiable online voting 29 th June 2016.
TAG Presentation 18th May 2004 Paul Butler
Key management issues in PGP
Web Applications Security Cryptography 1
Security Outline Encryption Algorithms Authentication Protocols
TAG Presentation 18th May 2004 Paul Butler
Higher Independent Authority for Elections
eVoting System Proposal
Lecture 4 - Cryptography
The Italian Academic Community’s Electronic Voting System
e-Security Solutions Penki Kontinentai Vladas Lapinskas
Presentation transcript:

Research & Development Workshop on e-Voting and e-Government in the UK - February 27, 2006 Votinbox - a voting system based on smart cards Sébastien Canard - France Télécom Hervé Sibert - France Télécom

Research & Development Workshop on e-Voting and e-Government in the UK - February 27, 2006 Agenda Introduction Overview of the system Main properties Prototype implementation Conclusion

Research & Development Workshop on e-Voting and e-Government in the UK - February 27, 2006 Agenda Introduction Overview of the system Main properties Prototype implementation Conclusion

Research & Development Workshop on e-Voting and e-Government in the UK - February 27, 2006 Introduction (1) Off-line vs. on-line vote On-line vote = distant vote using a PC or a mobile phone Off-line vote (using a voting machine) French context On-line vote assimilated to absentee vote (forbidden in France since 1975) Off-line vote Recent deployment Voting "blackboxes" quite usual now Use cryptography to secure the system -e-Poll, e-Poll2 based on blind signatures -e-Poll2 experimented during the vote on the EC Constitution

Research & Development Workshop on e-Voting and e-Government in the UK - February 27, 2006 Introduction (2) A joint work betweenand France Telecom cryptographic algorithms and architecture ST smart card technology and knowledge Objectives Develop an e-Voting system based on smart cards Put the main cryptographic tools inside the card, so as to have the voter control his own privacy Prove the feasibility of implementating "complex" algorithms inside smart cards Take into account countries' specifics -Ballot anonymity revocation (UK) -Elections can last several days (Czech Republic) -…

Research & Development Workshop on e-Voting and e-Government in the UK - February 27, 2006 Agenda Introduction Overview of the system Main properties Prototype implementation Conclusion

Research & Development Workshop on e-Voting and e-Government in the UK - February 27, 2006 Overview of the system (1) Framework Off-line vote in a polling station, using a voting machine One voting card is used for several elections The attendance is done by the smart card -There is no handwritten attendance Design of the smart card The smart card is designed to authorize only one vote per election The ballot is signed using a list signature scheme -each card uses its own secret key to enable the detection of double vote -all cards also share a common private key, used to prove the authenticity of the vote (as for group signatures)

Research & Development Workshop on e-Voting and e-Government in the UK - February 27, 2006 Overview of the system (2) - The actors Voters Register at Registration Centers Have their card personalized by the Smart Card Creation Center System authorities The Certification Authority manages the PKI for attendance Key Recovery Authorities can help recover the list signature unique secret key of a card Key Authorities deliver the shared list signature private key to cards the Revocation Authority can retrieve the identity from a ballot (optional) Vote authorities Controllers are in charge of the organization of an election Tellers are in charge of the reception and counting of the ballots

Research & Development Workshop on e-Voting and e-Government in the UK - February 27, 2006 Overview of the system (3) - Voter registration Request Certificate

Research & Development Workshop on e-Voting and e-Government in the UK - February 27, Overview of the system (4) - Voting phase +

Research & Development Workshop on e-Voting and e-Government in the UK - February 27, 2006 Overview of the system (5) - Counting phase Done by Tellers Verification of the attendances Counting of the votes Announce of the results

Research & Development Workshop on e-Voting and e-Government in the UK - February 27, 2006 Agenda Introduction Overview of the system Main properties Prototype implementation Conclusion

Research & Development Workshop on e-Voting and e-Government in the UK - February 27, 2006 Main properties (1) - Cryptographic tools Usual PK signature scheme for the attendance PK encryption scheme for encrypting the ballot The El Gamal scheme is particularly suitable to divide the key between several scrutineers Possibility of using a threshold encryption scheme List signature scheme Similar to group signature, but allows the straight detection of double vote Simplified version built upon classical (RSA) signature scheme, a PK encryption scheme and a PRNG …all these algorithms being implemented inside the smart card!

Research & Development Workshop on e-Voting and e-Government in the UK - February 27, 2006 Main properties (2) - Security Security with tamper resistant smart cards All and only votes of legitimate voters are taken into account, double vote is detected Anonymity is ensured thanks to list signatures and can be revoked Hash-based mechanism to prove to a voter that his vote was taken into account Attacks against tamper-resistance List signature can no more prevent double vote Still, no more frauds than broken cards if there is no other weakness in the voting chain Double-vote prevention Ensured by three means: list signatures, attendance checking, voting history checked inside the card

Research & Development Workshop on e-Voting and e-Government in the UK - February 27, 2006 Main properties (3) - Scalability Verifiability and fraud detection Mechanism inside the card that provides each voter with a hash of his plaintext ballot. After the counting phase, the hash of each deciphered ballot is published. Minor anonymity concerns Inclusion of a mix-net To secure the process against vote tracing on the network layer Possibility of voting from any polling station / remote voting Attendance databases must be on-line… …if off-line, then all multiple votes should be erased before the counting phase

Research & Development Workshop on e-Voting and e-Government in the UK - February 27, 2006 Agenda Introduction Overview of the system Main properties Prototype implementation Conclusion

Research & Development Workshop on e-Voting and e-Government in the UK - February 27, 2006 Prototype Implementation ST Smart Card ST19WR66 -8-bit CPU with 224 KB ROM, 6 KB RAM and 66 KB EEPROM -ICAO 66 O.S., RSA and 3DES base cryptographic schemes France Telecom algorithms on board Voting phases Java application Certification by Certatoo PKI (France Telecom) Performance Ballot creation procedure: 900 ms Attendance creation procedure: 800 ms Counting phase < 1 minute for 1000 ballots (Xeon 2,4GHz, 1GB RAM)

Research & Development Workshop on e-Voting and e-Government in the UK - February 27, 2006 Agenda Introduction Overview of the system Main properties Prototype implementation Conclusion

Research & Development Workshop on e-Voting and e-Government in the UK - February 27, 2006 Conclusion Smart cards are the cryptographic heart of the system No distant authority like in the case of blind signatures The security of the system remains in the voters' hands Stimulates the confidence of voters in the system Improvements to come Components and system testing (formal methods, attacks against cards) Integration of a more complex list signature scheme inside the card -No longer will there be a private key shared by several cards -Will provide at least the same security as other, blind signature-based schemes, with improved confidence from the voters

Research & Development Workshop on e-Voting and e-Government in the UK - February 27, 2006 Thank you for your attention