Sciweavers

349 search results - page 44 / 70
» Compositional Security for Task-PIOAs
Sort
View
46
Voted
SIGSOFT
2003
ACM
15 years 10 months ago
Policy-enforced linking of untrusted components
d Abstract) Eunyoung Lee Andrew W. Appel Department of Computer Science Princeton University {elee,appel}@cs.princeton.edu Categories and Subject Descriptors D.2.4 [Software Engine...
Eunyoung Lee, Andrew W. Appel
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
15 years 10 months ago
Universally composable two-party and multi-party secure computation
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Ami...
MIDDLEWARE
2007
Springer
15 years 3 months ago
A service-oriented virtual community overlay network for secure external service orchestration
The Service Oriented Architecture (SOA) is used extensively in ubiquitous computing environments. Using external service orchestration, services can be composed into applications....
Shudong Chen, Johan J. Lukkien
EDO
2005
Springer
15 years 3 months ago
Secure event types in content-based, multi-domain publish/subscribe systems
Publish/subscribe research has so far been mostly focused on efficient event routing, event filtering, and composite event detection. The little research that has been published ...
Lauri I. W. Pesonen, Jean Bacon
FSTTCS
2003
Springer
15 years 2 months ago
A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol
We prove the Needham-Schroeder-Lowe public-key protocol secure under real, active cryptographic attacks including concurrent protocol runs. This proof is based on an abstract crypt...
Michael Backes, Birgit Pfitzmann