GATE2002-2.20

2.8k views

Dynamic linking can cause security concerns because

1. Security is dynamic
2. The path for searching dynamic libraries is not known till runtime
4. Cryptographic procedures are not available for dynamic linking

1. Nonsense option, No idea why it is here.
2. The path for searching dynamic libraries is not known till runtime -> This seems most correct answer.
3. This is not true. Linking in itself not insecure.
4. There is no relation between Cryptographic procedures & Dynamic linking.

edited by
4
Lol! nice answer for option A.
1
i liked option a answer :P :D
2
how can  option (B) cause security concerns?
1
Anyone explain the B option ....
14

process should access only area which is allocated to it .if it has permission then only it can access the other process resource.with hardware we can restrict the process to access the addresses between base and limit.

In case of dynamic linking process may access the resource of other process so OS should take care of it .

In case malware try to access the other process resource which it should not ,OS must take care of such unauthorized access.

7
In dynamic linkin, all external references are that of a stub.

A stub is a piece of code which knows how to locate and load the appropriate memory resident library routine which is needed.

So, if this stub contains the address of a malicious code, then security is a concern.
Dynamic linking is type of linking in which libraries required by the program are linked during run time.

And evaluating all options B seems correct one.
1
@Bikram Sir Dynamic linking is not making any sense with cryptography  for security, option B seems to be correct.
1
yes there is no relation between cryptography and dynamic linking.
0
Thanks, Sir.
1
@Bikram sir

option B is true.  but how can  it cause security concerns ?

sir give me some real time example  please
b.   path is not  not  known  so it's  not  easy to intruder to place malicious program.
0
Is this can be a logic?

People finding explanation on option B may go to the following link:

Related questions

1
2.3k views
The optimal page replacement algorithm will select the page that Has not been used for the longest time in the past Will not be used for the longest time in the future Has been used least number of times Has been used most number of times
The following solution to the single producer single consumer problem uses semaphores for synchronization. #define BUFFSIZE 100 buffer buf[BUFFSIZE]; int first = last = 0; semaphore b_full = 0; semaphore b_empty = BUFFSIZE void producer() { while(1) { produce an ... $p2$, immediately after $c1$ and immediately before $c2$ so that the program works correctly for multiple producers and consumers.
Relation $R$ is decomposed using a set of functional dependencies, $F$, and relation $S$ is decomposed using another set of functional dependencies, $G$. One decomposition is definitely $\text{BCNF}$, the other is definitely $3NF$, but it is not known which ... (Assume that the closures of $F$ and $G$ are available). Dependency-preservation Lossless-join $\text{BCNF}$ definition $3NF$ definition