7 search results - page 1 / 2 » Approximate Quantum Error-Correcting Codes and Secret Sharin... |
EUROCRYPT
2005
Springer
13 years 9 months ago
2005
Springer
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
CRYPTO
2005
Springer
13 years 10 months ago
2005
Springer
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
FOCS
2006
IEEE
13 years 10 months ago
2006
IEEE
Secret sharing and multiparty computation (also called “secure function evaluation”) are fundamental primitives in modern cryptography, allowing a group of mutually distrustfu...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
—Spectral Minutiae (SM) representation enables the combination of minutiae-based fingerprint recognition systems with template protection schemes based on fuzzy commitment, but ...
AVBPA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In this paper we show the feasibility of template protecting biometric authentication systems. In particular, we apply template protection schemes to fingerprint data. T...