503 search results - page 2 / 101 » An Independence Relation for Sets of Secrets |
ACNS
2010
Springer
13 years 8 months ago
2010
Springer
Secure sketches are useful in extending cryptographic schemes to biometric data since they allow recovery of fuzzy secrets under inevitable noise. In practice, secrets derived from...
IJCNN
2006
IEEE
13 years 11 months ago
2006
IEEE
— We introduce in this paper methods for finding mutually corresponding dependent components from two different but related data sets in an unsupervised (blind) manner. The basi...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
The proposed approach works for any underlying secret sharing scheme. It is based on the concept of verification sets of participants, related to authorized set of participants. T...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
TCC
2010
Springer
13 years 12 months ago
2010
Springer
Introduced by Micali, Rabin and Kilian (MRK), the basic primitive of zero-knowledge sets (ZKS) allows a prover to commit to a secret set S so as to be able to prove statements such...