163 search results - page 30 / 33 » Relaxing Chosen-Ciphertext Security |
143
click to vote
EUROCRYPT
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...
151
click to vote
CMS
2001
15 years 5 months ago
2001
Good public-key infrastructures (PKIs) are essential to make electronic commerce secure. Quite recently, certificate verification trees (CVTs) have been introduced as a tool for im...
154
click to vote
JSAC
2006
15 years 3 months ago
2006
In defending against various network attacks, such as distributed denial-of-service (DDoS) attacks or worm attacks, a defense system needs to deal with various network conditions a...
145
click to vote
MP
2010
14 years 10 months ago
2010
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
166
click to vote
PLDI
2011
ACM
14 years 6 months ago
2011
ACM
Current proposals for concurrent shared-memory languages, including C++ and C, provide sequential consistency only for programs without data races (the DRF guarantee). While the i...