Sciweavers

349 search results - page 52 / 70
» Compositional Security for Task-PIOAs
Sort
View
CRYPTO
2000
Springer
110views Cryptology» more  CRYPTO 2000»
15 years 2 months ago
Parallel Reducibility for Information-Theoretically Secure Computation
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
Yevgeniy Dodis, Silvio Micali
EDCC
1994
Springer
15 years 1 months ago
Designing Secure and Reliable Applications using Fragmentation-Redundancy-Scattering: An Object-Oriented Approach
Security and reliability issues in distributed systems have been investigated for several years at LAAS using a technique called Fragmentation-Redundancy-Scattering (FRS). The aim ...
Jean-Charles Fabre, Yves Deswarte, Brian Randell
COLCOM
2008
IEEE
14 years 11 months ago
Mashup Model and Verification Using Mashup Processing Network
Abstract. Mashups are defined to be lightweight Web applications aggregating data from different Web services, built using ad-hoc composition and being not concerned with long term...
Ehtesham Zahoor, Olivier Perrin, Claude Godart
ASE
2005
145views more  ASE 2005»
14 years 9 months ago
Developing Ambient Intelligence Systems: A Solution based on Web Services
Enabling the ambient intelligence vision means that consumers will be provided with universal and immediate access to available content and services, together with ways of effectiv...
Valérie Issarny, Daniele Sacchetti, Ferda T...
ESORICS
2006
Springer
15 years 1 months ago
Conditional Reactive Simulatability
Abstract. Simulatability has established itself as a salient notion for defining and proving the security of cryptographic protocols since it entails strong security and compositio...
Michael Backes, Markus Dürmuth, Dennis Hofhei...