1 / 18

The Bright Side of Hardness

The Bright Side of Hardness. Relating Computational Complexity and Cryptography. Oded Goldreich Weizmann Institute of Science. Background: The P versus NP Question. Solving problems is harder than checking solutions. Proving theorems is harder than verifying proofs. systems that are

taya
Download Presentation

The Bright Side of Hardness

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. The Bright Side of Hardness Relating Computational Complexity and Cryptography Oded GoldreichWeizmann Institute of Science

  2. Background: The P versus NP Question Solving problems is harder than checking solutions Proving theorems is harder than verifying proofs systems that are easy to use but hard to abuse  CRYPTOGRAPHY useful problems are infeasible to solve

  3. One-Way Functions The good/bad news depends on typical(average-case) hardness This leads to the def. of one-way functions (OWF) = creating images for which it is hard to find a preimage • DEF:f :{0,1}*{0,1}*is aone-way functionif • fis easy to evaluate • fis hard to invert in an average-case sense; that is, for every efficient algorithmA E.g..: MULT 6783  8471 = 57458793 ????  ???? = 45812601

  4. Applications to Cryptography • Using any OWF (e.g., assuming intractability of factoring): • Private-Key Encryption and Message Authentication; • Signature Schemes • Commitment Schemes • and more… • Using any Trapdoor Permutation (e.g., assuming intractability of factoring): • Public-Key Encryption; • General Secure Multi-Party Computation • and more…

  5. easy x f(x) easy HARD b(x) Amplifying Hardness Is some “part of the preimage” of a OWF extremely hard to predict from the image? Recall: by def. it is hard to retrieve the entire preimage. • DEF:b :{0,1}*{0,1}is ahardcoreof f • bis easy to evaluate • b(x)is hard to predict from f(x) in an average-case sense; i.e., for every eff. alg.A Suppose that f is 1-1. Then, if f has a hardcore, then f is hard to invert.

  6. THM:For every OWF f, the predicateb(x,r)= i[n] xi rimod 2 is a hardcore of f’(x,r)=(f(x),r). COR (to the proof): IfyH(y) {0,1}mis hard to effect, then (y,S)iS H(y)i mod 2is hard to predict (better than 50:50). Warm-up: show that b is moderately hard to predict in the sense thatfor every eff. alg. A w.p. 0.76 = = w.p. 0.76 b(x,r)+xi b(x,r) The Existence of a Hardcore O.w., obtain each (i.e., ith) bit of xas follows. On input f(x), repeat: Select random r{0,1}nand guessA(f(x),r+e(i))+A(f(x),r). b(x,e(i))=xi

  7. 1st Application: Pseudorandom Generators Deterministic programs (alg’s) that stretch short random seeds to long(er) pseudorandom sequences. seed G (random) ? totally random (mental experiment) THM:PRG if and only if OWF

  8. Pseudorandom Generators (form.) seed G Deterministic alg’s that stretch short random seeds to long(er) pseudorandom sequences. ? totally random • DEF:G is a pseudorandom generator (PRG) if • It is efficiently computable: s G(s) is easy. • It stretches: |G(s)| > |s| (or better |G(s)| >> |s|). • Its output is comput. indistinguishable from random; that is, for every efficient alg’ D (where ) THM:PRG if and only if OWF

  9. PRG iff OWF (“Hardness vs Randomness”) THM:PRG if and only if OWF PRG implies OWF:LetG be a PRG (with doubling stretch). Define f(x)=G(x). Note: inverting f yields distinguishing G‘s output from random, since random 2|x|-bit strings are unlikely to have a preimage under f. OWF implies PRG (special case):Letfbe a 1-1 OWF, with hardcore b. Then G(s)=f(s)b(s) is a PRG (with minimal stretch (of a single bit)). Recall (THM): PRGs with minimal stretch (of a single bit) imply PRGs with maximal stretch (i.e., allowing efficient map 1|s| 1|G(s)|).

  10. Pseudorandom Functions (PRF) • DEF:{fs:{0,1}|s|{0,1}|s|} is a pseudorandom function (PRF) if • Easy to evaluate: (s,x) fs(x) is easy. • It passes the “Turing Test (of randomness)”: q1 either fs or totally random function a1 qt at THM:PRG imply PRF. Historical notes (re Turing)

  11. E msg key Cryptography: private-key encryption (based on PRF) (same) key D msg ciphertext Ek(msg) = (1) rR{0,1}n (2) ciphertext = (r,fk(r)msg) ciphertext = (r,y) Dk(r,y) = y  fk(r)

  12. S msg key Cryptography: message authentication (based on PRF) (same) key tag yes or no V msg + tag Sk(msg) = fk(msg) = tag Vk(msg,tag) = 1 iff tag = fk(msg)

  13. More Cryptography: Sign and Commit Signature scheme  message authentication except that it allows universal verification(by parties not holding the signing key). THM:OWF imply Signature schemes. • Commitment scheme = commit phase + reveal phase s.t. • Hiding:commit phase hides the value being committed. • Binding:commit phase determines a single value • that can be later revealed. • THM: PRG imply Commitment schemes.

  14. A generic cryptographic task:forcing parties to follow prescribed instructions Party private input:x Public info.:y Prescribed instruction: for a predetermined f, send f(x,y). z  x s.t. z = f(x,y) ? The Party can prove the correctness of zby revealing x, but this will violate the privacy of x. Prove in “zero-knowledge” thatxexists (w.o. revealing anything else). THM: Commitment schemes imply ZK proofs as needed.

  15. Zero-Knowledge proof systems E.g., for graph 3-colrability (which is NP-complete). Prove that a graphG=(V,E)is 3-colorable w.o. revealing anything else (beyond what follows easily from this fact). • The protocol = repeats the following steps suff. many (i.e., |E|2) times: • Prover commits to a random relabeling of a (fixed) 3-coloring (i.e., commit to the color of each vertex separately). • Verifier requests to reveal the colors of the endpoints of a random edge. • Prover reveals the corresponding colors. • Verifier checks that the colors are legal and different. THM: OWF imply ZK proofs for 3-colorability.

  16. P1: P2: Pm: x1 x2 xm The effect of a trusted party can be securely emulated by distrustful parties. f1(x) trusted party fm(x) Universal Results: general secure multi-party computations Any desired multi-party functionality can be implemented securely. (represents a variety of THMs in various models, some relying on computational assumptions (e.g., OWF etc)). P1P2Pm(predeterminedfi’s) x1x2xm(local inputs: x=(x1,x2,…,xm)) f1(x) f2(x) fm(x) (desired local outputs)

  17. The End Note: the slides of this talk are available at http://www.wisdom.weizmann.ac.il/~oded/T/ecm08.ppt Material on the Foundations of Cryptography (e.g., surveys and a two-volume book) is available at http://www.wisdom.weizmann.ac.il/~oded/foc.html

  18. Historical notes relating PRFs to Turing • The term “Turing Test of Randomness” is analogous to the famous “Turing Test of Intelligence” which refers to distinguishing a machine from Human via interaction. • Even more related is the following quote from Turing’s work (1950):“I have set up on a Manchester computer a small programme using only 1000 units of storage, whereby the machine supplied with one sixteen figure number replies with another within two seconds. I would defy anyone to learn from these replies sufficient about the programme to be able to predict any replies to untried values.” Back to the PRF slide

More Related