Results 211 to 220 of about 11,914 (236)
Some of the next articles are maybe not open access.
2006 IEEE International Conference on Evolutionary Computation, 2006
The aim of the paper is to obtain a DNA secret sharing scheme for general access structure that plays an important role in cryptography. Our scheme involves two very simple DNA computing techniques known as mixing and DNA sequencing. The simplicity of these two techniques and the compact nature of DNA make the system easy to implement.
openaire +1 more source
The aim of the paper is to obtain a DNA secret sharing scheme for general access structure that plays an important role in cryptography. Our scheme involves two very simple DNA computing techniques known as mixing and DNA sequencing. The simplicity of these two techniques and the compact nature of DNA make the system easy to implement.
openaire +1 more source
1983
All through this paper the notion of secret that we will discuss is a notion linked to the use of a digital quantity called “key” for a given equipment that is turned on by this key. To be more precise: the value of a variable is secret for a given piece of equipment if the possibility of use of this equipment, by trying all possible values of the ...
openaire +1 more source
All through this paper the notion of secret that we will discuss is a notion linked to the use of a digital quantity called “key” for a given equipment that is turned on by this key. To be more precise: the value of a variable is secret for a given piece of equipment if the possibility of use of this equipment, by trying all possible values of the ...
openaire +1 more source
International Journal of Engineering in Computer Science, 2021
K Santha Sheela ME +4 more
openaire +1 more source
K Santha Sheela ME +4 more
openaire +1 more source
2015
Suppose you have a secret s which you wish to share amongst a set P of n parties. You would like certain subsets of the n parties to recover the secret but not others. The classic scenario might be that s is a nuclear launch code and you have four people, the president, the vice-president, the secretary of state and a general in a missile silo.
openaire +1 more source
Suppose you have a secret s which you wish to share amongst a set P of n parties. You would like certain subsets of the n parties to recover the secret but not others. The classic scenario might be that s is a nuclear launch code and you have four people, the president, the vice-president, the secretary of state and a general in a missile silo.
openaire +1 more source