71 search results - page 13 / 15 » focs 2009 |
115
click to vote
ASIACRYPT
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Predicate encryption is a recent generalization of identitybased encryption (IBE), broadcast encryption, attribute-based encryption, and more. A natural question is wheth...
CRYPTO
2009
Springer
15 years 6 months ago
2009
Springer
RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instanti...
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
89
Voted
ECCC
2007
15 years 8 days ago
2007
Abstract: We give an explicit construction of a pseudorandom generator against lowdegree polynomials over finite fields. Pseudorandom generators against linear polynomials, known...
135
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...