Oblivious Assignment with m Slots

  • Giuseppe Ateniese
  • Roberto Baldoni
  • Silvia Bonomi
  • Giuseppe Antonio Di Luna
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7596)


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.


distributed coordination abstractions secure computations mutual exclusion distributed systems 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ateniese, G., Baldoni, R., Bonomi, S., Di Luna, G.A.: Oblivious Assignment with m Slots. Technical report, MIDLAB 2/12 - University of Rome “La Sapienza” (2012),
  2. 2.
    Ateniese, G., Camenisch, J., de Medeiros, B.: Untraceable rfid tags via insubvertible encryption. In: Proceedings of the 12th ACM Conference on Computer and Communications Security, CCS 2005, pp. 92–101. ACM, New York (2005)CrossRefGoogle Scholar
  3. 3.
    Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an asynchronous environment. Journal of the ACM 37, 524–548 (1990)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn. John Wiley Interscience (March 2004)Google Scholar
  5. 5.
    Baldoni, R., Virgillito, A., Petrassi, R.: A distributed mutual exclusion algorithm for mobile ad-hoc networks. In: IEEE Symposium on Computers and Communications, p. 539 (2002)Google Scholar
  6. 6.
    Barnett, A., Smart, N.P.: Mental Poker Revisited. In: Paterson, K.G. (ed.) Cryptography and Coding 2003. LNCS, vol. 2898, pp. 370–383. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  7. 7.
    Boneh, D.: The Decision Diffie-Hellman Problem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 48–63. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  8. 8.
    Bulgannawar, S., Vaidya, N.H.: A distributed k-mutual exclusion algorithm. In: International Conference on Distributed Computer Systems, pp. 153–160 (1995)Google Scholar
  9. 9.
    Burns, J.E., Peterson, G.L.: The ambiguity of choosing. In: Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, Priciple of Distributed Computing 1989, pp. 145–157. ACM, New York (1989)CrossRefGoogle Scholar
  10. 10.
    El Gamal, T.: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10–18. Springer, Heidelberg (1985)CrossRefGoogle Scholar
  11. 11.
    Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pp. 169–178. ACM (2009)Google Scholar
  12. 12.
    Goldreich, O.: Foundations of Cryptography: vol. 2, Basic Applications. Cambridge University Press, New York (2004)Google Scholar
  13. 13.
    Golle, P., Jakobsson, M., Juels, A., Syverson, P.: Universal re-encryption for mixnets. In: Proceedings of the 2004 RSA Conference, pp. 163–178. Springer (2002)Google Scholar
  14. 14.
    Kakugawa, H., Fujita, S., Yamashita, M., Ae, T.: A distributed k-mutual exclusion algorithm using k-coterie. Information Processing Letters 49(4), 213–218 (1994)zbMATHCrossRefGoogle Scholar
  15. 15.
    Le Lann, G.: Distributed systems - towards a formal approach. In: Congress of International Federation for Information Processing, pp. 155–160 (1977)Google Scholar
  16. 16.
    Maekawa, M.: A square root n algorithm for mutual exclusion in decentralized systems. ACM Transaction on Computer System 3(2), 145–159 (1985)CrossRefGoogle Scholar
  17. 17.
    Raymond, K.: A distributed algorithm for multiple entries to a critical section. Information Processing Letters 30(4), 189–193 (1989)CrossRefGoogle Scholar
  18. 18.
    Raynal, M.: Algorithms for mutual exclusion. MIT Press, Cambridge (1986)zbMATHGoogle Scholar
  19. 19.
    Ricart, G., Agrawala, A.K.: An optimal algorithm for mutual exclusion in computer networks. Communincations of the ACM 24(1), 9–17 (1981)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Shamir, A., Rivest, R.L., Adleman, L.M.: Mental Poker. Technical Report MIT-LCS-TM-125, Massachusetts Institute of Technology (1979)Google Scholar
  21. 21.
    Suzuki, I., Kasami, T.: A distributed mutual exclusion algorithm. ACM Transaction on Computer System 3(4), 344–349 (1985)CrossRefGoogle Scholar
  22. 22.
    Yao, A.C.: Protocols for secure computations. In: 23st Annual IEEE Symposium on Foundations of Computer Science, pp. 160–164. IEEE Computer Society Press (1982)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Giuseppe Ateniese
    • 1
  • Roberto Baldoni
    • 2
  • Silvia Bonomi
    • 2
  • Giuseppe Antonio Di Luna
    • 2
  1. 1.Dipartimento di Ingegneria Informatica, Automatica e Gestionale Antonio RubertiUniversitá degli Studi di Roma La SapienzaRomaItaly
  2. 2.Dipartimento di InformaticaUniversitá degli Studi di Roma La SapienzaRomaItaly

Personalised recommendations