Sciweavers

401 search results - page 65 / 81
» Delegatable Functional Signatures
Sort
View
TCC
2007
Springer
116views Cryptology» more  TCC 2007»
16 years 29 days ago
Long-Term Security and Universal Composability
Abstract. Algorithmic progress and future technology threaten today’s cryptographic protocols. Long-term secure protocols should not even in future reveal more information to a...
Jörn Müller-Quade, Dominique Unruh
QSIC
2005
IEEE
16 years 12 days ago
Runtime Validation of Behavioural Contracts for Component Software
In component software, the independence of components is achieved by separating their interfaces from implementations. The interface definition of a component serves as the contr...
Yan Jin, Jun Han
STEP
2005
IEEE
16 years 12 days ago
Elemental Design Patterns Recognition In Java
The decomposition of design patterns into simpler elements may reduce significantly the creation of variants in forward engineering, while it increases the possibility of identify...
Francesca Arcelli Fontana, Stefano Masiero, Claudi...
ICCBSS
2005
Springer
16 years 11 days ago
Specifying Interaction Constraints of Software Components for Better Understandability and Interoperability
A vital issue in the correct use of commercial-off-the-shelf (COTS) components is the proper understanding of their functionality, quality attributes and ways of operation. Traditi...
Yan Jin, Jun Han
PKC
2005
Springer
110views Cryptology» more  PKC 2005»
16 years 10 days ago
From Fixed-Length to Arbitrary-Length RSA Encoding Schemes Revisited
To sign with RSA, one usually encodes the message m as µ(m) and then raises the result to the private exponent modulo N. In Asiacrypt 2000, Coron et al. showed how to build a secu...
Julien Cathalo, Jean-Sébastien Coron, David...