- In computer science, we often struggle to find efficient algorithms for problems, so we conjecture...
Fantastic news! We've Found the answer you've been seeking!
Question:
Transcribed Image Text:
- In computer science, we often struggle to find efficient algorithms for problems, so we conjecture that they are hard. As we saw with graph isomorphisms, assuming this allows us to get zero-knowledge schemes. Let's use another common conjecture to form another zero-knowledge proof scheme. For the purposes of this section, p is a very large prime number. Definition 4.1. An integer g (mod p) is called a generator if every number in {1, 2, ..., p - 1} can be written as g (mod p) for some a. - Here, in the modular arithmetic setting, we charge costs a little differently: adding or multiplying two numbers mod p costs $1. Making random numbers still costs the same. An algorithm is efficient in modular arithmetic if it's a polynomial in log2 p, the number of binary digits in p. - Question (Already been answered)- Devise an efficient algorithm for computing ga (mod p). - Answer - - def square_and_multiply(g, a, p): result = 1 binary_a = bin(a) [2:] for bit in binary_a: result = (result * result) % p if bit == '1': result = (result * g) % p return result - It turns out that undoing the operation is much more difficult. Conjecture 4.2 (Discrete Logarithm Assumption). Given a generator g and g mod p for some a in {1,2,...,p-1)} that you do not know, there is no expected efficient algorithm to find a (i.e. one whose cost is, on average over all randomness, polynomial in log p). Suppose now that everyone has access to the same prime p and a generator g (mod p). Paula picks a random number a from the set {1,2,...,p- 1} and gives Victor u = g. Victor and Paula want to make a scheme so Victor can identify Paula in communications, without Victor himself being able to impersonate Paula. Question 4.4 (20 pts). Construct a ZKP scheme that allows Paula to convince Victor that she knows a, and does not allow others to convince Victor they know a. Here is a possible scheme with some steps removed that you can use as a template. 1. When she wants to log in, Paula chooses randomly at & Zp (where Zp is the set {0, 1, 2, ..., p- 1}), computes ut = mod p and sends ut to Victor. 2. Victor chooses randomly c Zp and sends c to Paula. 3. Paula computes az = mod p and sends it to Victor. (mod p). 4. Victor accepts the proof if gaz = Discuss the soundness and completeness of your scheme, and provide an efficient simulator for the transcript. - In computer science, we often struggle to find efficient algorithms for problems, so we conjecture that they are hard. As we saw with graph isomorphisms, assuming this allows us to get zero-knowledge schemes. Let's use another common conjecture to form another zero-knowledge proof scheme. For the purposes of this section, p is a very large prime number. Definition 4.1. An integer g (mod p) is called a generator if every number in {1, 2, ..., p - 1} can be written as g (mod p) for some a. - Here, in the modular arithmetic setting, we charge costs a little differently: adding or multiplying two numbers mod p costs $1. Making random numbers still costs the same. An algorithm is efficient in modular arithmetic if it's a polynomial in log2 p, the number of binary digits in p. - Question (Already been answered)- Devise an efficient algorithm for computing ga (mod p). - Answer - - def square_and_multiply(g, a, p): result = 1 binary_a = bin(a) [2:] for bit in binary_a: result = (result * result) % p if bit == '1': result = (result * g) % p return result - It turns out that undoing the operation is much more difficult. Conjecture 4.2 (Discrete Logarithm Assumption). Given a generator g and g mod p for some a in {1,2,...,p-1)} that you do not know, there is no expected efficient algorithm to find a (i.e. one whose cost is, on average over all randomness, polynomial in log p). Suppose now that everyone has access to the same prime p and a generator g (mod p). Paula picks a random number a from the set {1,2,...,p- 1} and gives Victor u = g. Victor and Paula want to make a scheme so Victor can identify Paula in communications, without Victor himself being able to impersonate Paula. Question 4.4 (20 pts). Construct a ZKP scheme that allows Paula to convince Victor that she knows a, and does not allow others to convince Victor they know a. Here is a possible scheme with some steps removed that you can use as a template. 1. When she wants to log in, Paula chooses randomly at & Zp (where Zp is the set {0, 1, 2, ..., p- 1}), computes ut = mod p and sends ut to Victor. 2. Victor chooses randomly c Zp and sends c to Paula. 3. Paula computes az = mod p and sends it to Victor. (mod p). 4. Victor accepts the proof if gaz = Discuss the soundness and completeness of your scheme, and provide an efficient simulator for the transcript.
Expert Answer:
Related Book For
Essentials Of Business Communication
ISBN: 9781285858913
10th Edition
Authors: Mary Ellen Guffey, Dana Loewy
Posted Date:
Students also viewed these algorithms questions
-
Let A, B be sets. Define: (a) the Cartesian product (A B) (b) the set of relations R between A and B (c) the identity relation A on the set A [3 marks] Suppose S, T are relations between A and B, and...
-
Q1. You have identified a market opportunity for home media players that would cater for older members of the population. Many older people have difficulty in understanding the operating principles...
-
Match each of the following energy band structures with the type of material it represents. Show Work A B C Empty conduction band Band gap Filled valence band Empty conduction band Band gap Filled...
-
What type of path does a moving object follow in the absence of a force?
-
Explain how cost information differs for profit measurement/inventory valuation requirements compared with decision-making requirements.
-
A solar collector design consists of an inner tube enclosed concentrically in an outer tube that is transparent to solar radiation. The tubes are thin walled with inner and outer diameters of 0.08...
-
A home insurance application consists of two forms: F1, which relates to the home owner, and F2, which relates to the property. On receipt, each application is processed, recorded, and separated into...
-
Two Riders players tackle the Argos quarterback in a football game. The first Riders player applies a force of 600 N [W] to the Argo player while the other Rider tackler impacts him with 750 N [S 15...
-
What Happens When You Dont Deliver on Your Promises Web: www.clearly.ca Facebook: Clearly Canadian If a new product or service seems like the perfect option to solve a problem or capitalize on an...
-
When would an employer have to pay into the unemployment insurance of Texas? a) An employee has business cards showing they operate in Texas. b) An employee in Kentucky answers calls made to a Texas...
-
When analyzing a system in static equilibrium that has the potential to rotate, what is your problem-solving process? Please state the steps that you take to solve for, say, a missing force.
-
Rocco operates a beauty salon as a sole proprietorship. Rocco also owns and rents an apartment building. In 2 0 2 3 , Rocco had the following income and expenses. You may assume that Rocco will owe $...
-
Alissa has the following income and expenses for the year: Income Salary $50,000 Interest income $350 Canadian Eligible Dividend income $500 Capital Gains $1,700 Expenses RRSP contribution...
-
The author includes the detail about Burn's district being "mostly opposed to the amendment" to help explain which earlier line?
-
How do firms strategically align their internal capabilities with external market opportunities to create a synergistic competitive advantage that is difficult for rivals to replicate ?
-
A person riding an exercise bicycle pedals at a speed of 2 revolutions per second. At this angular speed, how much time does it take for her to push the pedals through an angle of 120? 240 seconds 60...
-
What kind of financial pressures can an LBO cause?
-
With the rise of social media in business, your supervisor wants to stay abreast of the latest social media marketing trends. He asks you to research this topic and list the current trends with a...
-
What is the advantage of using a slide deck to report information and statistics?
-
Revise the following sentences to avoid confusing jargon, slang, clichés, and wordiness. 1. Our manager insists that we must think outside the box in promoting our new kitchen tool. 2....
-
When a honeybee flies through the air, it develops a charge of +17 pC. How many electrons did it lose in the process of acquiring this charge?
-
Falling raindrops frequently develop electric charges. Does this create noticeable forces between the droplets? Suppose two 1.8 mg drops each have a charge of +25 pC; these are typical values. The...
-
A housefly walking across a surface may develop a significant electric charge through a process similar to frictional charging. Suppose a fly picks up a charge of +52 pC. How many electrons does it...
Study smarter with the SolutionInn App