Algorithms for mutual exclusion
Algorithms for mutual exclusion
A public key cryptosystem and a signature scheme based on discrete logarithms
Proceedings of CRYPTO 84 on Advances in cryptology
A distributed algorithm for multiple entries to a critical section
Information Processing Letters
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Renaming in an asynchronous environment
Journal of the ACM (JACM)
A distributed k-mutual exclusion algorithm using k-coterie
Information Processing Letters
A distributed mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
The Decision Diffie-Hellman Problem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
A Distributed Mutual Exclusion Algorithm for Mobile Ad-Hoc Networks
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
A distributed K-mutual exclusion algorithm
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Untraceable RFID tags via insubvertible encryption
Proceedings of the 12th ACM conference on Computer and communications security
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Fully homomorphic encryption using ideal lattices
Proceedings of the forty-first annual ACM symposium on Theory of computing
An event-based platform for collaborative threats detection and monitoring
Information Systems
| Hi-index | 0.00 |
Preserving anonymity and privacy of customer actions within a complex software system, such as a cloud computing system, is one of the main issues that must be solved in order to boost private computation outsourcing. In this paper, we propose a coordination paradigm, namely oblivious assignment with m slots of a resource $\mathcal{R}$ (with m≥1), allowing processes to compete to get a slot of $\mathcal{R}$ while ensuring, at the same time, both fairness of resource allocation and obliviousness, that is, the impossibility for any process to infer which slot of $\mathcal{R}$ is assigned to any other process. We study oblivious assignment with m slots solvability issues based on the message pattern of the algorithm. We also present a distributed algorithm solving oblivious assignment with m slots within a distributed system, assuming the existence of at least two honest processes and m≤n (where n is the number of processes). The algorithm is based on a rotating token paradigm and employs an adaptation of the ElGamal encryption scheme to work with multiple parties and to ensure obliviousness of the assignment. Finally, the correctness of the algorithm is formally proved.