. It is desirable, therefore, to design fingerprints that resist collusion and identify the colluders.

Abstract—The field of data mining provides techniques for new knowledge discovery—finding patterns in the data set such as classifiers and association rules that may be useful to the data miner. Privacy preserving data mining seeks to allow users to share data while ensuring individual and corporate privacy concerns are addressed. Recently algorithms have been introduced to maintain privacy even when all but two parties collude. This paper builds upon previous algorithms, putting cycle-partitioned secure sum into the mathematical framework of edge-disjoint Hamiltonian cycles. I.

Abstract—The fundamental advantage of peer-to-peer (P2P) multimedia streaming applications is to leverage peer upload capacities to minimize bandwidth costs on dedicated streaming servers. The available bandwidth among peers is of pivotal importance to P2P streaming applications, especially as the number of peers in the streaming session reaches a very large scale. In this paper, we utilize more than 230 GB of traces collected from a commercial P2P streaming system, UUSee, over a four-month period of time. With such traces, we seek to thoroughly understand and characterize the achievable bandwidth of streaming flows among peers in large-scale real-world P2P live streaming sessions, in order to derive useful insights towards the improvement of current-generation P2P streaming protocols, such as peer selection. Using continuous traces over a long period of time, we explore evolutionary properties of inter-peer bandwidth. Focusing on representative snapshots of the entire topology at specific times, we investigate distributions of interpeer bandwidth in various peer ISP/area/type categories, and statistically test and model the deciding factors that cause the variance of such inter-peer bandwidth. Our original discoveries in this study include: (1) The ISPs that peers belong to are more correlated to inter-peer bandwidth than their geographic locations; (2) There exist excellent linear correlations between peer last-mile bandwidth availability and inter-peer bandwidth within the same ISP, and between a subset of ISPs as well; and (3) The evolution of inter-peer bandwidth between two ISPs exhibits daily variation patterns. Based on these insights, we design a throughput expectation index that facilitates highbandwidth peer selection without performing any measurements.

. By contrast, no truthful mechanism without verification can achieve such an approximation ratio. Moreover, every mechanism without verification which is collusion-resistant must have an unbounded approximation factor.

In this paper, we focus on the problem of identifying a family of collusion resistant protocols that demonstrate a tradeoff between the number of secrets that users maintain and the extent of collusion resistance. Towards this end, we define classes of collusion resistant protocols (modeled along

key size in this system is linear in the total number of receivers. Our second system is a generalization of the first that provides a tradeoff between ciphertext size and public key size. For example, we achieve a collusion resistant broadcast system for n users where both ciphertexts and public keys

Abstract—In this paper, we present a theoretical framework for the linear collusion analysis of watermarked digital video sequences, and derive a new theorem equating a definition of statistical invisibility, collusion-resistance, and two practical watermark design rules. The proposed framework

-effective attack against such digital fingerprints is collusion, where several differently marked copies of the same content are combined to disrupt the underlying fingerprints. Anti-Collusion Codes (ACCs) are employed to design the fingerprints, which can accommodate more users than orthogonal modulation based

Abstract. In one proposed use of digital watermarks, the owner of a document D sells slightly different documents, D1; D2; : : : to each buyer; if a buyer posts his/her document Di to the web, the owner can identify the source of the leak. More general attacks are however possible in which k buyers create some composite document D \Lambda; the goal of the owner is

back to him. In this work we consider fingerprints that are resistant against collusion attacks. In a collusion attack malicious users compare their copies of data in order to detect the positions of the fingerprints. They alter the detected symbols in order to generate a new copy. This new copy