915 search results - page 30 / 183 » Proof labeling schemes |
TCC
2004
Springer
15 years 5 months ago
2004
Springer
In earlier work, we described a “pathological” example of a signature scheme that is secure in the Random Oracle Model, but for which no secure implementation exists. For that...
ASIACRYPT
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. It is almost a folklore-knowledge that hash-based time-stamping schemes are secure if the underlying hash function is collisionresistant but still no rigorous proofs have...
110
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
This paper studies a method for learning a discriminative visual codebook for various computer vision tasks such as image categorization and object recognition. The performance of...
ASIACRYPT
2006
Springer
15 years 3 months ago
2006
Springer
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
100
click to vote
CIKM
2007
Springer
15 years 5 months ago
2007
Springer
In this work, we attempt to tackle domain-transfer problem by combining old-domain labeled examples with new-domain unlabeled ones. The basic idea is to use old-domain-trained cla...