Sciweavers

321 search results - page 22 / 65
» Randomness extractors -- applications and constructions
Sort
View
CRYPTO
2007
Springer
106views Cryptology» more  CRYPTO 2007»
14 years 2 months ago
Simulatable VRFs with Applications to Multi-theorem NIZK
Abstract. This paper introduces simulatable verifiable random functions (sVRF). VRFs are similar to pseudorandom functions, except that they are also verifiable: corresponding to...
Melissa Chase, Anna Lysyanskaya
STOC
1998
ACM
96views Algorithms» more  STOC 1998»
14 years 21 days ago
Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks
In this paper we study randomized algorithms for circuit switching on multistage networks related to the butterfly. We devise algorithms that route messages by constructing circu...
Richard Cole, Bruce M. Maggs, Friedhelm Meyer auf ...
IJSN
2006
96views more  IJSN 2006»
13 years 8 months ago
A new signature scheme without random oracles
In this paper, we propose a new signature scheme that is existentially unforgeable under a chosen message attack without random oracle. The security of our scheme depends on a new ...
Chik How Tan
ICPR
2008
IEEE
14 years 9 months ago
The implication of data diversity for a classifier-free ensemble selection in random subspaces
Ensemble of Classifiers (EoC) has been shown effective in improving the performance of single classifiers by combining their outputs. By using diverse data subsets to train classi...
Albert Hung-Ren Ko, Robert Sabourin, Luiz E. Soare...
STACS
2009
Springer
14 years 3 months ago
Generating Shorter Bases for Hard Random Lattices
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
Joël Alwen, Chris Peikert