1
program role
17
collaborators
2011–2017
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
7 Posters
| Title | Conference | Co-authors |
|---|---|---|
| SaNeQKD: a design to equip a GNSS intersatellite network with QKD | QCRYPT 2014 | Francesca Gerlin, Giampiero Naletto, Giuseppe Vallone, Paolo Villoresi, Luciana Bonino, Sergio Mottini, Zoran Sodnik |
| Turbulence as a Resource for Quantum Key Distribution in Long Distance Free-Space Links | QCRYPT 2014 | Davide Bacco, Giuseppe Vallone, Davide Giacomo Marangon, Matteo Canale, Ilaria Savorgnan, Mauro Barbieri, Simon Calimani, Cesare Barbieri, Paolo Villoresi |
| Adaptive Discrimination Scheme for Quantum Pulse Position Modulation Signals | QIP 2014 | Nicola Dalla Pozza |
| Optimal Binary Codes and Measurements for Classical Communication over Qubit Channels | QIP 2014 | Nicola Dalla Pozza, Francesco Ticozzi |
| Experimental QKD with finite-key security analysis for noisy channels | QCRYPT 2013 | Davide Bacco, Matteo Canale, Giuseppe Vallone, Paolo Villoresi |
In practical Quantum Key Distribution, there exist scenarios where the number of exchanged qubits is limited by physical constraints. A notable case is that of satellite QKD, where channel losses and visibility play a major role in limiting the efficiency and the availability of the quantum link. With this perspective in mind, the need for evaluating finite-key effects on the secret key rate is urgent. In this work, we experimentally evaluate, in a realistic setup and with different channel conditions, the robustness of a recent finite-key tight theoretical bound that ensures secrecy against the most general quantum attacks. We compare the experimental results obtained by this bound with the ones achieved with a new finite-key bound tailored for ensuring secrecy against individual attacks. We then show, the minimum number of raw bits to be exchanged in order to obtain a given secret key length, for different values of the QBER. This provides a valuable tool for practical QKD, as it allows to know in advance, depending on the channel noise, how may bits have to be exchanged for obtaining the desired secret key length. The results indicate that viable conditions for effective symmetric, and even one-time-pad, cryptography are achievable. |
||
| Performance analysis of a low-cost, low-complexity, free-space QKD scheme based on the B92 protocol | QCRYPT 2011 | Matteo Canale, Davide Bacco, Simon Calimani, Francesco Renna, Giuseppe Vallone, Paolo Villoresi |
| QKD secrecy for privacy amplification matrices with selective individual attacks | QCRYPT 2011 | Matteo Canale, Francesco Renna |
Committee service
| Conference | Committee | Position | Title |
|---|---|---|---|
| QCRYPT 2017 | program | member | — |
Collaborators
| Co-author | Joint talks |
|---|---|
| Giuseppe Vallone | 4 |
| Matteo Canale | 4 |
| Paolo Villoresi | 4 |
| Davide Bacco | 3 |
| Francesco Renna | 2 |
| Nicola Dalla Pozza | 2 |
| Simon Calimani | 2 |
| Cesare Barbieri | 1 |
| Davide Giacomo Marangon | 1 |
| Francesca Gerlin | 1 |
| Francesco Ticozzi | 1 |
| Giampiero Naletto | 1 |
| Ilaria Savorgnan | 1 |
| Luciana Bonino | 1 |
| Mauro Barbieri | 1 |
| Sergio Mottini | 1 |
| Zoran Sodnik | 1 |