Weighted algorithm for fingerprinting relational databases

Xinchun Cui; Xiaolin Qin; Zhijin Guan; Yu Shu

Weighted algorithm for fingerprinting relational databases

Xinchun Cui
, Xiaolin Qin
, Zhijin Guan
, Yu Shu

Nanjing University of Aeronautics and Astronautics

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

The necessity and the feasibility of introducing attribute weight into digital fingerprinting system are given. The weighted algorithm for fingerprinting relational databases of traitor tracing is proposed. Higher weights are assigned to more significant attributes, so important attributes are more frequently fingerprinted than other ones. Finally, the robustness of the proposed algorithm, such as performance against collusion attacks, is analyzed. Experimental results prove the superiority of the algorithm.

Original language	English
Pages (from-to)	148-154
Number of pages	7
Journal	Transactions of Nanjing University of Aeronautics and Astronautics
Volume	25
Issue number	2
State	Published - Jun 2008
Externally published	Yes

Keywords

Attribute weight
Copyright protection
Digital fingerprinting
Relational database systems
Traitor tracing

Cite this

@article{e23271de6dfb4b8b8248a26517a5f517,

title = "Weighted algorithm for fingerprinting relational databases",

abstract = "The necessity and the feasibility of introducing attribute weight into digital fingerprinting system are given. The weighted algorithm for fingerprinting relational databases of traitor tracing is proposed. Higher weights are assigned to more significant attributes, so important attributes are more frequently fingerprinted than other ones. Finally, the robustness of the proposed algorithm, such as performance against collusion attacks, is analyzed. Experimental results prove the superiority of the algorithm.",

keywords = "Attribute weight, Copyright protection, Digital fingerprinting, Relational database systems, Traitor tracing",

author = "Xinchun Cui and Xiaolin Qin and Zhijin Guan and Yu Shu",

year = "2008",

month = jun,

language = "英语",

volume = "25",

pages = "148--154",

journal = "Transactions of Nanjing University of Aeronautics and Astronautics",

issn = "1005-1120",

publisher = "Nanjing University of Aeronautics an Astronautics",

number = "2",

}

TY - JOUR

T1 - Weighted algorithm for fingerprinting relational databases

AU - Cui, Xinchun

AU - Qin, Xiaolin

AU - Guan, Zhijin

AU - Shu, Yu

PY - 2008/6

Y1 - 2008/6

N2 - The necessity and the feasibility of introducing attribute weight into digital fingerprinting system are given. The weighted algorithm for fingerprinting relational databases of traitor tracing is proposed. Higher weights are assigned to more significant attributes, so important attributes are more frequently fingerprinted than other ones. Finally, the robustness of the proposed algorithm, such as performance against collusion attacks, is analyzed. Experimental results prove the superiority of the algorithm.

AB - The necessity and the feasibility of introducing attribute weight into digital fingerprinting system are given. The weighted algorithm for fingerprinting relational databases of traitor tracing is proposed. Higher weights are assigned to more significant attributes, so important attributes are more frequently fingerprinted than other ones. Finally, the robustness of the proposed algorithm, such as performance against collusion attacks, is analyzed. Experimental results prove the superiority of the algorithm.

KW - Attribute weight

KW - Copyright protection

KW - Digital fingerprinting

KW - Relational database systems

KW - Traitor tracing

UR - https://www.scopus.com/pages/publications/51149101220

M3 - 文章

AN - SCOPUS:51149101220

SN - 1005-1120

VL - 25

SP - 148

EP - 154

JO - Transactions of Nanjing University of Aeronautics and Astronautics

JF - Transactions of Nanjing University of Aeronautics and Astronautics

IS - 2

ER -

Weighted algorithm for fingerprinting relational databases

Abstract

Keywords

Other files and links

Fingerprint

Cite this