1 Simultaneous Distribution Control and Privacy Protection for Proxy based Media Distribution George Mason University Songqing Chen (George Mason University)

Slides:



Advertisements
Similar presentations
Cost-Based Cache Replacement and Server Selection for Multimedia Proxy Across Wireless Internet Qian Zhang Zhe Xiang Wenwu Zhu Lixin Gao IEEE Transactions.
Advertisements

ULC: An Unified Placement and Replacement Protocol in Multi-level Storage Systems Song Jiang and Xiaodong Zhang College of William and Mary.
1 Sizing the Streaming Media Cluster Solution for a Given Workload Lucy Cherkasova and Wenting Tang HPLabs.
Some Open Problems in Publish/Subscribe Networking David S. Rosenblum Chief Technology Officer PreCache Inc.
Pervasive Web Content Delivery with Efficient Data Reuse Chi-Hung Chi and Cao Yang School of Computing National University of Singapore
Caching Strategies in Transcoding-Enabled Proxy System for Streaming Media Distribution Networks Bo Shen Sung-Ju Lee Sujoy Basu IEEE Transactions On Multimedia,
1March-04 Proxy Cache Management for Fine-Grained Scalable Video Streaming Jiangchuan Liu The Chinese University of Hong Kong Xiaowen Chu and Jianliang.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada Multimedia Streaming in Dynamic Peer-to-Peer Systems and Mobile Wireless.
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
Peer-to-peer Multimedia Streaming and Caching Service Jie WEI, Zhen MA May. 29.
Multimedia Proxy Caching Mechanism for Quality Adaptive Streaming Applications in the Internet R. Rejaie, H. Yu, M. Handley, D. Estrin.
October 14, 2002MASCOTS Workload Characterization in Web Caching Hierarchies Guangwei Bai Carey Williamson Department of Computer Science University.
An Analysis of Internet Content Delivery Systems Stefan Saroiu, Krishna P. Gommadi, Richard J. Dunn, Steven D. Gribble, and Henry M. Levy Proceedings of.
1 A Framework for Lazy Replication in P2P VoD Bin Cheng 1, Lex Stein 2, Hai Jin 1, Zheng Zhang 2 1 Huazhong University of Science & Technology (HUST) 2.
Peer-to-Peer Based Multimedia Distribution Service Zhe Xiang, Qian Zhang, Wenwu Zhu, Zhensheng Zhang IEEE Transactions on Multimedia, Vol. 6, No. 2, April.
Improving Proxy Cache Performance: Analysis of Three Replacement Policies Dilley, J.; Arlitt, M. A journal paper of IEEE Internet Computing, Volume: 3.
Cooperative Caching Middleware for Cluster-Based Servers Francisco Matias Cuenca-Acuna Thu D. Nguyen Panic Lab Department of Computer Science Rutgers University.
Prefix Caching assisted Periodic Broadcast for Streaming Popular Videos Yang Guo, Subhabrata Sen, and Don Towsley.
Exploiting Content Localities for Efficient Search in P2P Systems Lei Guo 1 Song Jiang 2 Li Xiao 3 and Xiaodong Zhang 1 1 College of William and Mary,
Hybrid Video Downloading / Streaming over peer-to-peer network Yufeng Shan and Shivkumar Kalyanaraman Multimedia and Expo, ICME '03. Proceedings.
A Survey of proxy Cache Evaluation Techniques 系統實驗室 田坤銘
1 An Overlay Scheme for Streaming Media Distribution Using Minimum Spanning Tree Properties Journal of Internet Technology Volume 5(2004) No.4 Reporter.
Web Caching Robert Grimm New York University. Before We Get Started  Illustrating Results  Type Theory 101.
Squirrel: A decentralized peer- to-peer web cache Paul Burstein 10/27/2003.
A Hybrid Caching Strategy for Streaming Media Files Jussara M. Almeida Derek L. Eager Mary K. Vernon University of Wisconsin-Madison University of Saskatchewan.
Caching And Prefetching For Web Content Distribution Presented By:- Harpreet Singh Sidong Zeng ECE Fall 2007.
Peer-to-peer Multimedia Streaming and Caching Service by Won J. Jeon and Klara Nahrstedt University of Illinois at Urbana-Champaign, Urbana, USA.
Some recent work on P2P content distribution Based on joint work with Yan Huang (PPLive), YP Zhou, Tom Fu, John Lui (CUHK) August 2008 Dah Ming Chiu Chinese.
ITU Workshop on "Future Trust and Knowledge Infrastructure", Phase 1 Geneva, Switzerland, 24 April 2015 Tussles for Edge Network Caching Patrick Poullie.
Institut Mines-Télécom “Digital Safe Client via HTML5 ” Mayssa JEMEL Ahmed SERHROUCHNI Journée: Cloud Coffre Fort Numérique 26 Février 2015.
By Ravi Shankar Dubasi Sivani Kavuri A Popularity-Based Prediction Model for Web Prefetching.
Dynamic and Decentralized Approaches for Optimal Allocation of Multiple Resources in Virtualized Data Centers Wei Chen, Samuel Hargrove, Heh Miao, Liang.
1 Overview of Hyper-Proxy Project: High-Quality Streaming Media Delivery (an academia-industry collaboration) Xiaodong Zhang (Major Team Members: Songqing.
1 An SLA-Oriented Capacity Planning Tool for Streaming Media Services Lucy Cherkasova, Wenting Tang, and Sharad Singhal HPLabs,USA.
M i SMob i S Mob i Store - Mobile i nternet File Storage Platform Chetna Kaur.
Yongzhi Wang, Jinpeng Wei VIAF: Verification-based Integrity Assurance Framework for MapReduce.
GreenDelivery: Proactive Content Caching and Push with Energy- Harvesting-based Small Cells IEEE Communications Magazine, 2015 Sheng Zhou, Jie Gong, Zhenyu.
Web Cache Replacement Policies: Properties, Limitations and Implications Fabrício Benevenuto, Fernando Duarte, Virgílio Almeida, Jussara Almeida Computer.
Web Prefetching Between Low-Bandwidth Clients and Proxies : Potential and Performance Li Fan, Pei Cao and Wei Lin Quinn Jacobson (University of Wisconsin-Madsion)
Distributing Layered Encoded Video through Caches Authors: Jussi Kangasharju Felix HartantoMartin Reisslein Keith W. Ross Proceedings of IEEE Infocom 2001,
Segment-Based Proxy Caching of Multimedia Streams Authors: Kun-Lung Wu, Philip S. Yu, and Joel L. Wolf IBM T.J. Watson Research Center Proceedings of The.
Identity-Based Secure Distributed Data Storage Schemes.
ITU Workshop on "Future Trust and Knowledge Infrastructure", Phase 1 Geneva, Switzerland, 24 April 2015 Tussles for Edge Network Caching Patrick Poullie.
PPWEB: A Peer-to-Peer Approach for Web Surfing On the Go Ling-Jyh Chen, Ting-Kai Huang Institute of Information Science, Academia Sinica, Taiwan Guang.
ECO-DNS: Expected Consistency Optimization for DNS Chen Stephanos Matsumoto Adrian Perrig © 2013 Stephanos Matsumoto1.
Understanding the Performance of Web Caching System with an Analysis Model and Simulation Xiaosong Hu Nur Zincir-Heywood Sep
Sharing Social Content from Home: A Measurement-driven Feasibility Study Massimiliano Marcon Bimal Viswanath Meeyoung Cha Krishna Gummadi NOSSDAV 2011.
1 Evaluation of Cooperative Web Caching with Web Polygraph Ping Du and Jaspal Subhlok Department of Computer Science University of Houston presented at.
Multicache-Based Content Management for Web Caching Kai Cheng and Yahiko Kambayashi Graduate School of Informatics, Kyoto University Kyoto JAPAN.
Efficient P2P Search by Exploiting Localities in Peer Community and Individual Peers A DISC’04 paper Lei Guo 1 Song Jiang 2 Li Xiao 3 and Xiaodong Zhang.
PROP: A Scalable and Reliable P2P Assisted Proxy Streaming System Computer Science Department College of William and Mary Lei Guo, Songqing Chen, and Xiaodong.
1 Caching Characteristics of Internet and Intranet Web Proxy Traces Arthur Goldberg Ilya Pevzner Robert Buff Courant Institute of Mathematical Sciences.
Performance of Web Proxy Caching in Heterogeneous Bandwidth Environments IEEE Infocom, 1999 Anja Feldmann et.al. AT&T Research Lab 발표자 : 임 민 열, DB lab,
Improving Disk Throughput in Data-Intensive Servers Enrique V. Carrera and Ricardo Bianchini Department of Computer Science Rutgers University.
1 Push-to-Peer Video-on-Demand System. 2 Abstract Content is proactively push to peers, and persistently stored before the actual peer-to-peer transfers.
August 23, 2001ITCom2001 Proxy Caching Mechanisms with Video Quality Adjustment Masahiro Sasabe Graduate School of Engineering Science Osaka University.
MiddleMan: A Video Caching Proxy Server NOSSDAV 2000 Brian Smith Department of Computer Science Cornell University Ithaca, NY Soam Acharya Inktomi Corporation.
Evaluating Content Management Technique for Web Proxy Cache M. Arlitt, L. Cherkasova, J. Dilley, R. Friedrich and T. Jin MinSu Shin.
Content Delivery Networks: Status and Trends Speaker: Shao-Fen Chou Advisor: Dr. Ho-Ting Wu 5/8/
Video Caching in Radio Access network: Impact on Delay and Capacity
On the Placement of Web Server Replicas Yu Cai. Paper On the Placement of Web Server Replicas Lili Qiu, Venkata N. Padmanabhan, Geoffrey M. Voelker Infocom.
Overview on Web Caching COSC 513 Class Presentation Instructor: Prof. M. Anvari Student name: Wei Wei ID:
On the scale and performance of cooperative Web proxy caching 2/3/06.
1 Evaluation of Cooperative Web Caching with Web Polygraph Ping Du and Jaspal Subhlok Department of Computer Science University of Houston presented at.
Does Internet media traffic really follow the Zipf-like distribution? Lei Guo 1, Enhua Tan 1, Songqing Chen 2, Zhen Xiao 3, and Xiaodong Zhang 1 1 Ohio.
Anonymity in Peer-assisted CDNs: Inference Attacks and Mitigation Yaoqi Jia, Guangdong Bai, Prateek Saxena, and Zhenkai Liang National University of Singapore.
The Impact of Replacement Granularity on Video Caching
Edge computing (1) Content Distribution Networks
Ling-Jyh Chen and Ting-Kai Huang
PPWEB: A Peer-to-Peer Approach for Web Surfing On the Go
Presentation transcript:

1 Simultaneous Distribution Control and Privacy Protection for Proxy based Media Distribution George Mason University Songqing Chen (George Mason University) George Mason University Shiping Chen (George Mason University) California State University Huiping Guo (California State University) Hewlett-Packard Labs Bo Shen (Hewlett-Packard Labs) George Mason University Sushil Jajodia (George Mason University)

2 Background Compared to Web content delivery, Internet media distribution is challenging: –Large object size –Continuous demand of network, disk bandwidth Lots of proxy-based solutions: –Silo, partial sequence caching, layered caching, scabale proxy caching, QBIX, prefix, segment caching, video staging…… good performance Any of these ideas is practically/widely deployed?

3 Lack Distribution Control Server Proxy Client I cannot get pay for these accesses!

4 Existing Solutions – for distribution control Common practice (Does not work with proxy caching) –Pay-per-view/membership –DRM (Digital Right Management) Proxy-based solutions –Hardware-assisted encryption/decryption (special device requirement) –RSA-based multi-key (vulnerable to client collusion)

5 Lack Sufficient Privacy Protection Current practice could endanger your private information –WWW (when & what & where) –Your preferences, payment methods e.g., what kinds of movies you are always interested in? –…… –May be used for uninvited ads or investigation Little is considered in existing media distribution solutions

6 Conflicting Interests Privacy Protection (end-user’s interests) –Proxy has good potential for privacy protection Distribution control (content provider’s interests) –Only legitimate users could be granted access –Normally requires user’s identity Can we simultaneously achieve both goals for two parties while proxy caching can be leveraged? Conflicting

7 Our Contributions Provide a framework to achieve simultaneous distribution control and privacy protection –El Gamal based scheme for distribution control –Shamir-Omura based scheme for privacy protection Propose and evaluate the algorithm in cooperative proxy environments –Considering traffic amortization and proactive replacement

8 Outline Simultaneous Distribution Control and Privacy Protection –Distribution Control Principle –Privacy Protection Principle Algorithm Design and Evaluation Conclusions

9 Key Division Cipher M = D(E(M, K e ), K d ) K d = K d1 K d2 M = D(D(E(M, K e ), K d1 ), K d2 ) El Gamal is a key division cipher system on “+”.

10 Distribution Control Client Proxy Server X B = X B1 +X B2 X B < q Y B = α X B mod q Random k <q K = (Y B ) k (mod q) C 1 = α k (mod q) C 2 = KM (mod q) K 1 = (C 1 ) X B1 mod q M 2 = C 2 / K 1 mod q C2C2 K 2 = (C 1 ) X B2 mod q M = M 2 / K 2 mod q M2M2 (C 1, X B1 ) (C 1, X B2 )

11 Commutative Cipher For any two keys: K e1 and K e2 E(E(M, K e1 ), K e2 ) = E(E(M, K e2 ), K e1 ) Shamir-Omura has commutative property.

12 Privacy Protection Client Proxy Server (K E, K D ) ID S = E(ID, K E ) (ID S, Movie) (K e, K d ) ID C = E(ID, K e ) E(ID C, K E ) = E(E(ID, K e ), K E ) = (ID C ) S D((ID C ) S, K d ) = D(E(E(ID, K e), K E), K d ) = E(ID, K E ) = ID S ID S ID C (ID C ) S ID S

13 Our Unified Scheme Assumptions k anonymity –The server only knows a client is accessing one of k objects Objects are classified into n classes (e.g., price), each with more than k objects Privacy protection (Shamir-Omura) –Each object can only be identified via its encrypted ID on the proxy –Encryption key K E for IDs is same for objects in the same class Distribution control (El Gamal) –Each object is encrypted with a different key –Encryption key is divided into two parts, e.g., E(M, S C +S i ) S C is common for the class S i is different for each object –S i is encrypted with K E –ID and E(S i, K E ) are available for client access

14 client proxy server (ID, E(S i, K E )) list Want to access some movie: ID (E(ID, K E ), E(M, S C +S i )) E(ID, K e ) || E(E(S i, K E ), K e ) 1. Get payment; 2. E(E(ID, K e ), K E ); 3. D(E(E(S i, K E ), K e ), K D ) =E(S i, K e ); 4.S C = S C1 +S C2 E(E(ID, K e ), K E ) || E(S i, K e ) || S C2 S C1 1. D(E(S i, K e ), K d ) = S i 2. D(E(E(ID, K e ), K E ), K d ) =E(ID, K E ) = ID S ID S D(E(M, S C +S i ), S C1 ) D(D(E(M, S C +S i ), S C1 ), S C2 +S i ) Objects are pre-cached in the proxy!

15 Brief Analysis Proxy and clients do not collude – enable distribution control Proxy and servers do not collude – provide privacy protection For each access to the server, instead of fetching 1 object, (k-1) additional objects must be fetched for privacy protection – additional traffic – can we utilize?

16 Outline Simultaneous Distribution Control and Privacy Protection Algorithm Design and Evaluation Conclusions

17 Design Space Work independently or cooperatively? –Cost-Amortized Request Admission Which (K-1) objects to fetch? –Aggressive Object Selection Which objects to replace? –Proactive Replacement

18 Cost-amortized Request Admission Requested object is not in local or peer cache –Counting how many (r) requests from how many (p) proxies to access server at this time –Each proxy fetches additional objects

19 Aggressive Object Selection After determining the number of additional objects to fetch: –In the first phase, select objects according to the object popularity –In the second phase, select objects according to the object size

20 Proactive Replacement Always use popularity based replacement to make room for the requested object For additionally fetched objects: –In the first phase, using popularity based replacement to cache the additionally fetched objects –In the second phase, the additionally fetched objects are discarded

21 Evaluation Trace driven simulation –using a synthetic workload based on a server log through duplication –Total unique objects: 934 –Total unique object size: 67 GB –Total number of requests: –Object size: 288 KB to 638 MB –Average traffic per request: 222 MB –Number of cooperative proxies: 4 –Number of object classes: 5 –Privacy level k: 4

22 Evaluated Strategies Privacy Protection Pro-active Replacement Amortizing Cost baseNo strategy1YesNo strategy2Yes No strategy3Yes

23 Cache Size -- Additional Traffic 1% of the total client accessed traffic

24 Cache Size -- Local Hit Ratio & Peer Hit Ratio

25 Cache Size -- Local Byte Hit Ratio & Peer Byte Hit Ratio

26 Outline Simultaneous Distribution Control and Privacy Protection Algorithm Design and Evaluation Conclusions

27 Conclusion Extended El Gamal for distribution control and Shamir-Omura for privacy protection Proposed a unified algorithm to achieve them simultaneously Proposed an algorithm and evaluated in a cooperative proxy environment

28 Questions? Thanks to anonymous reviewers, Bill Bynum (William and Mary), Xiaodong Zhang (Ohio State University).