An Efficient Single-Key Pirates Tracing Scheme Using Cover-Free Families

Tonien, Joseph

doi:10.1007/11767480_6

Cited by 12 publications

(4 citation statements)

References 35 publications

(40 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Optionally, NVM unit is used to log the usage history. Although the single-key pirate model is simple but realistic in the pirate market [26] , the multi-key pirate decoder is easy in designing, practical in manufacturing with present semi-conductor technology, robust in defeating the traitor tracing algorithms, and cost-effective in comparing with the expensive broadcast subscription fee.…”

Section: Structure Of Pirate Decodermentioning

confidence: 99%

A Multi-Key Pirate Decoder Against Traitor Tracing Schemes

Deng

2010

J. Comput. Sci. Technol.

View full text Add to dashboard Cite

In this paper we introduce an architecture for a multi-key pirate decoder which employs decryption keys from multiple traitors. The decoder has built-in monitoring and self protection functionalities and is capable of defeating most multiple-round based traitor tracing schemes such as the schemes based on the black-box confirmation method. In particular, the proposed pirate decoder is customized to defeat the private key and the public key fully collusion resistant traitor tracing (FTT) schemes, respectively. We show how the decoder prolongs a trace process so that the tracer has to give up his effort. FTT schemes are designed to identify all the traitors. We show that decoder enables the FTT schemes to identify at most 1 traitors. Finally, assuming the decoder is embedded with several bytes of memory, we demonstrate how the decoder is able to frame innocent users at will.

show abstract

Section: Structure Of Pirate Decodermentioning

confidence: 99%

A Multi-Key Pirate Decoder Against Traitor Tracing Schemes

Deng

2010

J. Comput. Sci. Technol.

View full text Add to dashboard Cite

show abstract

“…Cover-free families have found many applications in cryptography and communications, including blacklisting [186], broadcast encryption [82,130,293,294], anti-jamming [98], source authentication in networks [269], group key predistribution [220,109,294,295], compression schemes [164], fault-tolerant signatures [156,165], frameproof/traceability codes [286,296], traitor tracing [298], batch signature verification [320], and one-time and multiple-times digital signature schemes [250,321].…”

Section: Introductionmentioning

confidence: 99%

Star-specific Key-homomorphic PRFs from Linear Regression and Extremal Set Theory

Sehrawat¹,

Yeo²,

Vassilyev³

2022

Preprint

View full text Add to dashboard Cite

We introduce a novel method to derandomize the learning with errors (LWE) problem by generating deterministic yet sufficiently independent LWE instances, that are constructed via special linear regression models. We also introduce star-specific key-homomorphic (SSKH) pseudorandom functions (PRFs), which are defined by the respective sets of parties that construct them. We use our derandomized variant of LWE to construct a SSKH PRF family. The sets of parties constructing SSKH PRFs are arranged as star graphs with possibly shared vertices, i.e., some pair of sets have non-empty intersections. We reduce the security of our SSKH PRF family to the hardness of LWE. To establish the maximum number of SSKH PRFs that can be constructed -by a set of parties -in the presence of passive/active and external/internal adversaries, we prove several bounds on the size of maximally cover-free at most t-intersecting k-uniform family of sets H, where the three properties are defined as:For the same purpose, we define and compute the mutual information between different linear regression hypotheses that are generated via overlapping training datasets.

show abstract

“…Thus, traceability allows to identify a traitor (or a coalition of traitors). Such schemes are called traitor tracing schemes and a variety of them was proposed, e.g., [20,55,56,48,66,67,53,11,30,60,70,44,64,45,46,51,25,19,57,68,18,28,65,1,9,13,41]. The combination of revocation and traceability is an aspiring goal.…”

Section: Introductionmentioning

confidence: 99%

A Generic View on Trace-and-Revoke Broadcast Encryption Schemes

Hofheinz

Striecks

2014

Topics in Cryptology – CT-RSA 2014

View full text Add to dashboard Cite

Abstract. At Eurocrypt 2011, Wee presented a generalization of threshold public key encryption, threshold signatures, and revocation schemes arising from threshold extractable hash proof systems. In particular, he gave instances of his generic revocation scheme from the DDH assumption (which led to the Naor-Pinkas revocation scheme), and from the factoring assumption (which led to a new revocation scheme). We expand on Wee's work in two directions: (a) We propose threshold extractable hash proof instantiations from the "Extended Decisional DiffieHellman" (EDDH) assumption due to Hemenway and Ostrovsky (PKC 2012). This in particular yields EDDH-based variants of threshold public key encryption, threshold signatures, and revocation schemes. In detail, this yields a DCR-based revocation scheme. (b) We show that our EDDH-based revocation scheme allows for a mild form of traitor tracing (and, thus, yields a new trace-and-revoke scheme). In particular, compared to Wee's factoring-based scheme, our DCR-based scheme has the advantage that it allows to trace traitors.

show abstract

An Efficient Single-Key Pirates Tracing Scheme Using Cover-Free Families

Cited by 12 publications

References 35 publications

A Multi-Key Pirate Decoder Against Traitor Tracing Schemes

A Multi-Key Pirate Decoder Against Traitor Tracing Schemes

Star-specific Key-homomorphic PRFs from Linear Regression and Extremal Set Theory

A Generic View on Trace-and-Revoke Broadcast Encryption Schemes

Contact Info

Product

Resources

About