2,875 research outputs found
Discrete Distributions in the Tardos Scheme, Revisited
The Tardos scheme is a well-known traitor tracing scheme to protect
copyrighted content against collusion attacks. The original scheme contained
some suboptimal design choices, such as the score function and the distribution
function used for generating the biases. Skoric et al. previously showed that a
symbol-symmetric score function leads to shorter codes, while Nuida et al.
obtained the optimal distribution functions for arbitrary coalition sizes.
Later, Nuida et al. showed that combining these results leads to even shorter
codes when the coalition size is small. We extend their analysis to the case of
large coalitions and prove that these optimal distributions converge to the
arcsine distribution, thus showing that the arcsine distribution is
asymptotically optimal in the symmetric Tardos scheme. We also present a new,
practical alternative to the discrete distributions of Nuida et al. and give a
comparison of the estimated lengths of the fingerprinting codes for each of
these distributions.Comment: 5 pages, 2 figure
Dynamic Tardos Traitor Tracing Schemes
We construct binary dynamic traitor tracing schemes, where the number of
watermark bits needed to trace and disconnect any coalition of pirates is
quadratic in the number of pirates, and logarithmic in the total number of
users and the error probability. Our results improve upon results of Tassa, and
our schemes have several other advantages, such as being able to generate all
codewords in advance, a simple accusation method, and flexibility when the
feedback from the pirate network is delayed.Comment: 13 pages, 5 figure
Framework for privacy-aware content distribution in peer-to- peer networks with copyright protection
The use of peer-to-peer (P2P) networks for multimedia distribution has spread out globally in recent years. This mass popularity is primarily driven by the efficient distribution of content, also giving rise to piracy and copyright infringement as well as privacy concerns. An end user (buyer) of a P2P content distribution system does not want to reveal his/her identity during a transaction with a content owner (merchant), whereas the merchant does not want the buyer to further redistribute the content illegally. Therefore, there is a strong need for content distribution mechanisms over P2P networks that do not pose security and privacy threats to copyright holders and end users, respectively. However, the current systems being developed to provide copyright and privacy protection to merchants and end users employ cryptographic mechanisms, which incur high computational and communication costs, making these systems impractical for the distribution of big files, such as music albums or movies.El uso de soluciones de igual a igual (peer-to-peer, P2P) para la distribución multimedia se ha extendido mundialmente en los últimos años. La amplia popularidad de este paradigma se debe, principalmente, a la distribución eficiente de los contenidos, pero también da lugar a la piratería, a la violación del copyright y a problemas de privacidad. Un usuario final (comprador) de un sistema de distribución de contenidos P2P no quiere revelar su identidad durante una transacción con un propietario de contenidos (comerciante), mientras que el comerciante no quiere que el comprador pueda redistribuir ilegalmente el contenido más adelante. Por lo tanto, existe una fuerte necesidad de mecanismos de distribución de contenidos por medio de redes P2P que no supongan un riesgo de seguridad y privacidad a los titulares de derechos y los usuarios finales, respectivamente. Sin embargo, los sistemas actuales que se desarrollan con el propósito de proteger el copyright y la privacidad de los comerciantes y los usuarios finales emplean mecanismos de cifrado que implican unas cargas computacionales y de comunicaciones muy elevadas que convierten a estos sistemas en poco prácticos para distribuir archivos de gran tamaño, tales como álbumes de música o películas.L'ús de solucions d'igual a igual (peer-to-peer, P2P) per a la distribució multimèdia s'ha estès mundialment els darrers anys. L'àmplia popularitat d'aquest paradigma es deu, principalment, a la distribució eficient dels continguts, però també dóna lloc a la pirateria, a la violació del copyright i a problemes de privadesa. Un usuari final (comprador) d'un sistema de distribució de continguts P2P no vol revelar la seva identitat durant una transacció amb un propietari de continguts (comerciant), mentre que el comerciant no vol que el comprador pugui redistribuir il·legalment el contingut més endavant. Per tant, hi ha una gran necessitat de mecanismes de distribució de continguts per mitjà de xarxes P2P que no comportin un risc de seguretat i privadesa als titulars de drets i els usuaris finals, respectivament. Tanmateix, els sistemes actuals que es desenvolupen amb el propòsit de protegir el copyright i la privadesa dels comerciants i els usuaris finals fan servir mecanismes d'encriptació que impliquen unes càrregues computacionals i de comunicacions molt elevades que fan aquests sistemes poc pràctics per a distribuir arxius de grans dimensions, com ara àlbums de música o pel·lícules
Improved Hybrid Fingerprint-Based P2P Media Distribution For Privacy Protection
It has been suggested that anonymous fingerprinting could be an easy way to ensure the lawful dissemination of copyright-protected multimedia content without compromising the privacy of customers, whose names would only be revealed in the event of illegal re-distribution of the content. This idea has been put forward as a potential solution to the problem. However, the majority of the currently available anonymous fingerprinting systems are not practical. This is due to the fact that they make use of complicated protocols that take up a lot of time, as well as homomorphic encryption of the data. Furthermore, they distribute the data using a unicast approach, which does not scale well for a large number of clients. The concept of recombined fingerprints serves as the foundation for this body of work, which also makes an effort to overcome some of these restrictions. On the other hand, recommended fingerprint approaches need a complex graph search for traitor monitoring, which in turn demands the participation of additional buyers and honest proxies in their P2P distribution scenario. Getting rid of these issues and developing a fingerprinting system that is not only efficient but also scalable, private, and makes use of P2P technology is the purpose of this research
A capacity-achieving simple decoder for bias-based traitor tracing schemes
We investigate alternative suspicion functions for bias-based traitor tracing schemes, and present a practical construction of a simple decoder that attains capacity in the limit of large coalition size c. We derive optimal suspicion functions in both the Restricted- Digit Model and the Combined-Digit Model. These functions depend on information that is usually not available to the tracer – the attack strategy or the tallies of the symbols received by the colluders. We discuss how such results can be used in realistic contexts. We study several combinations of coalition attack strategy versus suspicion function optimized against some attack (another attack or the same). In many of these combinations the usual codelength scaling changes to a lower power of , e.g., . We find that the interleaving strategy is an especially powerful attack. The suspicion function tailored against interleaving is the key ingredient of the capacity-achieving construction
Optimization techniques and new methods for boradcast encryption and traitor tracing schemes
Ankara : The Department of Computer Engineering and the Graduate School of Engineering and Science of Bilkent University, 2012.Thesis (Ph. D.) -- Bilkent University, 2012.Includes bibliographical refences.In the last few decades, the use of digital content increased dramatically. Many
forms of digital products in the form of CDs, DVDs, TV broadcasts, data over
the Internet, entered our life. Classical cryptography, where encryption is
done for only one recipient, was not able to handle this change, since its direct
use leads to intolerably expensive transmissions. Moreover, new concerns
regarding the commercial aspect arised. Since digital commercial contents are
sold to various customers, unauthorized copying by malicious actors became
a major concern and it needed to be prevented carefully. Therefore, a new
research area called digital rights management (DRM) has emerged. Within
the scope of DRM, new cryptographic primitives are proposed. In this thesis,
we consider three of these: broadcast encryption (BE), traitor tracing (TT),
and trace and revoke (T&R) schemes and propose methods to improve the performances
and capabilities of these primitives. Particularly, we first consider
profiling the recipient set in order to improve transmission size in the most
popular BE schemes. We then investigate and solve the optimal free rider
assignment problem for one of the most efficient BE schemes so far. Next, we
attempt to close the non-trivial gap between BE and T&R schemes by proposing
a generic method for adding traitor tracing capability to BE schemes and
thus obtaining a T&R scheme. Finally, we investigate an overlooked problem:
privacy of the recipient set in T&R schemes. Right now, most schemes do not
keep the recipient set anonymous, and everybody can see who received a particular
content. As a generic solution to this problem, we propose a method
for obtaining anonymous T&R scheme by using anonymous BE schemes as a
primitive.Ak, MuratPh.D
- …