According to the secure problems within MANET, this paper proposes Cooperative On-demand Secure Route (COSR), a novel secure source route protocol, against malicious and selfish behaviors.
For example, the classical solution to the thresholding problem (this problem is commonly referred to as the Secure Millionaire Problem in SMC literature), or comparing two private numbers and, is to use Oblivious Transfer (OT) [30].
They began working on Glimpse as a side project, but in the wake of the NSA spying scandal, they decided to tackle the secure messaging problem head-on.
In the case of peer-to-peer networks, we find that application of second best theory to the secure routing problem yields recommendations that advise non-malicious peers on how to route messages optimally given observed misbehavior of their neighbors.
Thus the leaking of relationship information shouldn't be a main secure problem we have to solve in current work.
This paper investigates the secure state estimation problem for cyber-physical systems (CPSs) under disturbance and sparse sensor attacks.
In this section, we formulate the effective secure throughput optimization problem in the system described above as a POMDP [21], which can determine the optimal policy for the number of messages/data blocks in the MT selection (for security) and relay selection (for QoS) to maximize the system effective secure throughput.
While a good thing for the majority of users, helping keep their computers up to date and secure, this problem highlights the dangers of a mandatory update policy.
The miner that solves the problem first secures the right to append the block to the current longest block chain.
In [6, 7], the authors address the problem of securing a communication, between a sender and a receiver assisted by a relay, from the relay itself.
