Sciweavers

163 search results - page 30 / 33
» Relaxing Chosen-Ciphertext Security
Sort
View
EUROCRYPT
2007
Springer
13 years 11 months ago
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
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 [...
Yi Deng, Dongdai Lin
CMS
2001
133views Communications» more  CMS 2001»
13 years 9 months ago
Asynchronous Large-Scale Certification Based on Certificate Verification Trees
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...
M. Mar Albà, Josep Domingo-Ferrer, Francesc...
JSAC
2006
137views more  JSAC 2006»
13 years 7 months ago
Adaptive Defense Against Various Network Attacks
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...
Cliff Changchun Zou, Nick G. Duffield, Donald F. T...
MP
2010
163views more  MP 2010»
13 years 2 months ago
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
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...
Christoph Buchheim, Frauke Liers, Marcus Oswald
PLDI
2011
ACM
12 years 10 months ago
Safe optimisations for shared-memory concurrent programs
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...
Jaroslav Sevcík