ERCC
Efficient Resource Constrained Cryptography
| Coordinatore | RUHR-UNIVERSITAET BOCHUM
Spiacenti, non ci sono informazioni su questo coordinatore. Contattare Fabio per maggiori infomrazioni, grazie. |
| Nazionalità Coordinatore | Germany [DE] |
| Totale costo | 1˙874˙960 € |
| EC contributo | 1˙874˙960 € |
| Programma | FP7-IDEAS-ERC
Specific programme: "Ideas" implementing the Seventh Framework Programme of the European Community for research, technological development and demonstration activities (2007 to 2013) |
| Code Call | ERC-2013-CoG |
| Funding Scheme | ERC-CG |
| Anno di inizio | 2014 |
| Periodo (anno-mese-giorno) | 2014-11-01 - 2019-10-31 |
Partecipanti
| # | ||||
|---|---|---|---|---|
| 1 |
THE REGENTS OF THE UNIVERSITY OF CALIFORNIA
Organization address
address: "FRANKLIN STREET 1111, 12 FLOOR" contact info |
US (OAKLAND CA) | beneficiary | 263˙520.00 |
| 2 |
RUHR-UNIVERSITAET BOCHUM
Organization address
address: Universitaetstrasse 150 contact info |
DE (BOCHUM) | hostInstitution | 1˙611˙440.00 |
| 3 |
RUHR-UNIVERSITAET BOCHUM
Organization address
address: Universitaetstrasse 150 contact info |
DE (BOCHUM) | hostInstitution | 1˙611˙440.00 |
Mappa
Word cloud
Esplora la "nuvola delle parole (Word Cloud) per avere un'idea di massima del progetto.
Obiettivo del progetto (Objective)
'Traditionally, cryptographic protocols were run on servers or personal computers which have large and easily scalable computational resources. For these applications there exist a large variety of well-established cryptographic systems. Right now, we are in the midst of the shift toward ubiquitous computing on resource constrained devices (RCDs): small devices with severe constraints in terms of computing power, code size, and network capacities. RCDs are used virtually everywhere: smart phones, bank cards, electronic ID-cards, medical implants, cars, RFIDs as bar code replacement, etc. Due to their computational constraints, many current cryptographic security solutions are no longer applicable to RCDs. Existing solutions are often “ad-hoc” and do not come with a formal security treatment.
The central objective of the ERCC project is to initiate an overarching formal treatment of cryptographic solutions for RCDs, particularly focusing on efficiency. The main conceptual novelty is to follow the concept of provable security. We intend to design new cryptographic protocols that have a mathematical proof of security (assuming the hardness of some mathematical problem) and are still competitive with constructions currently used on RCDs. While we certainly cannot hope that all our new provably secure constructions will be superior to existing ad-hoc constructions, recent preliminary research results give rise to optimism. Concretely, we will base our new protocols on hard problems in ideal and structures lattices and we will study weaker (yet still realistic) security models for RCDs allowing for efficient instantiations.'