Asymptotics of fingerprinting and group testing: capacity-achieving log-likelihood decoders
暂无分享,去创建一个
[1] A. Sebő. ON TWO RANDOM SEARCH PROBLEMS , 1985 .
[2] Boris Skoric,et al. Riding the saddle point: asymptotics of the capacity-achieving simple decoder for bias-based traitor tracing , 2013, IACR Cryptol. ePrint Arch..
[3] Teddy Furon,et al. Blind decoder for binary probabilistic traitor tracing codes , 2009, 2009 First IEEE International Workshop on Information Forensics and Security (WIFS).
[4] Lizhong Zheng,et al. Linear Universal Decoding for Compound Channels , 2010, IEEE Transactions on Information Theory.
[5] Venkatesh Saligrama,et al. Non-adaptive group testing: Explicit bounds and novel algorithms , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.
[6] Tamir Tassa,et al. Improved versions of Tardos’ fingerprinting scheme , 2008, Des. Codes Cryptogr..
[7] Pierre Moulin,et al. On fingerprinting capacity games for arbitrary alphabets and their asymptotics , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.
[8] Boris Skoric,et al. Dynamic Tardos Traitor Tracing Schemes , 2011, IEEE Transactions on Information Theory.
[9] Pierre Moulin,et al. Universal fingerprinting: Capacity and random-coding exponents , 2008, 2008 IEEE International Symposium on Information Theory.
[10] Jeroen Doumen,et al. Dynamic traitor tracing for arbitrary alphabets: Divide and conquer , 2012, 2012 IEEE International Workshop on Information Forensics and Security (WIFS).
[11] E. S. Pearson,et al. On the Problem of the Most Efficient Tests of Statistical Hypotheses , 1933 .
[12] A. Sterrett. On the Detection of Defective Members of Large Populations , 1957 .
[13] Teddy Furon,et al. EM decoding of tardos traitor tracing codes , 2009, MM&Sec '09.
[14] V. V. Rykov,et al. Superimposed distance codes , 1989 .
[15] Venkatesh Saligrama,et al. Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[16] Amos Fiat,et al. Dynamic Traitor Tracing , 2001, Journal of Cryptology.
[17] Thijs Laarhoven,et al. Dynamic traitor tracing schemes, revisited , 2013, 2013 IEEE International Workshop on Information Forensics and Security (WIFS).
[18] Pierre Moulin,et al. On the Saddle-Point Solution and the Large-Coalition Asymptotics of Fingerprinting Games , 2010, IEEE Transactions on Information Forensics and Security.
[19] Thijs Laarhoven,et al. Discrete distributions in the tardos scheme, revisited , 2013, IH&MMSec '13.
[20] Thijs Laarhoven,et al. Efficient probabilistic group testing based on traitor tracing , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[21] Thijs Laarhoven,et al. Asymptotics of Fingerprinting and Group Testing: Tight Bounds From Channel Capacities , 2014, IEEE Transactions on Information Forensics and Security.
[22] Teddy Furon,et al. Toward Practical Joint Decoding of Binary Tardos Fingerprinting Codes , 2012, IEEE Transactions on Information Forensics and Security.
[23] Gábor Tardos,et al. High rate fingerprinting codes and the fingerprinting capacity , 2009, SODA.
[24] Dan Boneh,et al. Collusion-Secure Fingerprinting for Digital Data , 1998, IEEE Trans. Inf. Theory.
[25] Stefan Katzenbeisser,et al. Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes , 2008, Des. Codes Cryptogr..
[26] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[27] E. S. Pearson,et al. On the Problem of the Most Efficient Tests of Statistical Hypotheses , 1933 .
[28] Boris Skoric,et al. Asymptotic Fingerprinting Capacity for Non-binary Alphabets , 2011, Information Hiding.
[29] Marcel Schäfer,et al. Performance and code length optimization of joint decoding tardos fingerprinting , 2012, MM&Sec '12.
[30] Thijs Laarhoven,et al. Optimal symmetric Tardos traitor tracing schemes , 2011, Designs, Codes and Cryptography.
[31] Amin Karbasi,et al. Group Testing With Probabilistic Tests: Theory, Design and Application , 2010, IEEE Transactions on Information Theory.
[32] Teddy Furon,et al. Tardos codes for real , 2014, 2014 IEEE International Workshop on Information Forensics and Security (WIFS).
[33] S. Wei. Secure Frameproof Codes, Key Distribution Patterns, Group Testing Algorithms and Related Structures , 1997 .
[34] Hideki Imai,et al. An improvement of discrete Tardos fingerprinting codes , 2009, Des. Codes Cryptogr..
[35] Boris Skoric,et al. A Capacity-Achieving Simple Decoder for Bias-Based Traitor Tracing Schemes , 2015, IEEE Transactions on Information Theory.
[36] Teddy Furon,et al. Group testing meets traitor tracing , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).
[37] William Puech,et al. Enhanced blind decoding of tardos codes with new MAP-based functions , 2013, 2013 IEEE 15th International Workshop on Multimedia Signal Processing (MMSP).
[38] Teddy Furon,et al. Expectation maximization decoding of Tardos probabilistic fingerprinting code , 2009, Electronic Imaging.
[39] Minoru Kuribayashi. Bias Equalizer for Binary Probabilistic Fingerprinting Codes , 2012, Information Hiding.
[40] Jeroen Doumen,et al. Tuple decoders for traitor tracing schemes , 2014, Electronic Imaging.
[41] George Atia,et al. Boolean Compressed Sensing and Noisy Group Testing , 2009, IEEE Transactions on Information Theory.
[42] Dino Sejdinovic,et al. Note on noisy group testing: Asymptotic bounds and belief propagation reconstruction , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[43] Thijs Laarhoven. Capacities and capacity-achieving decoders for various fingerprinting games , 2014, IH&MMSec '14.