Difusión Fiable con Anonimato y Homonimia
##plugins.themes.bootstrap3.article.main##
Resumen
Resumen: Un sistema distribuido es un conjunto de procesos que intercambian mensajes a través de un conjunto de enlaces.La presente investigación propone un modelo de sistema distribuido con la capacidad de anonimato, que permitael intercambio de mensajes sin poder identificar el emisor ni el receptor. En este sentido se diseña e implementa unacapa adicional de acuerdo al modelo de referencia OSI para el intercambio de información. Esta nueva capa denominadade Difusión Fiable permite la distribución de mensajes en el sistema distribuido cumpliendo con la característica deanonimato.
Abstract: A distributed system is a set of processes that exchange messages through a set of links. This research proposesa model of distributed system with the capability of anonymity, that allows the exchange of messages without beingable to identify the sender nor the receiver. In this sense an additional OSI layer is designed and implemented forthe interchange of information. This new layer called the Reliable Broadcast allows the distribution of messages indistributed system complying with the feature of anonymity.
Descargas
Descargas
Detalles del artículo
Citas
S., Anta, A. F., Imbs, D., Jimenez, E., y Raynal, M. (2012). Failure
detectors in homonymous distributed systems (with an application to
consensus). En Proceedings of the 2012 ieee 32nd international conference on distributed computing systems (pp. 275-284). Washington, DC, USA: IEEE Computer Society. http://dx.doi.org/ 10.1109/ICDCS.2012.13
Bonnet, F., y Raynal, M. (2010). Consensus in anonymous distributed
systems: Is there a weakest failure detector? 2010 24th IEEE International Conference on Advanced Information Networking and Applications, 206- 213. doi: 10.1109/AINA.2010.19
Chandra, T. D., y Toueg, S. (1996, marzo). Unreliable failure detectors for reliable distributed systems. J. ACM, 43(2), 225-
http://doi.acm.org/10.1145/226643.226647
Chaudhuri, S. (1992). More choices allow more faults: Set consensus
problems in totally asynchronous systems. Information and Computation,
, 132-158.
Défago, X., Schiper, A., y Urbán, P. (2004). Total order broadcast and
multicast algorithms: Taxonomy and survey. ACM Computing Surveys
(CSUR). http://dl.acm.org/citation.cfm?id=1041682
Fischer, M. J., Lynch, N. A., y Paterson, M. S. (1985, abril). Impossibility of distributed consensus with one faulty process. J. ACM, 32(2), 374-382.
http://doi.acm.org/10.1145/3149.214121
Hanks, S., Li, T., Farinacci, D., y Traina, P. (1994, octubre). Generic
Routing Encapsulation (GRE) (n.o 1701). RFC 1701 (Informational). IETF.
Obtenido de http:// www.ietf.org/rfc/rfc1701.txt (Noviembre, 2015)
Haraty, R., y Zantout, B. (2014). The TOR data communication
system. Communications and Networks, Journal . . . , 16(4), 415-420.
Obtenido de la base de datos IEEE.
Lin, D., Sherr, M., y Loo, B. T. (2016). Scalable and anonymous group
communication with mtor. Proceedings on Privacy Enhancing Technologies, 2016(3), 1-18.
Mansfield-Devine, S. (2011, enero). Anonymous: serious threat or
mere annoyance? Network Security, 2011(1), 4-10. doi:
1016/S1353-4858(11)70004-6
Ozalp Babaoglu, K. M. (1993). Consistent Global States of Distributed
Systems : Fundamental Concepts and Mechanisms. (January)
Pfitzmann, A., y Hansen, M. (2008). Pseudonymity, and Identity
Management. A Consolidated Proposal for Terminology, February 2008
(Inf. Téc.).
Ren, J., y Wu, J. (2010, marzo). Survey on anonymous communications
in computer networks. Computer Communications, 33(4), 420-431. doi:
1016/j.comcom.2009.11.009
Zhong, S., y Zhang, M. (2015). Research on the personal privacy
information protection problem based on computer security technology. En 2015 international conference on automation, mechanical control and
computational engineering.