Sciweavers

902 search results - page 82 / 181
» Security and Trust Requirements Engineering
Sort
View
EUROCRYPT
2007
Springer
15 years 4 months ago
Universally Composable Multi-party Computation Using Tamper-Proof Hardware
Protocols proven secure within the universal composability (UC) framework satisfy strong and desirable security properties. Unfortunately, it is known that within the “plain” m...
Jonathan Katz
JOC
2008
86views more  JOC 2008»
14 years 9 months ago
Lower Bounds and Impossibility Results for Concurrent Self Composition
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
Yehuda Lindell
SWS
2005
ACM
15 years 3 months ago
Web services enterprise security architecture: a case study
Web Services (WS hereafter) Security is a crucial aspect for technologies based on this paradigm to be completely adopted by the industry. As a consequence, a lot of initiatives h...
Carlos Gutiérrez, Eduardo Fernández-...
ESORICS
2010
Springer
14 years 11 months ago
Optimistic Fair Exchange with Multiple Arbiters
Fair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchang...
Alptekin Küpçü, Anna Lysyanskaya
CBSE
2011
Springer
13 years 9 months ago
Automating information flow control in component-based distributed systems
Automating the construction of secure distributed systems becomes necessary. Indeed, developing security code requires a deep expertise and verifying that the developed code respe...
Takoua Abdellatif, Lilia Sfaxi, Riadh Robbana, Yas...