Q4. Discrete Zero-Knowledge Proofs: Alice and Bob both have the knowledge of the public variables p=17 and A=5. From these, they can compute B, using A* = B mod p. In addition, Alice knows x=10 and wants to prove to Bob that it knows the value of x without actually revealing it to Bob. Show the computations and communication that happens at different steps of the algorithm discussed in the course notes which finally prove to Bob that Alice knows the value of x without Alice revealing it.

Q4. Discrete Zero-Knowledge Proofs: Alice and Bob both have the knowledge of the public variables p=17 and A=5. From these, they can compute B, using A* = B mod p. In addition, Alice knows x=10 and wants to prove to Bob that it knows the value of x without actually revealing it to Bob. Show the computations and communication that happens at different steps of the algorithm discussed in the course notes which finally prove to Bob that Alice knows the value of x without Alice revealing it.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

q8- Alice and Bob are using the Diffie Hellman algorithm to agree on a shared secret. They exchange the values for the base (g) and modulus (p), select their own secret values (Alice chooses ‘a’ and Bob chooses ‘b’) and then proceed to use the algorithm to agree on a secret value. Assuming the following values: g = 7 p = 13 A = 1 (Alice’s intermediate value) b = 3 (Bob’s secret value) Answer the following questions: What is the intermediate value (B) that Bob calculates and sends to Alice? What secret value has Alice chosen? What is the secret value (s) that was agreed?
State and prove the base case State the inductive hypothesis Outline how the rest of the proof would go, that is, tell me roughly what will happen to complete the proof; you do not need to actually do the complete proof Show the following identity for the Fibonacci numbers,Fn=Fn−1+Fn−2withF0= 0andF1= 1:F2n+F2n+1=F2n+2
Alice and Bob want to use Diffie-Hellman Key Establishment to share a key and they have agreed to use the prime number p=97 as their modulus. They have to choose their g from the following list of numbers, none which are unfortunately primitive roots: 6, 9, 18Sort these numbers in the order of suitability, putting the most suitable on the left. Select one: a. 18, 6, 9 b. 9, 18, 6 c. 18, 9, 6 d. 6, 18, 9 e. 9, 6, 18
Alice wants Bob (the Bank) to sign a cheque, c. She has Bob's public key e and modulus N, and chooses a random number r such that gcd(r,N) = 1. She computes re (mod N) and then multiplies the cheque, c, by this number (mod N) and sends the resulting message off to Bob to be signed. When she receives his reply, m, what should she do with it to produce the signed cheque? Select one: a. Divide the reply, m, by rd. b. Divide the reply, m, by r. c. Divide the reply, m, by re. d. Nothing - the reply is the signed cheque
Alice wants Bob (the Bank) to sign a cheque, c. She has Bob's public key e and modulus N, and chooses a random number r such that gcd(r,N) = 1. She computes re (mod N) and then multiplies the cheque, c, by this number (mod N) and sends the resulting message off to Bob to be signed. When she receives his reply, m, what should she do with it to produce the signed cheque? Select one: a. Divide the reply, m, by rd. b. Divide the reply, m, by r. c. Divide the reply, m, by re. No - that won't do it. d. Nothing - the reply is the signed cheque
Assume that ∀x∃yP(x,y) is true and that the universe id true for x and y is non empty. Which of the following is true ? ∃x∀yP(x,y) and ∃y∃xP(x,y) . Prove your answer either using regular proof in the natural language or by giving a formal inference . In that latter case u may need to use existential rules of inference .
On the Island of Knights and Knaves we have two people A and B. A says: Exactly one of us is a knight if and only if B is a knight. B says: A is a knight if I’m a knight. determine if A and B are each a knight or a knave. (The problem might have no solutions, one solution, or many solutions.)
Subject: artificial intelligence Forward chaining and Backward chaining Suppose that the coding resulting from the acceptance of knowledge is as follows: A1 = body temperature >= 38°C A2 = cough A3 = cold A4 = persistent cough especially at night A5 = breath sounds P1 = common fever P2 = normal cough P3 = influenza / viral infection P4 = whooping cough P5 = respiratory tract infection The rules on the knowledge base include: R1 : IF A1 THEN P1 R2 : IF A2 THEN P2 R3 : IF P1 and (P2 or A3) THEN P3 R4 : IF P3 and A4 THEN P4 R5 : IF P3 and A5 THEN P5 The facts obtained from the user are that the fever, cough, and cough are more frequent at night (A1, A2, A4 → true). Explain the steps to get a conclusion if the inference technique used is: a. Forward chaining b. Backward chaining
6) (a) Useatruthtabletoshowthat∼(p→q)≡p∧∼q (b) Use the equivalence from part (a) to quickly figure out, without using a truth table, that p → q ≡ ∼ (p ∧ ∼ q) (c) Why does the equivalence from part (b) provide us with further evidence that we made the right choices in the last two lines of the truth table for conditional statements? (At least, it does for me!)
Subject : Artificial Intelligence Prove by resolution that "John likes peanuts" if you have these sentences in the knowledge base: - John likes all kind of food. - Apple and vegetable are food. - Anything anyone eats and not killed is food - Anil eats peanuts and still alive - Hany eats everything that Anil eats
Question 15 pap Suppose we have a Monte Carlo algorithm, A, and a deterministic algorithm, B, for testing if the output of A is correct. How can we use A and B to construct a Las Vegas algorithm? Also, if A succeeds with probability ½ and both A and B run O(n) time, what is the expected running time of the Las Vegas algorithm that is produced? Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line
Construct a Turing machine (your answer must show all of the 5-tuples involved) that computes n mod 3, where n ≥ 0. You must use unary ones format: 0 is 1, 1 is 11, 2 is 111, and n is n+1 1s.Note that all computations: of n mod m must be either 0 (1), 1 (11), or 2 (111).Be sure to leave the read/write head over the leftmost 1 when done.Verify your Turing machine by giving a step-by-step trace of 2 mod 3 and 7 mod 3.