Sciweavers

469 search results - page 7 / 94
» On Adversary Models and Compositional Security
Sort
View
SP
2006
IEEE
136views Security Privacy» more  SP 2006»
14 years 1 months ago
Simulatable Security and Polynomially Bounded Concurrent Composability
Simulatable security is a security notion for multi-party protocols that implies strong composability features. The main definitional flavours of simulatable security are standa...
Dennis Hofheinz, Dominique Unruh
CANS
2007
Springer
150views Cryptology» more  CANS 2007»
14 years 1 months ago
Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary
Abstract. In this paper we study Perfectly Secure Message Transmission (PSMT) between a sender S and a receiver R, connected in a directed synchronous network through multiple para...
Arpita Patra, Bhavani Shankar, Ashish Choudhary, K...
APSEC
2006
IEEE
14 years 1 months ago
Security-Oriented Service Composition and Evolution
This paper introduces a framework for security-oriented software service composition and evolution. Key building blocks of the framework are a semantic model for specifying the se...
Jun Han, Khaled M. Khan
CTRSA
2009
Springer
179views Cryptology» more  CTRSA 2009»
14 years 2 months ago
Adaptively Secure Two-Party Computation with Erasures
In the setting of multiparty computation a set of parties with private inputs wish to compute some joint function of their inputs, whilst preserving certain security properties (l...
Andrew Y. Lindell
JOC
2000
95views more  JOC 2000»
13 years 7 months ago
Player Simulation and General Adversary Structures in Perfect Multiparty Computation
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
Martin Hirt, Ueli M. Maurer