Everlasting Multi-party Computation

Abstract

A protocol has everlasting security if it is secure against adversaries that are computationally unlimited after the protocol execution. This models the fact that we cannot predict which cryptographic schemes will be broken, say, several decades after the protocol execution. In classical cryptography, everlasting security is difficult to achieve: even using… (More)
DOI: 10.1007/s00145-018-9278-z

Topics

7 Figures and Tables

Slides referencing similar topics