Optimally-fair exchange of secrets via delay encryption and commutative blinding
We propose a new fair exchange protocol that takes advantage of delay encryption and commutative encryption to achieve optimal partial fairness among all protocols involving one-way messages. Our protocol consists of 3 setup messages and 2N + 1 exchange messages and it is fair against covert adversa...
| Main Authors: | , |
|---|---|
| Format: | Conference item |
| Language: | English |
| Published: |
Springer
2023
|
| _version_ | 1797111848133197824 |
|---|---|
| author | Maffei, I Roscoe, AW |
| author_facet | Maffei, I Roscoe, AW |
| author_sort | Maffei, I |
| collection | OXFORD |
| description | We propose a new fair exchange protocol that takes advantage of delay encryption and commutative encryption to achieve optimal partial fairness among all protocols involving one-way messages. Our protocol consists of 3 setup messages and 2N + 1 exchange messages and it is fair against covert adversaries with probability 1 − 1 2N . We prove that this is optimal up to shortening the setup phase which is notably more efficient than existing protocols. |
| first_indexed | 2024-03-07T08:14:40Z |
| format | Conference item |
| id | oxford-uuid:cc4cc713-737d-4e3f-ad88-0be75d538336 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T08:14:40Z |
| publishDate | 2023 |
| publisher | Springer |
| record_format | dspace |
| spelling | oxford-uuid:cc4cc713-737d-4e3f-ad88-0be75d5383362023-12-19T09:47:43ZOptimally-fair exchange of secrets via delay encryption and commutative blindingConference itemhttp://purl.org/coar/resource_type/c_5794uuid:cc4cc713-737d-4e3f-ad88-0be75d538336EnglishSymplectic ElementsSpringer2023Maffei, IRoscoe, AWWe propose a new fair exchange protocol that takes advantage of delay encryption and commutative encryption to achieve optimal partial fairness among all protocols involving one-way messages. Our protocol consists of 3 setup messages and 2N + 1 exchange messages and it is fair against covert adversaries with probability 1 − 1 2N . We prove that this is optimal up to shortening the setup phase which is notably more efficient than existing protocols. |
| spellingShingle | Maffei, I Roscoe, AW Optimally-fair exchange of secrets via delay encryption and commutative blinding |
| title | Optimally-fair exchange of secrets via delay encryption and commutative blinding |
| title_full | Optimally-fair exchange of secrets via delay encryption and commutative blinding |
| title_fullStr | Optimally-fair exchange of secrets via delay encryption and commutative blinding |
| title_full_unstemmed | Optimally-fair exchange of secrets via delay encryption and commutative blinding |
| title_short | Optimally-fair exchange of secrets via delay encryption and commutative blinding |
| title_sort | optimally fair exchange of secrets via delay encryption and commutative blinding |
| work_keys_str_mv | AT maffeii optimallyfairexchangeofsecretsviadelayencryptionandcommutativeblinding AT roscoeaw optimallyfairexchangeofsecretsviadelayencryptionandcommutativeblinding |