Sciweavers

321 search results - page 45 / 65
» Randomness extractors -- applications and constructions
Sort
View
PKC
2007
Springer
144views Cryptology» more  PKC 2007»
14 years 1 months ago
Traceable Ring Signature
Abstract. The ring signature allows a signer to leak secrets anonymously, without the risk of identity escrow. At the same time, the ring signature provides great flexibility: No ...
Eiichiro Fujisaki, Koutarou Suzuki
SIGCOMM
2004
ACM
14 years 25 days ago
Mercury: supporting scalable multi-attribute range queries
This paper presents the design of Mercury, a scalable protocol for supporting multi-attribute rangebased searches. Mercury differs from previous range-based query systems in that...
Ashwin R. Bharambe, Mukesh Agrawal, Srinivasan Ses...
IACR
2011
136views more  IACR 2011»
12 years 7 months ago
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
Daniele Micciancio, Chris Peikert
SAC
2006
ACM
14 years 1 months ago
The impact of sample reduction on PCA-based feature extraction for supervised learning
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
Mykola Pechenizkiy, Seppo Puuronen, Alexey Tsymbal
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 7 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett