Sciweavers

1173 search results - page 33 / 235
» On the Compositionality of Round Abstraction
Sort
View
ISW
2007
Springer
14 years 4 months ago
The Security of Elastic Block Ciphers Against Key-Recovery Attacks
We analyze the security of elastic block ciphers against key-recovery attacks. An elastic version of a fixed-length block cipher is a variable-length block cipher that supports an...
Debra L. Cook, Moti Yung, Angelos D. Keromytis
ICISC
2008
126views Cryptology» more  ICISC 2008»
13 years 11 months ago
Essentially Optimal Universally Composable Oblivious Transfer
Oblivious transfer is one of the most important cryptographic primitives, both for theoretical and practical reasons and several protocols were proposed during the years. We provid...
Ivan Damgård, Jesper Buus Nielsen, Claudio O...
IPPS
2006
IEEE
14 years 3 months ago
Effecting parallel graph eigensolvers through library composition
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
A. Breuer, Peter Gottschling, Douglas Gregor, Andr...
FMSD
2008
110views more  FMSD 2008»
13 years 10 months ago
Automatic symbolic compositional verification by learning assumptions
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
Wonhong Nam, P. Madhusudan, Rajeev Alur
SOFSEM
2009
Springer
14 years 6 months ago
A Formal Model of Business Application Integration from Web Services (Position Paper)
Abstract. Currently there are many service providers on the Web. Industry recognizes that from Web services many different business applications can be quickly created. A Web servi...
Kaiyu Wan, Mubarak Mohammad, Vasu S. Alagar