Sciweavers

2735 search results - page 11 / 547
» Comparing notions of randomness
Sort
View
SODA
2003
ACM
158views Algorithms» more  SODA 2003»
13 years 8 months ago
Comparing top k lists
Motivated by several applications, we introduce various distance measures between “top k lists.” Some of these distance measures are metrics, while others are not. For each of...
Ronald Fagin, Ravi Kumar, D. Sivakumar
IJNSEC
2008
107views more  IJNSEC 2008»
13 years 7 months ago
Short Designated Verifier Signature Scheme and Its Identity-based Variant
The notion of strong designated verifier signature was put forth by Jakobsson, Sako and Impagliazzo in 1996, but the formal definition was defined recently by Saeednia, Kremer and...
Xinyi Huang, Willy Susilo, Yi Mu, Futai Zhang
IACR
2011
90views more  IACR 2011»
12 years 7 months ago
On the Security of the Winternitz One-Time Signature Scheme
Abstract. We show that the Winternitz one-time signature scheme is existentially unforgeable under adaptive chosen message attacks when instantiated with a family of pseudo random ...
Johannes Buchmann, Erik Dahmen, Sarah Ereth, Andre...
PAKM
2000
13 years 8 months ago
Managing Knowledge through Experimentation and Socialisation
This paper reports results of an empirical examination of the facilitating role of experimentation and socialisation in enhancing individual knowledge and performance in decision ...
Meliha Handzic
MLQ
2006
77views more  MLQ 2006»
13 years 7 months ago
How much sweetness is there in the universe?
Abstract. We continue investigations of forcing notions with strong ccc properties introducing new methods of building sweet forcing notions. We also show that quotients of topolog...
Andrzej Roslanowski, Saharon Shelah