Digital rights management (DRM) is widely used to protect intellectual property for content owners but consumer privacy is sacrificed. A user's playing statistics can be collected by the client DRM module and the license server. In this paper, we propose a DRM system in which the license server can generate the content decryption key for a user to play an encrypted content object without gaining any information to link to the specific content object encrypted by the content encryption key. This is achieved by applying a (partially) blind signature primitive in the license acquisition protocol and by adopting a key scheme that a content encryption key depends on the information retrieved from the content object and a secret that only the license server knows. By requesting that the client DRM module does not send any information about a user's playing statistics and all the messages the client DRM module sends out are in plain text for easy checking by a user if the client DRM module abides by this rule, consumer privacy is fully protected in our DRM system.
{"title":"A DRM System Protecting Consumer Privacy","authors":"Min Feng, Bin B. Zhu","doi":"10.1109/CCNC08.2007.244","DOIUrl":"https://doi.org/10.1109/CCNC08.2007.244","url":null,"abstract":"Digital rights management (DRM) is widely used to protect intellectual property for content owners but consumer privacy is sacrificed. A user's playing statistics can be collected by the client DRM module and the license server. In this paper, we propose a DRM system in which the license server can generate the content decryption key for a user to play an encrypted content object without gaining any information to link to the specific content object encrypted by the content encryption key. This is achieved by applying a (partially) blind signature primitive in the license acquisition protocol and by adopting a key scheme that a content encryption key depends on the information retrieved from the content object and a secret that only the license server knows. By requesting that the client DRM module does not send any information about a user's playing statistics and all the messages the client DRM module sends out are in plain text for easy checking by a user if the client DRM module abides by this rule, consumer privacy is fully protected in our DRM system.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130896263","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We design an architecture of distributed certification authority (MeCA) for wireless mesh networks (WMNs). In MeCA, the secret key and functions of certification authority are distributed over several mesh routers. For secret sharing and redistribution, we develop the fast verifiable share redistribution (FVSR) scheme. MeCA adopts the multicasting based on Ruiz tree, which is optimal in reducing the operation overhead. It can update, revoke, and verify certificates of WMN nodes in a secure and efficient manner. Simulation results show that MeCA does not disclose its secret key even under severe attacks while incurring low overhead compared to other existing schemes in mobile ad hoc networks.
{"title":"MeCA: Distributed Certification Authority in Wireless Mesh Networks","authors":"Jongtack Kim, S. Bahk","doi":"10.1109/CCNC08.2007.66","DOIUrl":"https://doi.org/10.1109/CCNC08.2007.66","url":null,"abstract":"We design an architecture of distributed certification authority (MeCA) for wireless mesh networks (WMNs). In MeCA, the secret key and functions of certification authority are distributed over several mesh routers. For secret sharing and redistribution, we develop the fast verifiable share redistribution (FVSR) scheme. MeCA adopts the multicasting based on Ruiz tree, which is optimal in reducing the operation overhead. It can update, revoke, and verify certificates of WMN nodes in a secure and efficient manner. Simulation results show that MeCA does not disclose its secret key even under severe attacks while incurring low overhead compared to other existing schemes in mobile ad hoc networks.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"71 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130695949","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We propose efficient buffer-accounting algorithms that achieve edge-based max-min and proportional fairness in a multi-hop (MH), multi-bottleneck network environment by extending and generalizing an existing proactive queue-management scheme called GREEN. We call our scheme GREEN-MH. We envision deploying GREEN-MH at an institutional gateway in the context of a larger multi-hop and multi-bottleneck network environment. GREEN-MH uses a dynamic buffer-accounting algorithm on a per-flow basis such that certain edge-based fairness policies (e.g., max-min and proportional) are enforced among the competing TCP flows.
{"title":"Achieving Edge-Based Fairness in a Multi-Hop Environment","authors":"M. Arisoylu, Wu-chun Feng","doi":"10.1109/CCNC08.2007.99","DOIUrl":"https://doi.org/10.1109/CCNC08.2007.99","url":null,"abstract":"We propose efficient buffer-accounting algorithms that achieve edge-based max-min and proportional fairness in a multi-hop (MH), multi-bottleneck network environment by extending and generalizing an existing proactive queue-management scheme called GREEN. We call our scheme GREEN-MH. We envision deploying GREEN-MH at an institutional gateway in the context of a larger multi-hop and multi-bottleneck network environment. GREEN-MH uses a dynamic buffer-accounting algorithm on a per-flow basis such that certain edge-based fairness policies (e.g., max-min and proportional) are enforced among the competing TCP flows.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130785208","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sang-Bum Suh, J. Hwang, Joon-Young Shim, Jae-Min Ryu, Sung-kwan Heo, Chan-Ju Park, Chul-Ryun Kim, Jae-Ra Lee, I. Park, Hosoo Lee
Stateless computing is a new computing service focused on migrating user's computing contexts among different devices. In the near future, seamless computing will make computing environment easier to use and human centric. Users will not have spend time doing computing environment setup such as installation and upgrade. They will bring their own computing contexts, which consist of programs, files, and execution states, inside their pockets as saved in a small memory stick. The computing contexts will be restored on various devices, e.g. TV, desktops, mobile phone, PDA, etc. Our demonstration will show the early step to the seamless computing vision. We will demonstrate a seamless computing prototype which migrates computing contexts among different mobile embedded devices. The core technology inside the prototype which enables this computing state capability is the embedded virtual machine monitor (VMM), named as Secure Xen on ARM. We will migrate the whole state of a virtual machine between two HW platforms. Secure Xen on ARM run on the two platforms. A virtual machine running under the VMM on one platform is saved during its execution to USB memory stick, then the memory stick is plugged in to the other platform and the saved context is restored and continue execution of the virtual machine.
{"title":"Computing State Migration Between Mobile Platforms for Seamless Computing Environments","authors":"Sang-Bum Suh, J. Hwang, Joon-Young Shim, Jae-Min Ryu, Sung-kwan Heo, Chan-Ju Park, Chul-Ryun Kim, Jae-Ra Lee, I. Park, Hosoo Lee","doi":"10.1109/CCNC08.2007.274","DOIUrl":"https://doi.org/10.1109/CCNC08.2007.274","url":null,"abstract":"Stateless computing is a new computing service focused on migrating user's computing contexts among different devices. In the near future, seamless computing will make computing environment easier to use and human centric. Users will not have spend time doing computing environment setup such as installation and upgrade. They will bring their own computing contexts, which consist of programs, files, and execution states, inside their pockets as saved in a small memory stick. The computing contexts will be restored on various devices, e.g. TV, desktops, mobile phone, PDA, etc. Our demonstration will show the early step to the seamless computing vision. We will demonstrate a seamless computing prototype which migrates computing contexts among different mobile embedded devices. The core technology inside the prototype which enables this computing state capability is the embedded virtual machine monitor (VMM), named as Secure Xen on ARM. We will migrate the whole state of a virtual machine between two HW platforms. Secure Xen on ARM run on the two platforms. A virtual machine running under the VMM on one platform is saved during its execution to USB memory stick, then the memory stick is plugged in to the other platform and the saved context is restored and continue execution of the virtual machine.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130604370","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Younghwan Choi, Soochang Park, Euisin Lee, Fucai Yu, Sang-Ha Kim
Typical wireless sensor networks consist of sensor nodes and base-stations (sinks). The sensors, sinks, and user nodes can orthogonally provide their own mobility environments. The existing studies take only sensor mobility, sink mobility, and event mobility into account. Inquirer mobility, however, can be possibly suggested as one of the mobility models. An inquirer is one of the existing entity for sensor networks as a user. Inquirer mobility and routing mechanism to support it are proposed in this paper. For that, possible mobility environment and characteristics are also analyzed. At the end of this paper, excellence of the proposed routing model is proved through simulation results.
{"title":"Passive Data Dissemination Scheme for Supporting Inquirer Mobility in Wireless Sensor Networks","authors":"Younghwan Choi, Soochang Park, Euisin Lee, Fucai Yu, Sang-Ha Kim","doi":"10.1109/CCNC08.2007.81","DOIUrl":"https://doi.org/10.1109/CCNC08.2007.81","url":null,"abstract":"Typical wireless sensor networks consist of sensor nodes and base-stations (sinks). The sensors, sinks, and user nodes can orthogonally provide their own mobility environments. The existing studies take only sensor mobility, sink mobility, and event mobility into account. Inquirer mobility, however, can be possibly suggested as one of the mobility models. An inquirer is one of the existing entity for sensor networks as a user. Inquirer mobility and routing mechanism to support it are proposed in this paper. For that, possible mobility environment and characteristics are also analyzed. At the end of this paper, excellence of the proposed routing model is proved through simulation results.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131035426","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
R. V. Prasad, V. Rao, H. N. Shankar, P. Pawełczak, R. Muralishankar, I. Niemegeers
VoIP packets, when transported over the Internet, experience loss and variable delay. The effect of the network not only depends on the background flows but also on the parameters of VoIP packets itself, such as VoIP packet size and the packet generation intervals. While higher sized packets experience more losses, they experience less delay jitter and handling them is thus easy at the playout buffer. To investigate the effect of various network conditions on VoIP session holistically, we present a complete end to end study considering various states of the underlying network. We present as a case study of G.711 coded packets generated at 20 and 40 ms intervals for comparison. While packets carrying 20 ms data are better when the network is loaded, 40 ms packetization is favored when the network is not saturated. This affects the jitter and loss thus affecting the quality. We explain this trade-off using mean opinion scores.
{"title":"A Holistic Study of VoIP Session Quality - The Knobs that Control","authors":"R. V. Prasad, V. Rao, H. N. Shankar, P. Pawełczak, R. Muralishankar, I. Niemegeers","doi":"10.1109/CCNC08.2007.191","DOIUrl":"https://doi.org/10.1109/CCNC08.2007.191","url":null,"abstract":"VoIP packets, when transported over the Internet, experience loss and variable delay. The effect of the network not only depends on the background flows but also on the parameters of VoIP packets itself, such as VoIP packet size and the packet generation intervals. While higher sized packets experience more losses, they experience less delay jitter and handling them is thus easy at the playout buffer. To investigate the effect of various network conditions on VoIP session holistically, we present a complete end to end study considering various states of the underlying network. We present as a case study of G.711 coded packets generated at 20 and 40 ms intervals for comparison. While packets carrying 20 ms data are better when the network is loaded, 40 ms packetization is favored when the network is not saturated. This affects the jitter and loss thus affecting the quality. We explain this trade-off using mean opinion scores.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130935587","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
As the broadband access becomes ubiquitous it enables enhanced communication experiences when combined with the mobile phone capabilities and multimedia capable consumer electronics (CE) devices. In this paper we outline a framework and architecture to unleash converged services experiences to users on their mobile devices and in-home CE devices. A system architecture consisting of bridging mobile network (SIP) technologies with the home network (UPnP) technologies and hosting the convergence function on the in-home broadband Residential Gateway is further detailed.
{"title":"Converged Services for Home Using a SIP/UPnP Software Bridge Solution","authors":"S. Chintada, P. Ramalingam, Glen Goffin","doi":"10.1109/CCNC08.2007.183","DOIUrl":"https://doi.org/10.1109/CCNC08.2007.183","url":null,"abstract":"As the broadband access becomes ubiquitous it enables enhanced communication experiences when combined with the mobile phone capabilities and multimedia capable consumer electronics (CE) devices. In this paper we outline a framework and architecture to unleash converged services experiences to users on their mobile devices and in-home CE devices. A system architecture consisting of bridging mobile network (SIP) technologies with the home network (UPnP) technologies and hosting the convergence function on the in-home broadband Residential Gateway is further detailed.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127232782","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This short paper outlines the innovative and promising work that we are undertaking to improve the quality of mobile services. We are investigating algorithms and system architectures that will allow mobile service providers to implement services and operational support systems - both in the infrastructure and on the mobile device - that improve efficiency, reduce complexity, and increase customer experience in a multitude of ways. Typical one-off solutions for mobile services - though effective in isolation - tend to focus on single "verticals", such as automotive, or healthcare. Our work focuses upon challenges of creating middleware that offers rich context-aware event logic to address a spectrum of issues across many verticals. When successfully implemented, the benefits will include: more efficient operations for service providers and more interesting, seamless, context-aware services for mobile customers.
{"title":"Seamless Mobile Context - Towards High Speed Context-Aware Event-Based Middleware","authors":"B. Falchuk, S. Loeb, E. Panagos","doi":"10.1109/CCNC08.2007.26","DOIUrl":"https://doi.org/10.1109/CCNC08.2007.26","url":null,"abstract":"This short paper outlines the innovative and promising work that we are undertaking to improve the quality of mobile services. We are investigating algorithms and system architectures that will allow mobile service providers to implement services and operational support systems - both in the infrastructure and on the mobile device - that improve efficiency, reduce complexity, and increase customer experience in a multitude of ways. Typical one-off solutions for mobile services - though effective in isolation - tend to focus on single \"verticals\", such as automotive, or healthcare. Our work focuses upon challenges of creating middleware that offers rich context-aware event logic to address a spectrum of issues across many verticals. When successfully implemented, the benefits will include: more efficient operations for service providers and more interesting, seamless, context-aware services for mobile customers.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114292411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Due to the high percentage of mobile devices thefts and the financial loss that it causes, this paper aims to develop an inexpensive framework to identify a user to his/her mobile device. In case the user is not successfully identified the mobile devices' manager blocks the device completely, avoiding use of any service, including calls, browsing the Internet, sending SMS and accessing personal data, such as contacts, last calls made and received, among others. Experiments using PDAs are presented to demonstrate the feasibility of this project.
{"title":"Towards a User Identification Framework for Mobile Devices","authors":"Alessandro Brawerman, L. Albini","doi":"10.1109/CCNC08.2007.67","DOIUrl":"https://doi.org/10.1109/CCNC08.2007.67","url":null,"abstract":"Due to the high percentage of mobile devices thefts and the financial loss that it causes, this paper aims to develop an inexpensive framework to identify a user to his/her mobile device. In case the user is not successfully identified the mobile devices' manager blocks the device completely, avoiding use of any service, including calls, browsing the Internet, sending SMS and accessing personal data, such as contacts, last calls made and received, among others. Experiments using PDAs are presented to demonstrate the feasibility of this project.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127763252","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we study the topic of distributed and optimal congestion control for scalable video streams in application-layer multicast (ALM). We propose a TCP-friendly, fully distributed synchronous algorithm based on the utility-price model which maximizes the global utilities for the streams in the application-layer multicast tree. With the help of numerical study, we show that our proposed algorithm optimizes the overall video quality for fine-grained scalable streams, while minimizing the messaging overhead in the application-layer multicast channel.
{"title":"Distributed and Optimal Congestion Control for Application-Layer Multicast: A Synchronous Dual Algorithm","authors":"Jinyao Yan, M. May, B. Plattner","doi":"10.1109/CCNC08.2007.69","DOIUrl":"https://doi.org/10.1109/CCNC08.2007.69","url":null,"abstract":"In this paper, we study the topic of distributed and optimal congestion control for scalable video streams in application-layer multicast (ALM). We propose a TCP-friendly, fully distributed synchronous algorithm based on the utility-price model which maximizes the global utilities for the streams in the application-layer multicast tree. With the help of numerical study, we show that our proposed algorithm optimizes the overall video quality for fine-grained scalable streams, while minimizing the messaging overhead in the application-layer multicast channel.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131398328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：