Paper 2013/432
How to Sign Paper Contracts? Conjectures & Evidence Related to Equitable & Efficient Collaborative Task Scheduling
Eric Brier, David Naccache, and Li-yao Xia
Abstract
This paper explores ways of performing commutative tasks by $N$ parties. Tasks are defined as {\sl commutative} if the order at which parties perform tasks can be freely changed without affecting the final result. It is easy to see that arbitrary $N$-party commutative tasks cannot be completed in less than $N-1$ basic time units. We conjecture that arbitrary $N$-party commutative tasks cannot be performed in $N-1$ time units by exchanging less than $4N-6$ messages and provide computational evidence in favor this conjecture. We also explore the most equitable commutative task protocols.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- traffic analysisencrypted containersprotocols
- Contact author(s)
- david naccache @ ens fr
- History
- 2013-07-13: received
- Short URL
- https://ia.cr/2013/432
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2013/432,
author = {Eric Brier and David Naccache and Li-yao Xia},
title = {How to Sign Paper Contracts? Conjectures & Evidence Related to Equitable & Efficient Collaborative Task Scheduling},
howpublished = {Cryptology {ePrint} Archive, Paper 2013/432},
year = {2013},
url = {https://eprint.iacr.org/2013/432}
}
