Parasitic computing (original) (raw)
Un calcul parasitaire est une forme de calcul distribué qui est réalisé à l'insu de personnes possédant des ressources sur un réseau public comme l'Internet.
| Property | Value |
|---|---|
| dbo:abstract | Computación parasitaria es un paradigma de programación por el cual una aplicación consigue realizar cálculos complejos utilizando interacciones autorizadas sobre otras aplicaciones. Surge a partir de un trabajo publicado en Nature en el año 2000. En el trabajo original se utilizan dos ordenadores comunicándose a través de internet y protocolo TCP/IP, en una sesión de comunicación estándar. Uno de los ordenadores intenta solucionar un complicado problema, el de la satisfactibilidad de la lógica booleana, o 3-SAT; Lo hace descomponiendo el problema original en un número considerable de problemas más pequeños. Cada uno de estos problemas más pequeños se codifica como una relación entre un checksum (suma de control) y un paquete de red, de manera que la comprobación de si el checksum es correcto o no es la solución del problema más pequeño. El ordenador envía estos paquetes al ordenador que pretende realice la computación, el ordenador de destino comprueba el checksum del paquete recibido, si es correcto solicita más paquetes, si es incorrecto, solicita la retransmisión. De esta manera, el ordenador que recibe los paquetes y comprueba checksums, está realizando computaciones en beneficio del ordenador que las solicita, sin ser consciente de ello, y sin hacer nada más que mantener una sesión TCP/IP normal. La prueba de concepto en el trabajo original es extremadamente ineficiente, ya que la cantidad de recursos computacionales necesarios para generar y enviar los paquetes fácilmente exceden los recursos computacionales solicitados al otro extremo; El problema 3-SAT se podría haber solucionado mucho antes si se analizase únicamente en local. Además, en la práctica, los paquetes probablemente y ocasionalmente deberán ser retransmitidos realmente cuando ocurran errores de transmisión y/o red reales. De todas maneras, la computación parasitaria a nivel de checksums simplemente es una prueba de concepto. Los autores del trabajo original sugieren que a medida que se mueva la computación a lo largo de la pila de protocolo, se puede llegar a un punto en el cual la computación solicitada al/los ordenadores huésped favorezca al parásito. (es) Parasitic computing is programming technique where a program in normal authorized interactions with another program manages to get the other program to perform computations of a complex nature. It is, in a sense, a security exploit in that the program implementing the parasitic computing has no authority to consume resources made available to the other program. It was first proposed by Albert-Laszlo Barabasi, Vincent W. Freeh, Hawoong Jeong & Jay B. Brockman from , USA, in 2001. The example given by the original paper was two computers communicating over the Internet, under disguise of a standard communications session. The first computer is attempting to solve a large and extremely difficult 3-SAT problem; it has decomposed the original 3-SAT problem in a considerable number of smaller problems. Each of these smaller problems is then encoded as a relation between a checksum and a packet such that whether the checksum is accurate or not is also the answer to that smaller problem. The packet/checksum is then sent to another computer. This computer will, as part of receiving the packet and deciding whether it is valid and well-formed, create a checksum of the packet and see whether it is identical to the provided checksum. If the checksum is invalid, it will then request a new packet from the original computer. The original computer now knows the answer to that smaller problem based on the second computer's response, and can transmit a fresh packet embodying a different sub-problem. Eventually, all the sub-problems will be answered and the final answer easily calculated. The example is based on an exploit of the Transmission Control Protocol (TCP), used for internet connections, so in the end, the target computer(s) is unaware that it has performed computation for the benefit of the other computer, or even done anything besides have a normal TCP/IP session. The proof-of-concept is obviously extremely inefficient as the amount of computation necessary to merely send the packets in the first place easily exceeds the computations leeched from the other program; the 3-SAT problem would be solved much more quickly if just analyzed locally. In addition, in practice packets would probably have to be retransmitted occasionally when real checksum errors and network problems occur. However, parasitic computing on the level of checksums is a demonstration of the concept. The authors suggest that as one moves up the , there might come a point where there is a net computational gain to the parasite - perhaps one could break down interesting problems into queries of complex cryptographic protocols using public keys. If there was a net gain, one could in theory use a number of control nodes for which many hosts on the Internet form a distributed computing network completely unawares. Students of the University of Applied Sciences, Bern, Switzerland, extended this concept into a programmable virtual machine in 2002. (en) Un calcul parasitaire est une forme de calcul distribué qui est réalisé à l'insu de personnes possédant des ressources sur un réseau public comme l'Internet. (fr) Il calcolo parassita è una tecnica in cui una macchina remota inganna una o più vittime, facendogli eseguire dei calcoli di diversa natura mascherandoli sotto forma di normali . Dal punto di vista tecnico si tratta di una a livello protocollare in quanto la falsa "comunicazione" ruba alla vittima risorse di calcolo che vengono sottratte ad altre applicazioni. Dal punto di vista degli effetti pratici per la vittima invece, il calcolo parassita può assumere connotati vicini a quelli degli attacchi DoS in quanto va a rallentare il suo normale e potenziale lavoro. (it) |
| dbo:wikiPageExternalLink | https://www.researchgate.net/profile/Hawoong_Jeong/publication/11818463_Parasitic_computing/links/02bfe50e76eb6633e2000000.pdf |
| dbo:wikiPageID | 23985 (xsd:integer) |
| dbo:wikiPageLength | 7019 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1116513683 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Public_key_cryptography dbr:Bitcoin_mining dbr:Application-specific_integrated_circuit dbr:Internet dbr:Cryptocurrency dbr:Cryptographic_protocol dbr:Proof-of-concept dbr:Network_packet dbr:TCP/IP dbr:CUDA dbc:Distributed_computing_architecture dbr:Central_Processing_Unit dbr:Distributed_computing dbr:Adware dbr:Checksum dbr:Graphics_processing_unit dbr:Transmission_Control_Protocol dbr:Java_(programming_language) dbr:EULA dbc:Computer_security dbc:Models_of_computation dbr:Well-formed_element dbr:3-SAT dbr:Field-programmable_gate_array dbr:Albert-Laszlo_Barabasi dbr:OpenCL dbr:Yahoo dbr:Virtual_machine dbr:Malware dbr:Denial_of_service_attack dbr:Application_stack dbr:University_of_Notre_Dame,_Indiana |
| dbp:wikiPageUsesTemplate | dbt:More_footnotes dbt:Reflist |
| dct:subject | dbc:Distributed_computing_architecture dbc:Computer_security dbc:Models_of_computation |
| gold:hypernym | dbr:Technique |
| rdf:type | dbo:TopicalConcept yago:WikicatModelsOfComputation yago:Assistant109815790 yago:CausalAgent100007347 yago:LivingThing100004258 yago:Model110324560 yago:Object100002684 yago:Organism100004475 yago:Person100007846 yago:PhysicalEntity100001930 yago:Worker109632518 yago:YagoLegalActor yago:YagoLegalActorGeo yago:Whole100003553 |
| rdfs:comment | Un calcul parasitaire est une forme de calcul distribué qui est réalisé à l'insu de personnes possédant des ressources sur un réseau public comme l'Internet. (fr) Il calcolo parassita è una tecnica in cui una macchina remota inganna una o più vittime, facendogli eseguire dei calcoli di diversa natura mascherandoli sotto forma di normali . Dal punto di vista tecnico si tratta di una a livello protocollare in quanto la falsa "comunicazione" ruba alla vittima risorse di calcolo che vengono sottratte ad altre applicazioni. Dal punto di vista degli effetti pratici per la vittima invece, il calcolo parassita può assumere connotati vicini a quelli degli attacchi DoS in quanto va a rallentare il suo normale e potenziale lavoro. (it) Computación parasitaria es un paradigma de programación por el cual una aplicación consigue realizar cálculos complejos utilizando interacciones autorizadas sobre otras aplicaciones. Surge a partir de un trabajo publicado en Nature en el año 2000. De esta manera, el ordenador que recibe los paquetes y comprueba checksums, está realizando computaciones en beneficio del ordenador que las solicita, sin ser consciente de ello, y sin hacer nada más que mantener una sesión TCP/IP normal. (es) Parasitic computing is programming technique where a program in normal authorized interactions with another program manages to get the other program to perform computations of a complex nature. It is, in a sense, a security exploit in that the program implementing the parasitic computing has no authority to consume resources made available to the other program. Students of the University of Applied Sciences, Bern, Switzerland, extended this concept into a programmable virtual machine in 2002. (en) |
| rdfs:label | Computación parasitaria (es) Calcul parasitaire (fr) Calcolo parassita (it) Parasitic computing (en) |
| owl:sameAs | freebase:Parasitic computing yago-res:Parasitic computing wikidata:Parasitic computing dbpedia-es:Parasitic computing dbpedia-fr:Parasitic computing dbpedia-it:Parasitic computing https://global.dbpedia.org/id/8TN5 |
| prov:wasDerivedFrom | wikipedia-en:Parasitic_computing?oldid=1116513683&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Parasitic_computing |
| is dbo:wikiPageWikiLink of | dbr:Index_of_Internet-related_articles |
| is foaf:primaryTopic of | wikipedia-en:Parasitic_computing |