Loading...
Loading...

Go to the content (press return)

Almost IPP-codes or provably secure digital fingerprinting codes

Author
Fernandez, M.; Kabatiansky, G.; Moreira, J.
Type of activity
Presentation of work at congresses
Name of edition
2015 IEEE International Symposium on Information Theory
Date of publication
2015
Presentation's date
2015-06
Book of congress proceedings
2015 IEEE International Symposium on Information Theory (ISIT 2015): Hong Kong: 14-19 June 2015
First page
1595
Last page
1599
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
DOI
https://doi.org/10.1109/ISIT.2015.7282725 Open in new window
Repository
http://hdl.handle.net/2117/98229 Open in new window
URL
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7282725 Open in new window
Abstract
Codes with the Identifiable Parent Property (IPP codes) form a very useful tool in traitor tracing schemes since they guarantee (with probability 1) identification of at least one of the traitors. We consider a natural generalization of IPP codes, namely codes for which this property holds with probability close to 1. A probabilistic version of the IPP problem has been studied under the name of collusion-secure digital fingerprinting codes. We point out that, somewhat surprisingly, fingerprintin...
Citation
Fernandez, M., Kabatiansky, G., Moreira, J. Almost IPP-codes or provably secure digital fingerprinting codes. A: IEEE International Symposium on Information Theory. "2015 IEEE International Symposium on Information Theory (ISIT 2015): Hong Kong: 14-19 June 2015". Hong Kong: Institute of Electrical and Electronics Engineers (IEEE), 2015, p. 1595-1599.
Keywords
Compensation (personnel), Digital fingerprinting, Fingerprinting code, Information theory, Natural generalization, Provably secure, Traitor tracing schemes
Group of research
ISG - Information Security Group

Participants