• Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 232
  • Last Modified:

Distributed Encrypted Systems?

I need to write a system that allows a user to create a vertual network (on a scale of 2-100 users).

I need to meet the following requirements -

A: The system may not have a central point of failer (no server or arbitor), nor may systems discover the identity of systems with witch they are not directly connected.

B: System must provide a virtual addressing scheam, that allows nodes to idntify other nodes. Nodes must be routed to, via connections to known systems. Example -
System A is directly connected to System B, System B is directly connected to System C. A can identify C via its virtual address and exchange data with it via B, but it may never determine the identity of the real identity of system C (it can't determine Cs IP, MAC etc.).

C: System must be secure, and must make it impossible to detect when a virtual link is in use and when it is idel (when a connection is idle, junk messages must be sent).

I am fully capable of writting such a system, but I would like to know, if someone has alredy written one (so I can just implement my application on top of it).

Thank you for your time,
Arrummzen
0
Arrummzen
Asked:
Arrummzen
1 Solution
 
sunnycoderCommented:
Hi Arrummzen,

> A: The system may not have a central point of failer (no server or arbitor), nor may systems
> discover the identity of systems with witch they are not directly connected.
This is more difficult than it sounds unless you configure the network statically
Main problem with this is how do network hosts discover each other ... If they broadcast their willingness to join the network, others can detect the identities ... If you use a root server, you have a central place of failure ...
If you are keen on concealing the identities, then maybe you can use a central/root server ... If it fails, a new root server can be elected by using quorum concensus or some other similar algorithm

> B: System must provide a virtual addressing scheam, that allows nodes to idntify other nodes.
> Nodes must be routed to, via connections to known systems. Example -
> System A is directly connected to System B, System B is directly connected to System C. A
> can identify C via its virtual address and exchange data with it via B, but it may never
> determine the identity of the real identity of system C (it can't determine Cs IP, MAC etc.).
Quite possible ... you can have two identities for a system

> C: System must be secure, and must make it impossible to detect when a virtual link is in
> use and when it is idel (when a connection is idle, junk messages must be sent).
easiest of all except for link arbitration ... you will have too many collisions and low throughput unless some kind of token  passing is used

I think several P2P applications such as IRC or may be even yahoo messenger run with similar architecture except that they have some root servers ... May be you can take a look at them and adapt the source code (I believe you can get source code for *nix machines, not sure though)

Sunnycoder
0
 
ArrummzenAuthor Commented:
Thank you. I will take a look at the systems you mentioned, I would like to avoid reinventing the wheel as much as possible.

Thank you for your time,
Arrummzen
0

Featured Post

Free Tool: Path Explorer

An intuitive utility to help find the CSS path to UI elements on a webpage. These paths are used frequently in a variety of front-end development and QA automation tasks.

One of a set of tools we're offering as a way of saying thank you for being a part of the community.

Tackle projects and never again get stuck behind a technical roadblock.
Join Now