Project description
New ways to avoid data breaches
Communication and data storage systems are indispensable parts of our every-day life. However, these systems deal with severe challenges in security and reliability. Security is important whenever a user communicates or stores sensitive data such as medical information; and reliability has to be guaranteed to be able to transmit or store information while noise occurs, for example. Algebraic codes (ACs) are a powerful means to achieve both. The EU-funded inCREASE project will construct and evaluate special codes for security applications and DNA storage. In particular, the project studies post-quantum secure code-based cryptosystems; secure key regeneration based on ACs; and ACs for DNA-based storage systems. The focus of inCREASE lies on using insertion/deletion-correcting codes.
Objective
Communication and data storage systems are indispensable parts of our every-day life. However, these systems deal with severe challenges in security and reliability. Security is important whenever a user communicates or stores sensitive data, e.g. medical information; reliability has to be guaranteed to be able to transmit or store information while noise occurs. Algebraic codes (ACs) are a powerful means to achieve both.
Within inCREASE, I will construct and evaluate special codes for security applications and DNA storage.
The tasks are structured into three work packages: (1) post-quantum secure code-based cryptosystems, (2) secure key regeneration based on ACs, (3) ACs for DNA-based storage systems. The focus of inCREASE
lies on innovative theoretical concepts.
The goal of work package (1) is to investigate and design code-based cryptosystems; one promising idea is to apply insertion/deletion correcting codes. The security of these systems will be analysed from two points of view: structural attacks on the algorithms and hardware implementations with side-channel attacks.
Secure cryptographic key regeneration is the goal of (2) and can be achieved by physical unclonable functions (PUFs). Here, ACs are necessary to reproduce the key reliably. This project will study the error patterns that occur in PUFs, model them theoretically, and design suitable coding schemes.
The investigation on (3) will start with a study of the data of existing DNA storage systems. The outcome will be an error model that will include insertions, deletions, substitutions, and duplications. Therefore, inCREASE will design ACs for these error types. This will be especially challenging regarding the mathematical concepts. These codes will be evaluated by simulations and using data sets of DNA storage systems.
This project is high risk/high gain with impact not only to storage and security, but to the methodology as well as other areas such as communications.
Fields of science (EuroSciVoc)
CORDIS classifies projects with EuroSciVoc, a multilingual taxonomy of fields of science, through a semi-automatic process based on NLP techniques. See: https://op.europa.eu/en/web/eu-vocabularies/euroscivoc.
CORDIS classifies projects with EuroSciVoc, a multilingual taxonomy of fields of science, through a semi-automatic process based on NLP techniques. See: https://op.europa.eu/en/web/eu-vocabularies/euroscivoc.
You need to log in or register to use this function
We are sorry... an unexpected error occurred during execution.
You need to be authenticated. Your session might have expired.
Thank you for your feedback. You will soon receive an email to confirm the submission. If you have selected to be notified about the reporting status, you will also be contacted when the reporting status will change.
Keywords
Project’s keywords as indicated by the project coordinator. Not to be confused with the EuroSciVoc taxonomy (Fields of science)
Project’s keywords as indicated by the project coordinator. Not to be confused with the EuroSciVoc taxonomy (Fields of science)
Programme(s)
Multi-annual funding programmes that define the EU’s priorities for research and innovation.
Multi-annual funding programmes that define the EU’s priorities for research and innovation.
-
H2020-EU.1.1. - EXCELLENT SCIENCE - European Research Council (ERC)
MAIN PROGRAMME
See all projects funded under this programme
Topic(s)
Calls for proposals are divided into topics. A topic defines a specific subject or area for which applicants can submit proposals. The description of a topic comprises its specific scope and the expected impact of the funded project.
Calls for proposals are divided into topics. A topic defines a specific subject or area for which applicants can submit proposals. The description of a topic comprises its specific scope and the expected impact of the funded project.
Funding Scheme
Funding scheme (or “Type of Action”) inside a programme with common features. It specifies: the scope of what is funded; the reimbursement rate; specific evaluation criteria to qualify for funding; and the use of simplified forms of costs like lump sums.
Funding scheme (or “Type of Action”) inside a programme with common features. It specifies: the scope of what is funded; the reimbursement rate; specific evaluation criteria to qualify for funding; and the use of simplified forms of costs like lump sums.
ERC-STG - Starting Grant
See all projects funded under this funding scheme
Call for proposal
Procedure for inviting applicants to submit project proposals, with the aim of receiving EU funding.
Procedure for inviting applicants to submit project proposals, with the aim of receiving EU funding.
(opens in new window) ERC-2018-STG
See all projects funded under this callHost institution
Net EU financial contribution. The sum of money that the participant receives, deducted by the EU contribution to its linked third party. It considers the distribution of the EU financial contribution between direct beneficiaries of the project and other types of participants, like third-party participants.
80333 Muenchen
Germany
The total costs incurred by this organisation to participate in the project, including direct and indirect costs. This amount is a subset of the overall project budget.