Cryptology ePrint Archive: Report 2006/140  GVG-RP: A Net-
centric Negligibility-based Security Model for Self-organizing
Networks  Jiejun Kong  Abstract: We present a rigorous approach
to building a secure self-organizing mobile ad hoc network
(MANET). In a highly dynamic environment like MANET, it is
impossible to ensure absolute security to protect everything. We
have to speak of the "infeasibility" of breaking the security
system rather than the "impossibility" of breaking the same
system. More formally, security is defined on the concept of
"negligible", which is asymptotically sub-polynomial with
respect to a pre-defined system parameter $n$. Intuitively, the
parameter $n$ in modern cryptography is the key length. The
crypto-system's security is broken if the adversary's capability
is of exponentials of $n$, and the efficiency of all related
algorithms is measured in polynomials of $n$.  We adopt the same
formal security notion in ad hoc network security research. In
network security, the network scale (