Skip to main content
Go to the home page of the European Commission (opens in new window)
English English
CORDIS - EU research results
CORDIS

Practice-Oriented Security Models and Granular Designs for Future-Proof Authenticated Encryption

Objective

Authenticated-Encryption (AE) algorithms have recently faced an immense increase in popularity as appropriate cryptographic tools for providing data confidentiality and integrity services simultaneously. AE algorithms are ubiquitous in protocols to secure the very fundamentals of the information and communication infrastructure, being adopted into widely-deployed protocols, such as TLS, SSH, IPsec, IEEE 802.11 (Wi-Fi) and ANSI C12.22. A wide range of recently reported security vulnerabilities and exploits, arisen from either using insecure designs to achieve the AE goal or misusing supposedly secure AE schemes, has motivated the cryptographic community to run the CAESAR competition for designing new AE algorithms, boosting research on AE. Yet a critical look at the classical security models for AE, defined over the last decade, that guided the constructions of CAESAR submissions, and a review of practical applications for AE algorithms reveals several inconsistencies and remaining problems that must be carefully investigated before moving towards adoption of next-generation AE schemes for widespread use in governmental, industrial and financial ICT systems.

POMEGRANATE aims to critically rethink the existing security notions and robustness features for AE schemes and to develop fine-grained security models and modular, future-proof design paradigms that can flexibly capture a widening spectrum of disparate requirements in the emerging streaming media applications such as IPTV as well as in future heterogeneous environments such as Internet of Things and Cloud Computing infrastructures. We aim to proactively identify important ongoing challenges and to bridge the gaps between the theory and practice of AE, looking far beyond the design-centric CAESAR competition. Nevertheless, the results will also impact the evaluation and ranking of the CAESAR finalists, as those schemes should offer a set of envisioned new security and robustness needs for future applications.

Keywords

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.

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.

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.

MSCA-IF - Marie Skłodowska-Curie Individual Fellowships (IF)

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.

(opens in new window) H2020-MSCA-IF-2015

See all projects funded under this call

Coordinator

KATHOLIEKE UNIVERSITEIT LEUVEN
Net EU contribution

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.

€ 172 800,00
Address
OUDE MARKT 13
3000 LEUVEN
Belgium

See on map

Region
Vlaams Gewest Prov. Vlaams-Brabant Arr. Leuven
Activity type
Higher or Secondary Education Establishments
Links
Total cost

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.

€ 172 800,00
My booklet 0 0