How to Break COT-Based Fingerprinting Schemes and Design New One(Cryptography and Information Security, <Special Section>Information Theory and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
Digital fingerprinting schemes are cryptographic methods deterring buyers from illegally redistributing digital contents. It enables sellers to identify the traitor by providing each buyer with a slight different version. What is important in designing fingerprinting scheme is to make it more practical and efficient. Recently, two oblivious transfer protocol-based schemes to consider practicality were proposed. These are significant in the sense that they are completely specified from a computation point of view and are thus readily implementable. But these schemes cannot offer the security of sellers and buyers. In this paper, we show how to break the existing oblivious transfer-based fingerprinting schemes and then suggest how to make secure fingerprinting schemes against the dishonesty of sellers and buyers. We use oblivious transfer protocol with two-lock cryptosystem to make it practical and secure. All computations are performed efficiently and the security degree is strengthened in our proposal.
- 社団法人電子情報通信学会の論文
- 2005-10-01
著者
-
Imai Hideki
Aist Tokyo Jpn
-
HANAOKA Goichiro
National Institute of Advanced Industrial Science and Technology
-
IMAI Hideki
Information and Systems, Institute of Industrial Science, The university of Tokyo
-
Hanaoka Goichiro
National Inst. Of Advanced Industrial Sci. And Technol. Tokyo Jpn
-
CHOI JaeGwi
Content Protection Research Team, ETRI
-
RHEE KyungHyune
Department of Information Security, Pukyong National University
-
Rhee Kyunghyune
Department Of Information Security Pukyong National University
-
Imai Hideki
Information & Systems Institute Of Industrial Science The University Of Tokyo
-
Choi Jaegwi
Content Protection Research Team Etri
関連論文
- Universally Composable and Statistically Secure Verifiable Secret Sharing Scheme Based on Pre-Distributed Data
- Traitor Tracing Scheme Secure against Adaptive Key Exposure and its Application to Anywhere TV Service(Discrete Mathematics and Its Applications)
- Smallest Size of Circulant Matrix for Regular (3, L) and (4, L) Quasi-Cyclic LDPC Codes with Girth 6
- Notes on Formal Methods Used for Verification of the Security Properties of Protocols Used in Wireless Environment
- A Leakage-Resilient Network Storage System
- Security Analysis of Password-based Protocols via FDR and AVISPA
- A Secure and Lightweight Authenticated Key Exchange Protocol for Wireless Networks
- The MAC-based Construction of Strong Multiple Encryption
- Flaws in Robust Optimistic Mix-Nets and Stronger Security Notions(Protocol, Cryptography and Information Security)
- CCA-Secure Public Key Encryption without Group-Dependent Hash Functions
- Formal Security Treatments for IBE-to-Signature Transformation : Relations among Security Notions
- A Strongly Unforgeable Signature under the CDH Assumption without Collision Resistant Hash Functions
- Key-Insulated Public Key Encryption with Auxiliary Helper Key : Model, Constructions and Formal Security Proofs(Information Theory and Its Applications)
- Efficient Identity-Based Encryption with Tight Security Reduction(Information Theory and Its Applications)
- A New Key-Insulated Public Key Encryption Scheme with Auxiliary Helper Key
- Managing Encryption and Key Publication Independently in Digital Rights Management Systems (Applications) (Cryptography and Information Security)
- Practical Broadcast Encryption from Graph-Theoretic Techniques and Subset-Incremental-Chain Structure(Application,Cryptography and Information Security)
- Efficient Provider Authentication for Bidirectional Broadcasting Service
- A Trade-off Traitor Tracing Scheme
- Public Key Encryption Schemes from the (B)CDH Assumption with Better Efficiency
- Between Hashed DH and Computational DH : Compact Encryption from Weaker Assumption
- Universally Composable and Statistically Secure Verifiable Secret Sharing Scheme Based on Pre-Distributed Data
- How to Break COT-Based Fingerprinting Schemes and Design New One(Cryptography and Information Security, Information Theory and Its Applications)
- Homophonic Substitution with a Memory Source and its Application
- Secure Broadcast System with Simultaneous Individual Messaging
- How to Shorten a Ciphertext of Reproducible Key Encapsulation Mechanisms in the Random Oracle Model
- Methods for Restricting Message Space in Public-Key Encryption