Sciweavers

71 search results - page 13 / 15
» focs 2009
Sort
View
ASIACRYPT
2009
Springer
15 years 4 months ago
On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations
Abstract. Predicate encryption is a recent generalization of identitybased encryption (IBE), broadcast encryption, attribute-based encryption, and more. A natural question is wheth...
Jonathan Katz, Arkady Yerukhimovich
CRYPTO
2009
Springer
119views Cryptology» more  CRYPTO 2009»
15 years 4 months ago
How Risky Is the Random-Oracle Model?
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...
Gaëtan Leurent, Phong Q. Nguyen
FSTTCS
2009
Springer
15 years 4 months ago
Iterative Methods in Combinatorial Optimization
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...
R. Ravi
ECCC
2007
100views more  ECCC 2007»
14 years 10 months ago
Unconditional pseudorandom generators for low degree polynomials
Abstract: We give an explicit construction of a pseudorandom generator against lowdegree polynomials over finite fields. Pseudorandom generators against linear polynomials, known...
Shachar Lovett
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
15 years 7 months ago
Bidimensionality and Kernels
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...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...