A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Filters
A low-rate fingerprinting code and its application to blind image fingerprinting
2008
Security, Forensics, Steganography, and Watermarking of Multimedia Contents X
We investigate a design based on a Reed-Solomon outer code modulated onto an orthonormal constellation, and the Guruswami-Sudan decoding algorithm. ...
In the second part of this paper, we apply this code to a blind image fingerprinting problem, using a linear cancellation technique for embedding in the wavelet domain. ...
For example, for a [31,5] Reed-Solomon code over GF(32), we have M = 32 5 = 33, 554, 432 and N = 31 × 32 = 992 and the Guruswami-Sudan algorithm can correct 18.55 errors. ...
doi:10.1117/12.767846
dblp:conf/sswmc/JourdasM08
fatcat:4vcxaasngvcmdi4xamh7pgid6u
Some new results on equivalency of collusion-secure properties for Reed-Solomon codes
2015
IET Information Security
Theory 49, 2003) proposed a question on the equivalence of identifiable parent property and traceability property for Reed-Solomon code family. ...
It is notable that the concept of subspace subcode of Reed-Solomon code, which was introduced in errorcorrecting code theory, provides an interesting prospect for our topic. ...
It is well known that RS k (q) is a [q − 1, k, q − k]-linear code. Reed-Solomon code is one of the most famous error-correcting codes and it also has an application in digital fingerprinting. A. ...
doi:10.1049/iet-ifs.2014.0551
fatcat:2hohr6e2bzce3bwgoybmiiu6ya
Some New Results on Equivalency of Collusion-Secure Properties for Reed-Solomon Codes
[article]
2013
arXiv
pre-print
Theory 49, 2003) proposed a question on the equivalence of identifiable parent property and traceability property for Reed-Solomon code family. ...
It is notable that the concept of subspace subcode of Reed-Solomon code, which was introduced in error-correcting code theory, provides an interesting prospect for our topic. ...
It is well known that RS k (q) is a [q − 1, k, q − k]-linear code. Reed-Solomon code is one of the most famous error-correcting codes and it also has an application in digital fingerprinting. A. ...
arXiv:1311.2346v1
fatcat:e5xoquvhebc35peggafpktslry
Separation Properties and Related Bounds of Collusion-secure Fingerprinting Codes
[article]
2013
arXiv
pre-print
Next we tried to study some interesting relationship between separation and existence of non-trivial subspace subcodes for Reed-Solomon codes. ...
We tried to obtain a new existence result for (w_1, w_2)-separating codes and discuss the "optimality" of the upper bounds. ...
Moreira for sending his article [9] by e-mail and offering advices on Silverberg's open problem. ...
arXiv:1304.6161v2
fatcat:a6rjutwvr5erbgpv3ycfnr5wbm
On the relationship between the traceability properties of Reed-Solomon codes
2012
Advances in Mathematics of Communications
However, it has been conjectured that for Reed-Solomon codes all three properties are equivalent. ...
Fingerprinting codes are used to prevent dishonest users (traitors) from redistributing digital contents. ...
Acknowledgments We would like to thank the anonymous referees for their thorough and valuable comments, which motivated major improvements on this manuscript. ...
doi:10.3934/amc.2012.6.467
fatcat:vaco65jbwjf5dlhuvna5esmjtu
Private key encryption and recovery in blockchain
[article]
2020
arXiv
pre-print
The disruptive technology of blockchain can deliver secure solutions without the need for a central authority. ...
For the later, we introduce an efficient recovery mechanism using biometrics and secret sharing scheme. ...
Reed-solomon Error Correction Reed-solomon [32] is an error correction (erasure coding) mechanism. ...
arXiv:1907.04156v2
fatcat:nfo775mnp5bhbj2zecc3k5coni
Performance Study on Multimedia Fingerprinting Employing Traceability Codes
[chapter]
2005
Lecture Notes in Computer Science
Digital fingerprinting is a tool to protect multimedia content from illegal redistribution by uniquely marking copies of the content distributed to each user. ...
Coded fingerprinting is one major category of fingerprinting techniques against collusion. ...
Moreover, for Reed-Solomon code (including extended Reed-Solomon code), L ≤ q+1. In order to get larger L, a larger q is also preferred. ...
doi:10.1007/11551492_7
fatcat:4d4njs45onfnjm5y6ycww4rrx4
On the IPP Properties of Reed-Solomon Codes
[chapter]
2009
IFIP Advances in Information and Communication Technology
In this paper, we show that for Reed-Solomon codes both properties are in many cases equivalent. ...
This answers a question posted by Silverberg et al. in [10, 11] , for a large family of Reed-Solomon codes. ...
The IPP Condition for Reed-Solomon Codes In this section we set the ground for the discussion of our main results. ...
doi:10.1007/978-3-642-01244-0_8
fatcat:lzlngtojqrhxrp2ubzaa7mficy
Evaluation and implement of fuzzy vault scheme using indexed minutiae
2007
2007 IEEE International Conference on Systems, Man and Cybernetics
In order to address the issue, we propose a new scheme of fuzzy vault for fingerprint that assigns identification number to all minutiae and chaff (fake minutia) and determines correct order in greedy ...
However, typical feature extracted from fingerprint, called minutiae, is assumed to tolerate against re-ordering minutiae. ...
Reed-Solomon(RS) code Reed-Solomon is an error-collecting code, with -bit blocks, defined over GF (2 ) , which ensures t-block errorcollection, i.e., t-bit error collection. ...
doi:10.1109/icsmc.2007.4413865
dblp:conf/smc/KikuchiON07
fatcat:m5wz7ny7czcmbixxzzwivrdvga
Review of FPGA Implementation of Reed-Solomon Encoder-Decoder
2014
International Journal of Computer Applications
In this paper, the proposed work is to implement the encoder and decoder of Reed-Solomon (RS) coding scheme on the platform of VLSI using the Euclid's algorithm. ...
An important function of any modern digital communication system is error control coding (ECC). ...
Reed-Solomon codes are efficiently used for compact discs to correct the bursts which might occur due to scratches or fingerprints on the discs. ...
doi:10.5120/15228-3749
fatcat:7m6ayuwkajatvgq47cxozkbini
Upper Bounds on the Number of Codewords of Some Separating Codes
[article]
2013
arXiv
pre-print
Then we illustrate that the Upper Bound Conjecture for separating Reed-Solomon codes inherited from Silverberg's question holds true for almost all Reed-Solomon codes. ...
Separating codes have their applications in collusion-secure fingerprinting for generic digital data, while they are also related to the other structures including hash family, intersection code and group ...
Question 2 (Upper Bound Conjecture for Separating Reed-Solomon Codes) Is it the case that all (w 1 , w 2 )−separating Reed-Solomon codes satisfy the condition d > n(1 − 1 w 1 w 2 )? ...
arXiv:1208.2076v2
fatcat:nkiuacppcfcw3lasvclocm4eh4
Towards optimal design of signal fingerprinting codes
2008
Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing
We propose two approaches for building fingerprinting codes that accommodate millions of users and resist tens of colluders. ...
Digital fingerprinting aims at protecting multimedia contents from illegal redistribution by embedding imperceptible fingerprints identifying the users. ...
Note that [6, 7] also used fingerprinting codes based on a Reed-Solomon inner code but did not use the Guruswami-Sudan decoding algorithm. ...
doi:10.1109/icassp.2008.4517943
dblp:conf/icassp/JourdasM08
fatcat:hr333dnisfd2dms32tnrlbvjm4
Anonymous Fingerprinting
[chapter]
1997
Lecture Notes in Computer Science
Now buyers would have to identify themselves solely for the purpose of fingerprinting. ...
Our results can also be applied to so-called traitor tracing, the equivalent of fingerprinting for broadcast encryption. ...
Acknowledgments We thank Matthias Schunter for interesting discussions and Rudi Piotraschke for helpful advice with coding theory. ...
doi:10.1007/3-540-69053-0_8
fatcat:uxryv5jp5vccboz7fh3zrsuejq
Reliability-balanced feature level fusion for fuzzy commitment scheme
2011
2011 International Joint Conference on Biometrics (IJCB)
In this paper a feature level fusion technique for fuzzy commitment schemes is presented. ...
In their scheme 2048-bit iris-codes are applied to bind and retrieve 140-bit cryptographic keys prepared with Hadamard and Reed-Solomon error correction codes. ...
Hadamard codes are applied to eliminate bit errors originating from the natural biometric variance and Reed-Solomon codes are applied to correct burst errors resulting from distortions. ...
doi:10.1109/ijcb.2011.6117535
dblp:conf/icb/RathgebUW11
fatcat:gp3r3rytbvfvnkyq24lheb7qqy
Robust Biometric Key Extraction Based on Iris Cryptosystem
[chapter]
2009
Lecture Notes in Computer Science
The concatenated coding scheme that combines Reed-Solomon code and convolutional code is proposed so that much longer keys can be extracted from the iris data, while the bit masking scheme is proposed ...
to minimize and randomize the errors occur in the iris codes, making the error pattern more suitable for the coding scheme. ...
Reed-Solomon code is a sub type of BCH code which is non-binary. ...
doi:10.1007/978-3-642-01793-3_107
fatcat:iq7nzypxbvcwblol7fz5lw5psq
« Previous
Showing results 1 — 15 out of 447 results