Sciweavers

269 search results - page 7 / 54
» random 2001
Sort
View
CCS
2006
ACM
14 years 1 months ago
Ring signatures without random oracles
Since the formalization of ring signature by Rivest, Shamir and Tauman in 2001, there are lots of variations appeared in the literature. Almost all of the variations rely on the ra...
Sherman S. M. Chow, Victor K.-W. Wei, Joseph K. Li...
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
14 years 2 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito
WSC
2001
13 years 11 months ago
Using common random numbers for indifference-zone selection
This paper discusses the validity of using common random numbers (CRNs) with two-stage selection procedures to improve the possibility of correct selection and discusses the intri...
E. Jack Chen
PICS
2000
13 years 11 months ago
Data Embedding Using Phase Dispersion
A method of data embedding based on the convolution of message data with a random phase carrier is presented. The theory behind this method is reviewed and it is shown that the te...
Chris Honsinger
SACRYPT
2001
Springer
110views Cryptology» more  SACRYPT 2001»
14 years 2 months ago
Random Walks Revisited: Extensions of Pollard's Rho Algorithm for Computing Multiple Discrete Logarithms
This paper extends the analysis of Pollard’s rho algorithm for solving a single instance of the discrete logarithm problem in a finite cyclic group G to the case of solving more...
Fabian Kuhn, René Struik