Sciweavers

3504 search results - page 371 / 701
» Secure protocol composition
Sort
View
WWW
2003
ACM
16 years 7 months ago
A Web Service Market Model based on Dependencies
The construction of composite Web Services from service fragments requires semantic descriptions of service offers and service requests. We propose the use of dependencies as a mo...
Robert Tolksdorf, Christian Bizer, Ralf Heese
EUROCRYPT
2006
Springer
15 years 10 months ago
VSH, an Efficient and Provable Collision-Resistant Hash Function
Abstract. We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of ver...
Scott Contini, Arjen K. Lenstra, Ron Steinfeld
ACNS
2007
Springer
112views Cryptology» more  ACNS 2007»
16 years 26 days ago
A New Protocol for Conditional Disclosure of Secrets and Its Applications
Many protocols that are based on homomorphic encryption are private only if a client submits inputs from a limited range S. Conditional disclosure of secrets (CDS) helps to overcom...
Sven Laur, Helger Lipmaa
NDSS
1998
IEEE
15 years 11 months ago
Efficient Protocols for Signing Routing Messages
In this work, we aim to reduce the computational costs of using public-key digital signatures in securing routing protocols. Two protocols (COSP and IOSP) using one-time digitalsi...
Kan Zhang
ICISC
2008
123views Cryptology» more  ICISC 2008»
15 years 8 months ago
The Swiss-Knife RFID Distance Bounding Protocol
Relay attacks are one of the most challenging threats RFID will have to face in the close future. They consist in making the verifier believe that the prover is in its close vicini...
Chong Hee Kim, Gildas Avoine, François Koeu...