Paolo Boldi
Sebastiano Vigna
- 1.ANGLUIN, D. Global and local properties in networks of processors. In Proc. 12th Symposium on the Theory of Computing (1980), pp. 82- 93. Google Scholar
Digital Library
- 2.ATTIYA, H., GORBACH, A., AND MORAN, S. Computing in totally anonymous asynchronous shared memory systems. In 12th international ,rymposium on DIStributed Computing (1998), vol. 1499 of Lecture Notes in Computer Science, p. 49. Google ScholarDigital Library
- 3.ATTIYA, H., SNIR, M., AND WARMUTH, M. K. Computing on an anonymous ring. J. Assoc. Comput. Mace 35, 4 (1988), 845-875. Google ScholarDigital Library
- 4.BOLDI, P., CODENOTTi, B., GEMMELL, P., SHAMMAH, S., Sl~ MON, J., AND VIGNA, $. Symmetry breaking in anonymous networks: Characterizations. In Proc. 4th Israeli Symposium on Theory of Computing and Systems (1996), IEEE Press, pp. 16-26.Google Scholar
- 5.BOLDI, P., AND VIGNA, S. Computing vector functions on anonymous networks. In SIROCCO '97. Proc. 4th International Colloquium on Structural Information and Communication Complexity (1997), D. Krizanc and P. Widmayer, Eds., vol. I of Proceedings in Informatics, Carleton Scientific, pp. 201-214. An abstract appeared also as a Brief Announcement in Proc. PODC '97, ACM Press. Google Scholar
- 6.BOLDI, P., AND VIGNA, S. Self-stabilizing universal algorithms. In Self--Stabilizing Systems (Proc. of the 3rd Workshop on Self-Stabilizing Systems, Santa Barbara, California, 1997) (1997), S. Ghosh and T. Herman, Eds., vol. 7 of International lnformatics Series, Carleton University Press, pp. 141-156.Google Scholar
- 7.MONK, J. D. Introduction to Set Theory. McGraw-Hill, New York, 1969.Google Scholar
- 8.NAOR, M., AND STOCKMEYER, L. What can be computed locally? SIAM J. Comput. 24, 6 (1995), 1259-1277. Google ScholarDigital Library
- 9.NORRIS, N. Computing functions on partially wireless networks. In Structure, Information and Communication Complexity. Proc. 2rid Colloquium SIROCCO '95 (1996), L. M. Kirousis and E. Kranakis, Eds., vol. 2 of International Informatics Series, Carleton University Press, pp. 53--64.Google Scholar
- 10.YAMASHITA, M., AND KAMEDA, T. Computing functions on asynchronous anonymous networks. Math. Systems Theory 29, 4 (1996), 331-356. See also {12}.Google ScholarCross Ref
- 11.YAMASHiTA, M., AND KAMEDA, T. Computing on anonymous networks: Part l--characterizing the solvable cases, iEEE Trans. Parallel and Distributed Systems 7, I (1996), 69-89. Google ScholarDigital Library
- 12.YAMASHITA, M., AND KAMEDA, T. Erratum to computing functions on asynchronous anonymous networks. Theory of Computing Systems (formerly Matl~ Syste~v Theory) 31, I (1998).Google Scholar
Index Terms
- Computing anonymously with arbitrary knowledge
Recommendations
A short anonymously revocable group signature scheme from decision linear assumption
ASIACCS '08: Proceedings of the 2008 ACM symposium on Information, computer and communications securityIn group signature schemes, a signature is anonymous for a verifier, while only a designated Privacy Manager (PM) can identify the signer. This identification is used for tracing a dishonest anonymous signer in case of an illegal act using the ...
Determining the minimum-area encasing rectangle for an arbitrary closed curve
This paper describes a method for finding the rectangle of minimum area in which a given arbitrary plane curve can be contained. The method is of interest in certain packing and optimum layout problems. It consists of first determining the minimal-...
New verifiable outsourced computation scheme for an arbitrary function
We study the construction of efficient verifiable outsourced computation for arbitrary functions. We improve previous verifiable outsourced computation schemes for arbitrary functions by using hybrid encryption based on fully homomorphic encryption and ...
Comments