Question

In: Computer Science

Suppose that a certain authority is running a (publicly accessible) database of users’ public keys. Let...

Suppose that a certain authority is running a (publicly accessible) database of users’ public keys. Let us define the following procedure for revoking a public key from the database. When a user Alice claims that the secret key skA corresponding to his public key pkA was stolen, she sends to the authority the statement “Revoke Alice’s public key pkA” which is signed using skA . Upon receiving such the statement, the authority revokes pkA from the database. Explain why it is not necessary for the authority to check Alice’s identity in this case. In particular, explain why it is not a problem that an adversary who has stolen Alice’s secret key skA can forge signatures for this key. Hint: Consider the following two cases: 1) Alice’s secret key skA was not stolen; 2) Aice’s secret key skA was stolen.

Solutions

Expert Solution

Here is what we know,

pkA,skA =Alice's public and private keys respectively.

Note that skA is a secret key that Alice possesses and shouldn't be shared with anyone.

The private key is to be shared between two parties.

The public key can be used by anyone but the private key is to be shared between two parties only.

Also, Private Key is used to both encrypt and decrypt the data and is shared between the sender and receiver of encrypted data.The Public Key is only used to encrypt data and to decrypt the data, the private key is used and is shared.

The authority will encrypt a certain message using Alice's public key and then send the encrypted message to Alice. Alice can then use his private key to decrypt the message, upon receiving it.

Case 1: (Alice's secret key skA was not stolen)

In case the private key is not stolen, Alice would not complain to the authorities and can succesfully decrypt any encypted message sent by the authority. Even if she does complain of her skA being stolen , the authority can revoke Alice's pkA. A new pkA will be alloted to him and the sKA for the corresponding new pkA will be shared with Alice.

Case 2: (Aice’s secret key skA was stolen)

In this case Alice will complain to the authority and they will immediately revoke Alice's pkA. So now alice will write to the authority, this message will be encrypted using Alice's skA (possessed only by her). Thus, it is not necessary for the authority to check Alice’s identity in this case.

it is not a problem that an adversary who has stolen Alice’s secret key skA can forge signatures for this key as since Alice's pkA has been revoked , possessing and forging  of Alice's skA will practically be of no use.


Related Solutions

[Public key revocation procedure] Suppose that a certain authority is running a (publicly accessible) database of...
[Public key revocation procedure] Suppose that a certain authority is running a (publicly accessible) database of users’ public keys. Let us define the following procedure for revoking a public key from the database. When a user Bob claims that the secret key skB corresponding to his public key pkB was stolen, he sends to the authority the statement “Revoke Bob’s public key pkB” which is signed using skB . Upon receiving such the statement, the authority revokes pkB from the...
A certain business keeps a database of information about its customers. A. Let C be the...
A certain business keeps a database of information about its customers. A. Let C be the rule which assigns to each customer shown in the table his or her home phone number. Is C a function? Explain your reasoning.
At a certain university 12% of students are left hand users. Suppose that a random sample...
At a certain university 12% of students are left hand users. Suppose that a random sample of 8 students were admitted in 2015 is selected. (a) What is the probability that none of them will be a left hand user? (b) What is the probability that 5 of them are left hand users? (c) What is the probability that at least 7 of them are left hand user? (d) What is the probability that at most 7 of them are...
Suppose that the probability that a certain experiment will be successful is 0.4, and let X...
Suppose that the probability that a certain experiment will be successful is 0.4, and let X denote the denote the number of successes that are obtained in 15 independent performances of the experiment. What is the probability of getting at least 12 successes experiments? What is the expected value and variance for the described distribution?
Theorem 5.1 Let n measure the size of the input for a certain task, and suppose...
Theorem 5.1 Let n measure the size of the input for a certain task, and suppose that any algorithm that solves this task must distinguish between f (n) different pos- sibilities. If an algorithm is based on an operation X that has m different outcomes, then the worst-case number of X operations this algorithm performs must be at least logm(f(n)). Consider the task of selecting a person at random from a group of n people by repeatedly rolling a single...
17#11 Let us suppose that a certain probability instructor manages, with probability 1, to write exams...
17#11 Let us suppose that a certain probability instructor manages, with probability 1, to write exams that have mean 60 and standard deviation 12. The instructor is teaching two classes, one of size 64 and the other of size 36, and is about to give an exam to both classes. (a) Approximate the probability that the average test score in the class of size 64 exceeds 65. Probability ≈≈ (b) Repeat part (a) for the class of size 36. Probability...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT