Feb 26 problem set 2

# A Concrete Introduction to Higher Algebra, 2nd Edition

• Notes
• davidvictor
• 4

This preview shows pages 1–2. Sign up to view the full content.

University of California — Berkeley Handout PS2 CS276: Cryptography February 26, 2002 Professors Luca Trevisan and David Wagner Problem Set 2 This problem set is due in class on Thursday, March 7th. Problem 1. [Access control] You have founded a hot new startup that is building a trendy new high-tech padlock. Your padlock comes with a factory-set combination, and a serial number printed on the back. However, one potential problem is that some customers will forget their combination, and when they call you up and give their serial number, you need to be able to tell them their combination. Moreover, you need to make sure that only the factory can do this: thieves should not be able to deduce the combination by looking at the serial number. (a) You’re going to sell a lot of locks. Describe a solution that does not require much storage at the factory: say, sub-linear in the number of locks sold. (The lower the storage needed, the better.) (You may make reasonable computational assumptions, such as that there exist secure one-way functions.) (b) You tried the above, but were forced to disclose in your business plan the risk that, if some researcher finds a constructive proof that P = NP , then your padlocks may become insecure. This got too many confused looks from the venture capitalists, so now the goal is to try to avoid this. Describe a solution that is unconditionally secure. (You may not make any unproven computational assumptions.) Problem 2. [Computational indistinguishability] We define a distance measure on probability distributions as follows: d R ( D, D 0 ) = max A | Pr x D [ A ( x ) = 1] - Pr x 0 D 0 [ A ( x 0 ) = 1] | where the maximum is taken over all algorithms running with resources R . Here R denotes a set of resources, which is used to restrict the adversary. For instance, R might list a bound on number of steps of computation, on queries to the oracle, on the amount of memory used, or something else. If algorithm A runs with resources R and A 0 with R 0 , then let R + R 0 denote the resources used by running first A then A 0 .

This preview has intentionally blurred sections. Sign up to view the full version.

This is the end of the preview. Sign up to access the rest of the document.
• Spring '02
• Trevisan
• Cryptography, one-way function, One-Way Functions, pseudorandom generator, Handout PS2

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern