Parasitic computing

related topics
{system, computer, user}
{math, number, function}
{specie, animal, plant}
{law, state, case}

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.

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.

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 leached from the other program; and 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 application stack, 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.

See also

Introduction Internet Communication Proof Of Concept 2-SAT Problem Implementation Using TCP Issues

    ▪ Problems For Parasites
    ▪ Problems For Servers

How It Differs From Others Future Summary


External links

Full article ▸

related documents
Remote procedure call
Microsoft BASIC
Access control list
Monolithic kernel
Nautilus (file manager)
Run-length encoding
IBM 1620 Model I
Application binary interface
Wide area information server
Pentium FDIV bug
OpenGL Utility Toolkit
Analytical engine
Ed (text editor)
Mutual exclusion
Synchronized Multimedia Integration Language
LZ77 and LZ78
Role-based access control
Visual DialogScript
HTTP 404
Core dump
Sorcerer (operating system)
Creator code
Abstract Window Toolkit
Distributed-queue dual-bus