1173 search results - page 5 / 235 » On the Compositionality of Round Abstraction |
ICNP
2005
IEEE
14 years 3 months ago
2005
IEEE
straction of Complex Network Compositions∗ Azer Bestavros, Adam D. Bradley, Assaf J. Kfoury, and Ibrahim Matta Department of Computer Science Boston University The heterogeneity...
CANS
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. This paper presents the first independent and systematic linear, differential and impossible-differential (ID) cryptanalyses of MIBS, a lightweight block cipher aimed at ...
FSE
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. This paper presents a linear cryptanalytic attack against reduced round variants of the SAFER family of block ciphers. Compared
LATIN
2010
Springer
14 years 4 months ago
2010
Springer
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...