406 search results - page 21 / 82 » Pseudorandomness and Combinatorial Constructions |
114
click to vote
CRYPTO
2012
Springer
13 years 1 months ago
2012
Springer
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
104
click to vote
CRYPTO
2008
Springer
15 years 27 days ago
2008
Springer
The Random Oracle Model and the Ideal Cipher Model are two well known idealised models of computation for proving the security of cryptosystems. At Crypto 2005, Coron et al. showed...
TAP
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Usage of combinatorial testing is wide spreading as an effective technique to reveal unintended feature interaction inside a given system. To this aim, test cases are con...
108
click to vote
IJCAI
2001
15 years 14 days ago
2001
This paper presents a method for designing bundles in a combinatorial auction protocol that is robust against false-name bids. Internet auctions have become an integral part of El...
EELC
2006
15 years 2 months ago
2006
Abstract. According to the functional approach to language evolution (inspired by cognitive linguistics and construction grammar), grammar arises to deal with issues in communicati...