Sciweavers

349 search results - page 49 / 70
» Compositional Security for Task-PIOAs
Sort
View
EUROCRYPT
2010
Springer
15 years 2 months ago
Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks
Imagine many small devices send data to a single receiver, encrypted using the receiver’s public key. Assume an adversary that has the power to adaptively corrupt a subset of the...
Serge Fehr, Dennis Hofheinz, Eike Kiltz, Hoeteck W...
76
Voted
CSFW
2008
IEEE
15 years 4 months ago
Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation
Composition theorems in simulation-based approaches allow to build complex protocols from sub-protocols in a modular way. However, as first pointed out and studied by Canetti and ...
Ralf Küsters, Max Tuengerthal
EEE
2005
IEEE
15 years 3 months ago
On Comprehensive Contractual Descriptions of Web Services
Comprehensive contractual description of Web Services and Web Service compositions is needed for selection of appropriate Web Services and their service and quality of service (Qo...
Vladimir Tosic, Bernard Pagurek
81
Voted
WWW
2003
ACM
15 years 10 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
64
Voted
EUROCRYPT
2006
Springer
15 years 1 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