Sciweavers

1173 search results - page 40 / 235
» On the Compositionality of Round Abstraction
Sort
View
FSE
2000
Springer
96views Cryptology» more  FSE 2000»
14 years 1 months ago
On the Interpolation Attacks on Block Ciphers
Abstract. The complexity of interpolation attacks on block ciphers depends on the degree of the polynomial approximation and or on the number of terms in the polynomial approximati...
Amr M. Youssef, Guang Gong
PKC
2000
Springer
120views Cryptology» more  PKC 2000»
14 years 1 months ago
Optimally Efficient Accountable Time-Stamping
Abstract. Efficient secure time-stamping schemes employ a 2-level approach in which the time-stamping service operates in rounds. We say that a time-stamping service is accountable...
Ahto Buldas, Helger Lipmaa, Berry Schoenmakers
CBSE
2007
Springer
14 years 4 months ago
Soya: A Programming Model and Runtime Environment for Component Composition Using SSDL
Abstract. The SOAP Service Description Language (SSDL) is a SOAPcentric language for describing Web Service contracts. SSDL focuses on abstraction as the building block for creatin...
Patric Fornasier, Jim Webber, Ian Gorton
CCR
2004
147views more  CCR 2004»
13 years 9 months ago
Safe compositional specification of networking systems
The science of network service composition has emerged as one of the grand themes of networking research [17] as a direct result of the complexity and sophistication of emerging n...
Azer Bestavros, Adam Bradley, Assaf J. Kfoury, Ibr...
ARITH
2003
IEEE
14 years 3 months ago
High-Radix Iterative Algorithm for Powering Computation
A high-radix composite algorithm for the computation of the powering function (¤¦¥ ) is presented in this paper. The algorithm consists of a sequence of overlapped operations: ...
José-Alejandro Piñeiro, Milos D. Erc...