Sciweavers

321 search results - page 33 / 65
» Randomness extractors -- applications and constructions
Sort
View
CRYPTO
2005
Springer
103views Cryptology» more  CRYPTO 2005»
15 years 10 months ago
Pebbling and Proofs of Work
We investigate methods for providing easy-to-check proofs of computational effort. Originally intended for discouraging spam, the concept has wide applicability as a method for co...
Cynthia Dwork, Moni Naor, Hoeteck Wee
EUROCRYPT
2003
Springer
15 years 9 months ago
Nearly One-Sided Tests and the Goldreich-Levin Predicate
Abstract. We study statistical tests with binary output that rarely outputs one, which we call nearly one-sided statistical tests. We provide an efficient reduction establishing im...
Gustav Hast
NAACL
2003
15 years 5 months ago
Category-based Pseudowords
A pseudoword is a composite comprised of two or more words chosen at random; the individual occurrences of the original words within a text are replaced by their conflation. Pseu...
Preslav Nakov, Marti A. Hearst
IBPRIA
2003
Springer
15 years 9 months ago
Segmentation of Curvilinear Objects Using a~Watershed-Based Curve Adjacency Graph
Abstract. This paper presents a general framework to segment curvilinear objects in 2D images. A pre-processing step relies on mathematical morphology to obtain a connected line wh...
Thierry Géraud
CRYPTO
2000
Springer
133views Cryptology» more  CRYPTO 2000»
15 years 8 months ago
Provably Secure Partially Blind Signatures
Partially blind signature schemes are an extension of blind signature schemes that allow a signer to explicitly include necessary information (expiration date, collateral condition...
Masayuki Abe, Tatsuaki Okamoto