2018
DOI: 10.1007/s00145-018-9278-z
|View full text |Cite
|
Sign up to set email alerts
|

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 trusted setup like common reference strings or signature cards, many tasks such as secure communication and oblivious transfer cannot be achieved with ever… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 35 publications
0
5
0
Order By: Relevance
“…In other words, even if the assumptions lose their validity at some later point in time, the security of the protocol is not compromised, which also makes a major distinction from classical cryptographic approaches. This property is commonly known as everlasting security [ 74 ].…”
Section: Qot Protocols With Assumptionsmentioning
confidence: 99%
“…In other words, even if the assumptions lose their validity at some later point in time, the security of the protocol is not compromised, which also makes a major distinction from classical cryptographic approaches. This property is commonly known as everlasting security [ 74 ].…”
Section: Qot Protocols With Assumptionsmentioning
confidence: 99%
“…In other words, even if the assumptions lose their validity at some later point in time, the security of the protocol is not compromised, which also makes a major distinction from classical cryptographic approaches. This property is commonly known as everlasting security [69].…”
Section: Qot Protocols With Assumptionsmentioning
confidence: 99%
“…Although this may seem a strong assumption, in Section 4.1 we show that any token which can be queried in superposition in a reversible way, cannot be used to construct a secure OTM (with respect to our setting in which the adversary is allowed to apply arbitrary quantum operations). Similar classical-input hardware has previously been considered in, e.g., [Unr13;BGS13].…”
Section: Contributions and Summary Of Techniquesmentioning
confidence: 99%