1 / 10

Other interesting issues:

Other interesting issues:. Compression within record - e.g. code selection collection of records - e.g. find common patterns Encryption. Encrypting Records. new record r. E(r). trusted processor. dbms. E(r 1 ) E(r 2 ) E(r 3 ) E(r 4 ). Encrypting Records. search F(r)=x. ??.

zita
Download Presentation

Other interesting issues:

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. Other interesting issues: • Compression • within record - e.g. code selection • collection of records - e.g. find common patterns • Encryption

  2. Encrypting Records new record r E(r) trusted processor dbms E(r1) E(r2) E(r3) E(r4) ...

  3. Encrypting Records search F(r)=x ?? trusted processor dbms E(r1) E(r2) E(r3) E(r4) ...

  4. Search Key in the Clear search k=2 Q: k=2 A: [2, E(b2)] trusted processor dbms [1, E(b1)] [2, E(b2)] [3, E(b3)] [4, E(b4)] ... • each record is [k,b] • store [k, E(b)] • can search for records with k=x

  5. Encrypt Key search k=2 Q: k’=E(2) A: [E(2), E(b2)] trusted processor dbms [E(1), E(b1)] [E(2), E(b2)] [E(3), E(b3)] [E(4), E(b4)] ... • each record is [k,b] • store [E(k), E(b)] • can search for records with k=E(x)

  6. Issues • Hard to do range queries • Encryption not so good. • Better to use encryption that does not always generate same cyphertext k k E(k, random) E D simplification

  7. How Do We Search Now? ??? search k=2 A: [E(2,dhe), E(b2)] [E(2, lkz), E(b4)] Q: k’=E(2) trusted processor dbms [E(1, abc), E(b1)] [E(2, dhe), E(b2)] [E(3, nft), E(b3)] [E(2, lkz), E(b4)] ... • each record is [k,b] • store [E(k, rand), E(b)] • can search for records with k=E(x,???)?

  8. Solution? • Develop new decryption function: D(f(k1), E(k2, rand)) is true if k1=k2

  9. Solution • Develop new decryption function: D(f(k1), E(k2, rand)) is true if k1=k2 Q: check if D(f(2),*) true search k=2 A: [E(2,dhe), E(b2)] [E(2, lkz), E(b4)] trusted processor dbms [E(1, abc), E(b1)] [E(2, dhe), E(b2)] [E(3, nft), E(b3)] [E(2, lkz), E(b4)] ...

  10. Issues • Cannot do non-equality predicates • Hard to build indexes

More Related