Secure and Private Distribution of Online Video and Some Related Cryptographic Issues

Bao, Feng; Deng, Robert H.; Feng, Peirong; Guo, Yan; Wu, Hongjun

doi:10.1007/3-540-47719-5_17

Cited by 16 publications

(16 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Commutative cipher has been widely used in the literature for various purposes, e.g. protecting secrecy and privacy in e-commerce [2], [3], [7], data mining, information sharing [1], [8], and network routing [13]. In this work, we adopt commutative encryption to wrap the payload in layers.…”

Section: B Commutative Encryptionmentioning

confidence: 99%

A Node-failure-resilient Anonymous Communication Protocol through Commutative Path Hopping

Luo²,

Liu

et al. 2010

2010 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

Abstract-With rising concerns on user privacy over the Internet, anonymous communication systems that hide the identity of a participant from its partner or third parties are highly desired. Existing approaches either rely on a relative small set of pre-selected relay servers to redirect the messages, or use structured peer-to-peer systems to multicast messages among a set of relay groups. The pre-selection approaches provide good anonymity, but suffer from node failures and scalability problem. The peer-to-peer approaches are subject to node churns and high maintenance overhead, which are the intrinsic problems of P2P systems.In this paper, we present CAT, a node-failure-resilient anonymous communication protocol. In this protocol, relay servers are randomly assigned to relay groups. The initiator of a connection selects a set of relay groups instead of relay servers to set up anonymous paths. A valid path consists of relay servers, one from each selected relay group. The initiator explores valid anonymous paths via a probing process. Since the relative positions of relay servers in the path are commutative, there exist multiple anonymous yet commutative paths, which form an anonymous tunnel. When a connection encounters a node failure, it quickly switches to a nearest backup path in the tunnel through "path hopping", without tampering the initiator or renegotiating the keys. Hence, the protocol is resilient to node failures. We also show that the protocol provides good anonymity even when facing types of active and passive attacks. Finally, the operating cost of CAT is analyzed and shown to be similar to other node-based anonymous communication protocols.

show abstract

Section: B Commutative Encryptionmentioning

confidence: 99%

A Node-failure-resilient Anonymous Communication Protocol through Commutative Path Hopping

Luo²,

Liu

et al. 2010

2010 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

show abstract

“…A viable method [11] is to encrypt the video with a secret video key in a symmetric cipher such as RC4 or AES, then encrypt the video key with the client's public key. With this improvement, the total computational cost is almost equal to that of symmetric encoding/decoding.…”

Section: Countermeasure and Improvementmentioning

confidence: 99%

Collusion attack on a multi-key secure video proxy scheme

Bao

2004

Proceedings of the 12th Annual ACM International Conference on Multimedia

Self Cite

View full text Add to dashboard Cite

In ACM Multimedia'2002, a video proxy scheme was proposed for secure video delivery. In the scheme, a video is cached in proxies in encrypted form so that it remains nondisclosed even if the proxies are compromised. The proxies re-encrypt the video before its distribution, and different clients would receive different keys for the protected video. In this paper we present a security analysis on the scheme and show that the scheme is subject to collusion attack. Two or more clients working together can find out video server's secret keys and hence compromise the system. The countermeasure to the collusion attack is presented.

show abstract

“…For example, early work [17], [18], [19] considers how to speed up the decryption and encryption process. The scheme proposed in [11] relies on costly hardware support to deal with member collusion. A recent work [13] proposes a multi-key video proxy infrastructure without such a requirement.…”

Section: Related Workmentioning

confidence: 99%

“…Existing practice often uses pay-perview, membership, or DRM schemes [10] without considering effective utilization of proxy caching. Some recently developed strategies tried to leverage from proxy caching to deal with the problem with the aid of encryption mechanisms [11], [12], [13]. But they either demand special hardware support or cannot work if some clients collude.…”

Section: Introductionmentioning

confidence: 99%

Efficient Proxy-Based Internet Media Distribution Control and Privacy Protection Infrastructure

Chen

Guo

et al. 2006

200614th IEEE International Workshop on Quality of Service

View full text Add to dashboard Cite

Abstract-Massive Internet media distribution demands prolonged continuous consumption of networking and disk bandwidths in large capacity. Many proxy-based Internet media distribution algorithms and systems have been proposed, implemented, and evaluated to address the scalability issue. However, few of them have been used in practice, since two important issues are not satisfactorily addressed. First, existing proxy-based media distribution architectures lack an efficient media distribution control mechanism. Without protection on the Internet, content providers are hesitant to use existing fast distribution techniques. Second, little has been done to protect client privacy during client accesses. Straightforward solutions to address these two issues independently lead to conflicts. For example, to enforce distribution control, only legitimate users should be granted access rights. However, this normally discloses more information (such as which object the client is accessing) other than the client identity, which conflicts with the client's desire for privacy protection. In this paper, we propose a unified proxy-based media distribution protocol to effectively address these two problems simultaneously. We further design a set of new algorithms for cooperative proxies where our proposed scheme works practically. Simulation results show that our proposed strategy is efficient.

show abstract

Secure and Private Distribution of Online Video and Some Related Cryptographic Issues

Cited by 16 publications

References 24 publications

A Node-failure-resilient Anonymous Communication Protocol through Commutative Path Hopping

A Node-failure-resilient Anonymous Communication Protocol through Commutative Path Hopping

Collusion attack on a multi-key secure video proxy scheme

Efficient Proxy-Based Internet Media Distribution Control and Privacy Protection Infrastructure

Contact Info

Product

Resources

About