Results 1  10
of
26
Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. Technical Report 2003/235, Cryptology ePrint archive, http://eprint.iacr.org, 2006. Previous version appeared at EUROCRYPT 2004
 34 [DRS07] [DS05] [EHMS00] [FJ01] Yevgeniy Dodis, Leonid Reyzin, and Adam
, 2004
"... We provide formal definitions and efficient secure techniques for • turning noisy information into keys usable for any cryptographic application, and, in particular, • reliably and securely authenticating biometric data. Our techniques apply not just to biometric information, but to any keying mater ..."
Abstract

Cited by 292 (35 self)
 Add to MetaCart
We provide formal definitions and efficient secure techniques for • turning noisy information into keys usable for any cryptographic application, and, in particular, • reliably and securely authenticating biometric data. Our techniques apply not just to biometric information, but to any keying material that, unlike traditional cryptographic keys, is (1) not reproducible precisely and (2) not distributed uniformly. We propose two primitives: a fuzzy extractor reliably extracts nearly uniform randomness R from its input; the extraction is errortolerant in the sense that R will be the same even if the input changes, as long as it remains reasonably close to the original. Thus, R can be used as a key in a cryptographic application. A secure sketch produces public information about its input w that does not reveal w, and yet allows exact recovery of w given another value that is close to w. Thus, it can be used to reliably reproduce errorprone biometric inputs without incurring the security risk inherent in storing them. We define the primitives to be both formally secure and versatile, generalizing much prior work. In addition, we provide nearly optimal constructions of both primitives for various measures of “closeness” of input data, such as Hamming distance, edit distance, and set difference.
On irregularities of distribution
 Mathematika
, 1954
"... constantweight codes, distance distribution, equidistant codes, linear programming bound New lower bounds are presented on the second moment of the distance distribution of binary codes, in terms of the first moment of the distribution. These bounds are used to obtain upper bounds on the size of co ..."
Abstract

Cited by 53 (0 self)
 Add to MetaCart
constantweight codes, distance distribution, equidistant codes, linear programming bound New lower bounds are presented on the second moment of the distance distribution of binary codes, in terms of the first moment of the distribution. These bounds are used to obtain upper bounds on the size of codes whose maximum distance is close to their minimum distance. It is then demonstrated how such bounds can be applied to bound from below the smallest attainable ratio between the maximum distance and the minimum distance of codes. Finally, counterparts of the bounds are derived for the special case of constantweight codes.
A New Algorithm For The MaximumWeight Clique Problem
"... Given a graph, in the maximum clique problem one wants to find the largest number of vertices, any two of which are adjacent. In the maximumweight clique problem, the vertices have positive, integer weights, and one wants to find a clique with maximum weight. A recent algorithm for the maximum cliq ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
Given a graph, in the maximum clique problem one wants to find the largest number of vertices, any two of which are adjacent. In the maximumweight clique problem, the vertices have positive, integer weights, and one wants to find a clique with maximum weight. A recent algorithm for the maximum clique problem is here used as a basis for developing an algorithm for the weighted case. Computational experiments with random graphs show that this new algorithm is faster than earlier algorithms in many cases. A set of weighted graphs obtained from the problem of constructing good constant weight errorcorrecting codes are proposed as test cases for maximumweight clique algorithms
Extensions to the Johnson bound
, 2001
"... We present extensions of some recent geometric proofs of the wellknown Johnson bound. Our extensions apply to arbitrary alphabets (while previous proofs were given only for the binary case). Our extensions yield a "weighted " version of the Johnson bound equally easily  the weighted version is of ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
We present extensions of some recent geometric proofs of the wellknown Johnson bound. Our extensions apply to arbitrary alphabets (while previous proofs were given only for the binary case). Our extensions yield a "weighted " version of the Johnson bound equally easily  the weighted version is of interest in light of the recent developments on softdecision list decoding algorithms.
Improved Upper Bounds on Sizes of Codes
 IEEE TRANS. INFORM. THEORY
, 2002
"... Let A(n, d) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is the Johnson bound. We give a new upper bound which is at least as good as the Johnson bound for all values of and , a ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Let A(n, d) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is the Johnson bound. We give a new upper bound which is at least as good as the Johnson bound for all values of and , and for each there are infinitely many values of for which the new bound is better than the Johnson bound. For small values of and , the best known method to obtain upper bounds on ( ) is linear programming. We give new inequalities for the linear programming and show that with these new inequalities some of the known bounds on ( ) for 28 are improved.
A new Table of Constant Weight Codes of Length Greater than 28
 THE ELECTRONIC JOURNAL OF COMBINATORICS
, 2006
"... Existing tables of constant weight codes are mainly confined to codes of length n ≤ 28. This paper presents tables of codes of lengths 29 ≤ n ≤ 63. The motivation for creating these tables was their application to the generation of good sets of frequency hopping lists in radio networks. The complete ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Existing tables of constant weight codes are mainly confined to codes of length n ≤ 28. This paper presents tables of codes of lengths 29 ≤ n ≤ 63. The motivation for creating these tables was their application to the generation of good sets of frequency hopping lists in radio networks. The complete generation of all relevant cases by a small number of algorithms is augmented in individual cases by miscellaneous constructions. These sometimes give a larger number of codewords than the algorithms.
Bounds for codes by semidefinite programming
, 2006
"... Delsarte’s method and its extensions allow to consider the upper bound problem for codes in 2pointhomogeneous spaces as a linear programming problem with perhaps infinitely many variables, which are the distance distribution. We show that using as variables power sums of distances this problem can ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Delsarte’s method and its extensions allow to consider the upper bound problem for codes in 2pointhomogeneous spaces as a linear programming problem with perhaps infinitely many variables, which are the distance distribution. We show that using as variables power sums of distances this problem can be considered as a finite semidefinite programming problem. This method allows to improve some linear programming upper bounds. In particular we obtain new bounds of onesided kissing numbers. 1
ErrorCorrecting Balanced Knuth Codes
"... Abstract—Knuth’s celebrated balancing method consists of inverting the first k bits in a binary information sequence, such that the resulting sequence has as many ones as zeroes, and communicating the index k to the receiver through a short balanced prefix. In the proposed method, Knuth’s scheme is ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract—Knuth’s celebrated balancing method consists of inverting the first k bits in a binary information sequence, such that the resulting sequence has as many ones as zeroes, and communicating the index k to the receiver through a short balanced prefix. In the proposed method, Knuth’s scheme is extended with errorcorrecting capabilities, where it is allowed to give unequal protection levels to the prefix and the payload. Analyses with respect to redundancy and block and bit error probabilities are performed, showing good results while maintaining the simplicity features of the original scheme. I.
CODES IN SPHERICAL CAPS
, 2006
"... We consider bounds on codes in spherical caps and related problems in geometry and coding theory. An extension of the Delsarte method is presented that relates upper bounds on the size of spherical codes to upper bounds on codes in caps. Several new upper bounds on codes in caps are derived. Applica ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We consider bounds on codes in spherical caps and related problems in geometry and coding theory. An extension of the Delsarte method is presented that relates upper bounds on the size of spherical codes to upper bounds on codes in caps. Several new upper bounds on codes in caps are derived. Applications of these bounds to estimates of the kissing numbers and onesided kissing numbers are considered. It is proved that the maximum size of codes in spherical caps for large dimensions is determined by the maximum size of spherical codes, so these problems are asymptotically equivalent.