Back to Search
Start Over
How to Sign Paper Contracts? Conjectures & Evidence Related to Equitable & Efficient Collaborative Task Scheduling
- Source :
- [Research Report] IACR Cryptology ePrint Archive 2013: 432 (2013), 2013, Open Problems in Mathematical and Computational Sciences Conference, Open Problems in Mathematical and Computational Sciences Conference, Sep 2013, Istambul, Turkey
- Publication Year :
- 2013
- Publisher :
- HAL CCSD, 2013.
-
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.
- Subjects :
- TheoryofComputation_MISCELLANEOUS
[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]
traffic analysis
encrypted containers
protocols
foundations
ComputingMilieux_MISCELLANEOUS
[INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]
Computer Science::Cryptography and Security
Subjects
Details
- Language :
- English
- Database :
- OpenAIRE
- Journal :
- [Research Report] IACR Cryptology ePrint Archive 2013: 432 (2013), 2013, Open Problems in Mathematical and Computational Sciences Conference, Open Problems in Mathematical and Computational Sciences Conference, Sep 2013, Istambul, Turkey
- Accession number :
- edsair.dedup.wf.001..cb32f6dd4edad70d2f3768d802e0a4bd