Sciweavers

1249 search results - page 47 / 250
» Limitations of the Even-Mansour Construction
Sort
View
SCN
2008
Springer
105views Communications» more  SCN 2008»
13 years 9 months ago
Expressive Subgroup Signatures
In this work, we propose a new generalization of the notion of group signatures, that allows signers to cover the entire spectrum from complete disclosure to complete anonymity. Pr...
Xavier Boyen, Cécile Delerablée
FOCS
1999
IEEE
14 years 2 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
CDC
2008
IEEE
111views Control Systems» more  CDC 2008»
14 years 4 months ago
Computing correlated equilibria of polynomial games via adaptive discretization
— We construct a family of iterative discretization algorithms for computing sequences of finitely-supported correlated equilibria of n-player games with polynomial utility func...
Noah D. Stein, Asuman E. Ozdaglar, Pablo A. Parril...
CALCO
2007
Springer
100views Mathematics» more  CALCO 2007»
14 years 4 months ago
Applications of Metric Coinduction
Metric coinduction is a form of coinduction that can be used to establish properties of objects constructed as a limit of finite approximations. One can prove a coinduction step s...
Dexter Kozen, Nicholas Ruozzi
EOR
2006
83views more  EOR 2006»
13 years 10 months ago
Lower bounds and heuristic algorithms for the k
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of v...
Mauro Dell'Amico, Manuel Iori, Silvano Martello, M...