30 search results - page 6 / 6 » Cox's Theorem Revisited |
STACS
2001
Springer
13 years 9 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
EUROCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes bas...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
—The paper studies the problem of securely storing biometric passwords, such as fingerprints and irises. With the help of coding theory Juels and Wattenberg derived in 1999 a sc...
IJCM
2010
13 years 3 months ago
2010
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which refl...
SENSYS
2003
ACM
13 years 10 months ago
2003
ACM
We consider dense wireless sensor networks deployed to observe arbitrary random fields. The requirement is to reconstruct an estimate of the random field at a certain collector ...