On the Practicality of PIR - Radu Sion
On the Practicality of PIR - Radu Sion On the Practicality of PIR - Radu Sion
Protocol overview Stony Brook Network Security and Applied Cryptography Lab bit string d[n] 3 Π(v[i]*d[i]) = QNR ? yes d[i]=1 Question d[i]=? QR 1 QR 2 QR 3 . QR i-1 QNR QR i+1 . QR n-2 QR n-1 QR n v[i] 1 Π(v[i]*d[i]) Perform same protocol per column and look at returned product of interest 2 x x x x x x x 1 2 3 n-2 n-1 n escape O(n) costs i n x x x x x n x x Π 1 Π 2 ... Π 3 client server Practicality of Private Information Retrieval (NDSS, February 2006) 6
Execution time analysis Stony Brook Network Security and Applied Cryptography Lab PIR-favorable simplification: we ignore anything else but the server-side modular multiplication costs. Conclusion: PIR is “practical” iff. per-bit serverside complexity is faster than bit transfer. Practicality of Private Information Retrieval (NDSS, February 2006) 7
- Page 1 and 2: Network Security and Applied Crypto
- Page 3 and 4: What is “practical” ? Stony Bro
- Page 5: Time to “illustrate” … Stony
- Page 9 and 10: Past: MIPS Schedule Stony Brook Net
- Page 11 and 12: Present: Hardware Stony Brook Netwo
- Page 13 and 14: Present: Low bandwidth conditions S
- Page 15 and 16: Future: CPU Speed follows Moore ! S
- Page 17 and 18: Future: 1 bit multiplication vs. tr
- Page 19 and 20: What do we do ? Stony Brook Network
- Page 21 and 22: IBM 4764 Stony Brook Network Securi
- Page 23 and 24: Comparison: Pentium 4 Stony Brook N
- Page 25 and 26: in/yes > /dev/lunchtime Stony Brook
Execution time analysis<br />
Stony Brook Network Security and Applied Cryptography Lab<br />
<strong>PIR</strong>-favorable simplification: we ignore anything else<br />
but <strong>the</strong> server-side modular multiplication costs.<br />
Conclusion: <strong>PIR</strong> is “practical” iff. per-bit serverside<br />
complexity is faster than bit transfer.<br />
<strong>Practicality</strong> <strong>of</strong> Private Information Retrieval (NDSS, February 2006)<br />
7
Change language