Welcome to the Democratic Technologies (DemTech) Research Project
Latest NewsTweets by @DemTechDK
PhD course Code Scanning7. April 2013
This course is intended for PhD students and advanced Master students and it is designed to give an introduction to formal methods, teach the basics of code scanning theory, and allows students to gain first-hand experience with the state of the art code scanners. Code scanners are tools that inspect source code automatically for bugs, security problems and other issues. Code scanners are often used to evaluate software used in safety critical systems. Contingent on our ability to secure licenses, we will discuss five different tools, such as Coverity, Fortify, Code Sonar, AppScan??, and FindBugs??. The course is organized in two parts. The first part takes place in April, where we (the organizers) will give several lectures about the formal under pinnings of code scanners. During the last lecture, we, will present some sample code, and assign (groups of) students to tools. The dates for the first part are
DemTech seeks postdoc in Formal Methods and Software Engineering20 Decemberl 2013
We are looking for a postdoc in formal methods, software engineering or related topics such as programming languages and distributed systems.
- design and verification of concurrent and cryptographic systems;
- programming language based security, including semantic security and functional programming;
- program verification including logical methods, type theory and dependent types;
DemTech Invited Lecture : Risk Limiting Audits of Parliamentary Elections30. April 2013
- Title: Risk-Limiting Audits of Parliamentary Elections
- Speaker: | Prof. Stark, Professor and Chair of Statistics, University of California, Berkeley
- Date: November 21
- Room: ITU, 5A-60
- Time: 10:00-11:00
Abstract: Risk-limiting audits have a pre-specified minimum probability of correcting incorrect electoral outcomes. The risk limit is the maximum chance that an incorrect outcome is not corrected by the audit. Risk-limiting audits have been conducted in the USA for plurality contests in Ohio and Colorado, and for plurality, majority, super-majority, and "vote-for-n" contests in California. There are two basic approaches to risk-limiting audits, both of which involve inspecting randomly selected records from an audit trail in search of strong statistical evidence that the apparent outcome is correct. Absent strong evidence, they lead to a full hand count, which reveals the correct outcome. Ballot-polling audits use the audit trail alone; comparison audits compare hand counts of randomly selected groups of ballots to reported results for those ballots. Comparison audits are more complex and make more demands on the voting system, but--if the groups for which reported results are available are sufficiently small--can require inspecting fewer ballots than ballot-polling audits when the apparent outcome is indeed correct. Quite recently, the theory of risk-limiting audits was extended to ballot-polling and comparison audits of parliamentary elections like those in Denmark. The calculations required to conduct such audits involve only simple arithmetic, but there can be a fair amount of bookkeeping if there are many parties and many seats.
We are looking for enthusiastic students to work on student projects that are directly relevant to DemTech. You offer an international and exciting working environment and access to real-world data, and real world systems. Help us make a difference!
Carsten Schürmann, Randi Markussen and Lorena Ronquillo were present when online votes were decrypted and counted for Norwegian Parliamentary Election.
This semester we will discuss foundations and aspects of cryptographic voting protocols in the DemTech Reading Group. The reading group meets Fridays, 10:00 - 11:00. Room TBA
Speaker: Ian Brightwell, Director IT and CIO
New South Wales Electoral Commission
Speaker: Prof. David Basin
We describe an approach to developing security protocols by step-wise refinement. Its core is a refinement strategy that guides the transformation of abstract security goals into protocols that are secure when operating over an insecure channel. The refinement steps successively introduce local states, an adversary, communication channels with security properties, and cryptographic operations realizing these channels. The abstractions we use provide insights on how the protocols work and foster the development of families of protocols sharing a common structure and properties. In contrast to post-hoc verification methods, we develop protocols together with their correctness proofs. We have implemented our approach in Isabelle/HOL and used it to develop a number of entity authentication and key transport protocols.
(Joint work with Christoph Sprenger, ETH Zurich)
DemTech is looking for a PhD student to join the international group consisting of three faculty members, four post-docs, and several PhD students. The application deadline is 13th October 2013.
Steffen Dalsgaard to join The Young Academy of Denmark11. June 2013
From September 2013 Steffen Dalsgaard will be a member of The Young Academy of Denmark (Det Unge Akademi). The Young Academy is a section for young talented scholars under the Royal Danish Academy of Science and Letters. Its purpose is to strengthen basic research and the interdisciplinary exchange, bridging the gap between science and society - and to give a united voice to some of the most excellent young scientists in Denmark.
Carsten gave a talk at CADE 2013 in Lake Placid, USA11. June 2013
Carsten presented a joint paper with Bernhard Beckert (KIT) and Rajeev Gore (ANU) on Analysing Vote Counting Algorithms Via Logic at CADE-13 in Lake Placid, USA]. Click here for the slides.
Twelf tutorial in Lake Placid, USA10. June 2013
The wait is over. Finally another Twelf tutorial, this time collocated with CADE 2013 in Lake Placid, NY.
Carsten's invited talk at the AR-SEC 2013 workshop in Lake Placid, USA9. June 2013
Carsten's talk at the Egypt-US Cyber Security workshop in Cairo28. May 2013
DemTech Invited Lecture : UNDP-Egypt ICT4D30. April 2013
- Title: UNDP ICT4D
- Speaker: Sherif El Tokali, Assistant Resident Representative of the UNDP-Egypt
- Date: April 30
- Room: 5A60
- Time: 10:00-11:00
Abstract: Throughout the past decade United Nations Development Programme (UNDP) has collaborated with the Government of Egypt (GOE) represented by its different ministries, Non-governmental Organizations (NGOs) as well as the Private Sector to positively contribute to a sustainable socioeconomic development in Egypt through the use of the Information and Communication Technologies (ICTs). In specific, the collaboration between UNDP and the Ministry of Communications and Information Technology (MCIT) is considered one of the most successful partnerships which resulted in the formulation and implementation of a number of nationally executed ICT projects in Egypt. Many of these projects did spin-off successfully.
Today, the collaboration between UNDP and MCIT is geared towards improving the overall electronic readiness of the youth, women, people with special needs, and civil society organizations and increasing entrepreneurship, Education and Innovation, E- Health.
Click here for the slides.
DemTech researcher Joseph Kiniry will debate Jacob Scjødt Nielsen at TEKNOFO
Saving Democracy from Technology
Joseph Kiniry, DTU Compute, guest professor at ITU
eVote – a choice for the future?
Project Manager Jacob Scjødt Nielsen, The Danish Board of Technology
See Previous news for older items.
- demtech-folketinget-final.pdf (51.2 KB) - added by carsten 13 months ago.
(538.8 KB) -
added by carsten 10 months ago.
Slides to Carsten's talk at CADE 13
(40.7 KB) -
added by carsten 7 months ago.
(40.7 KB) -
added by carsten 7 months ago.
- Demtech_Factsheet_May_2013.pdf (64.6 KB) - added by carsten 7 months ago.
Download all attachments as: .zip