A New Traitor Tracing

By Shigeo Mitsunari, R. Sakai, M. Kasahara. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, 2002

305 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/d883e837fcf5b36acb62893333919b4f3f11f9e5

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

An Efficient Signature Scheme from Bilinear Pairings and Its Applications (2004, methodology): “al [18], called k-CAA (collusion attack algorithm with k traitors), and used as the security basis in Mitsunari et.”
Applications of Multilinear Forms to Cryptography (2002, background): “These applications include one-round three-party key exchange [15], identity-based encryption [3], and short digital signatures [4] (see also [28, 23]).”
Hierarchical Identity Based Encryption with Constant Size Ciphertext (2005, methodology): “The ℓ -th Bilinear Diﬃe-Hellman Inversion problem [1, 19], denoted ℓ -BDHI, is as follows: ℓ -BDHI : given w, w β , w ( β 2 ) , . . . , w ( β ℓ ) compute e ( w, w ) Loosely speaking, the ℓ -BDHI assumption in G says that no eﬃcient algorithm can solve ℓ -BDHI in G with non-negligible probability.”
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups (2008, methodology): “[35] slightly weaker complexity assumption, rather than SDH.”
Verifiable Delegation of Computation over Large Datasets (2011, methodology): “Computational variants of the problem appeared as early as the work of Mitsunari et al [45].”
A Verifiable Random Function with Short Proofs and Keys (2005, methodology): “1 Diffie-Hellman Inversion Assumption Our VUF construction relies on the Diffie-Hellman inversion (DHI) assumption, which was originally proposed in [18].”
Constant-Size Commitments to Polynomials and Their Applications (2010, background): “Security of two additional properties of the schemes require a generalization of the t-Diffie-Hellman inversion (t-DHI) assumption [28, 5], and the bilinear version of t-SDH, the t-BSDH assumption [21].”
A Survey of Provably Secure Searchable Encryption (2014, unknown): “I is proven PK-CKA2 secure in the RO model under the BDH assumption and the bilinear Diffie-Hellman inversion (1-BDHI) assumption [Mitsunari et al. 2002; Boneh and Boyen 2004].”
Short Group Signatures (2004, methodology): “Mitsunari et al. [27] use a related assumption where x is pre-specified rather than chosen by the adversary.”
Public Key Encryption with Conjunctive Field Keyword Search (2004, methodology): “A similar assumptions are employed in [3, 11 , 14].”