hwsol5.5 - CSci 5403, Spring 2010 Homework 5.5 Ruoyu Sun...

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

View Full Document Right Arrow Icon
CSci 5403, Spring 2010 Homework 5.5 Ruoyu Sun The ”set lower bound protocol” can be applied to the following problem: prove | S | ≥ 2 K versus | S | ≤ K . Claim 8.16.1 proves the following result: if S ⊂ { 0 , 1 } m , | S | ≤ 2 k 2 , then for p = | S | / 2 k , p Pr h R H m,k ,y R { 0 , 1 } k ( x S,h ( x ) = y ) 3 4 p. The original protocol( proving 2 K vs < K ) works because 4 3 < 2; now, since 4 3 < 1 . 4 < 2, the protocol also works for this problem.(Define q = Pr h R H m,k ,y R { 0 , 1 } k ( x S,h ( x ) = y ) ,p * = K/ 2 k . If | S | ≥ 2 K , then q 3 4 p (2) p * ≥ 1 . 05 p * ; if | S | ≤ K , then q p * . ) Similarly, the ”set upper bound” protocol can be applied to: prove | S | ≤ K versus | S | ≥ 2 K . Using these two results, the interactive proof system for our problem is de- scribed as follows.(We assume in both protocols, the completeness/soundness errors are both no more than 1 3 ). Note that if
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

hwsol5.5 - CSci 5403, Spring 2010 Homework 5.5 Ruoyu Sun...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online