Sciweavers

6202 search results - page 55 / 1241
» Without Loss of Generality
Sort
View
CRYPTO
2008
Springer
150views Cryptology» more  CRYPTO 2008»
14 years 11 months ago
On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
Abstract. The study of deterministic public-key encryption was initiated by Bellare et al. (CRYPTO '07), who provided the "strongest possible" notion of security for...
Alexandra Boldyreva, Serge Fehr, Adam O'Neill
CEC
2010
IEEE
14 years 11 months ago
Evolving natural language grammars without supervision
Unsupervised grammar induction is one of the most difficult works of language processing. Its goal is to extract a grammar representing the language structure using texts without a...
Lourdes Araujo, Jesus Santamaria
CCS
2010
ACM
14 years 10 months ago
Return-oriented programming without returns
We show that on both the x86 and ARM architectures it is possible to mount return-oriented programming attacks without using return instructions. Our attacks instead make use of c...
Stephen Checkoway, Lucas Davi, Alexandra Dmitrienk...
QUESTA
2006
101views more  QUESTA 2006»
14 years 10 months ago
Insensitive versus efficient dynamic load balancing in networks without blocking
So-called Whittle networks have recently been shown to give tight approximations for the performance of non-locally balanced networks with blocking, including practical routing pol...
Matthieu Jonckheere
WINET
2010
88views more  WINET 2010»
14 years 8 months ago
Tree-based object tracking without mobility statistics in wireless sensor networks
Object tracking in wireless sensor networks is to track mobile objects by scattered sensors. These sensors are typically organized into a tree to deliver report messages upon dete...
Li-Hsing Yen, Bang Ye Wu, Chia-Cheng Yang