Sciweavers

532 search results - page 27 / 107
» Graphically abelian groups
Sort
View
FOCS
2009
IEEE
14 years 4 months ago
KKL, Kruskal-Katona, and Monotone Nets
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
Ryan O'Donnell, Karl Wimmer
CSFW
2010
IEEE
14 years 1 months ago
Impossibility Results for Secret Establishment
—Security protocol design is a creative discipline where the solution space depends on the problem to be solved and the cryptographic operators available. In this paper, we exami...
Benedikt Schmidt, Patrick Schaller, David A. Basin
IANDC
2008
150views more  IANDC 2008»
13 years 10 months ago
Hierarchical combination of intruder theories
Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weakn...
Yannick Chevalier, Michaël Rusinowitch
COMBINATORICS
2000
63views more  COMBINATORICS 2000»
13 years 9 months ago
A Ramsey Treatment of Symmetry
Given a space endowed with symmetry, we define ms(, r) to be the maximum of m such that for any r-coloring of there exists a monochromatic symmetric set of size at least m. We c...
Taras O. Banakh, O. V. Verbitsky, Ya. Vorobets
JOC
2010
129views more  JOC 2010»
13 years 4 months ago
Discrete Logarithm Problems with Auxiliary Inputs
Let g be an element of prime order p in an abelian group and let Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, the secret key can be computed de...
Jung Hee Cheon