Adaptive versus non-adaptive security of multi-party protocols (Q1882568): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s00145-004-0135-x / rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00145-004-0135-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2065579695 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S00145-004-0135-X / rank | |||
Normal rank |
Latest revision as of 11:42, 16 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Adaptive versus non-adaptive security of multi-party protocols |
scientific article |
Statements
Adaptive versus non-adaptive security of multi-party protocols (English)
0 references
1 October 2004
0 references
The article is devoted to comparative security analysis of multi-party cryptographic protocols with two types of adversarial settings. In the non-adaptive setting the set of corrupted parties is chosen in advance. In the adaptive case a corrupted member is defined during the course of the communication. The equivalence relations between adaptive and non-adaptive security are studied. It is proved that under the basic definition adaptive security is equivalent to non-adaptive security when the number of parties is logarithmic. For Byzantine adversaries adaptive security is stronger that non-adaptive security.
0 references