Sciweavers

193 search results - page 19 / 39
» A New Redundancy Reducing Cipher
Sort
View
SAS
1999
Springer
116views Formal Methods» more  SAS 1999»
14 years 4 days ago
Decomposing Non-redundant Sharing by Complementation
Complementation, the inverse of the reduced product operation, is a technique for systemfinding minimal decompositions of abstract domains. Fil´e and Ranzato advanced the state ...
Enea Zaffanella, Patricia M. Hill, Roberto Bagnara
ECCV
2006
Springer
14 years 9 months ago
Conditional Infomax Learning: An Integrated Framework for Feature Extraction and Fusion
The paper introduces a new framework for feature learning in classification motivated by information theory. We first systematically study the information structure and present a n...
Dahua Lin, Xiaoou Tang
NDSS
2008
IEEE
14 years 2 months ago
Halo: High-Assurance Locate for Distributed Hash Tables
We study the problem of reliably searching for resources in untrusted peer-to-peer networks, where a significant portion of the participating network nodes may act maliciously to...
Apu Kapadia, Nikos Triandopoulos
SAC
2010
ACM
14 years 2 months ago
Maintaining data reliability without availability in P2P storage systems
Peer-to-peer (P2P) storage is a promising technology to provide users with cheap and online persistence. However, due the instability of these infrastructures, P2P storage systems...
Lluis Pamies-Juarez, Pedro García Ló...
ASIACRYPT
2010
Springer
13 years 5 months ago
Improved Single-Key Attacks on 8-Round AES-192 and AES-256
Abstract. AES is the most widely used block cipher today, and its security is one of the most important issues in cryptanalysis. After 13 years of analysis, related-key attacks wer...
Orr Dunkelman, Nathan Keller, Adi Shamir