Sciweavers

91 search results - page 11 / 19
» Bounded Key-Dependent Message Security
Sort
View
CADE
2008
Springer
14 years 7 months ago
Proving Group Protocols Secure Against Eavesdroppers
Security protocols are small programs designed to ensure properties such as secrecy of messages or authentication of parties in a hostile environment. In this paper we investigate ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen
EUROCRYPT
2003
Springer
14 years 20 days ago
New Bounds in Secret-Key Agreement: The Gap between Formation and Secrecy Extraction
Perfectly secret message transmission can be realized with only partially secret and weakly correlated information shared by the parties as soon as this information allows for the ...
Renato Renner, Stefan Wolf
CSFW
2007
IEEE
14 years 1 months ago
The Insecurity Problem: Tackling Unbounded Data
In this paper we focus on tackling the insecurity problem of security protocols in the presence of an unbounded number of data such as nonces or session keys. First, we pinpoint f...
Sibylle B. Fröschle
TCC
2005
Springer
118views Cryptology» more  TCC 2005»
14 years 28 days ago
On the Relationships Between Notions of Simulation-Based Security
Several compositional forms of simulation-based security have been proposed in the literature, including universal composability, black-box simulatability, and variants thereof. Th...
Anupam Datta, Ralf Küsters, John C. Mitchell,...
CSREASAM
2003
13 years 8 months ago
Developing Secure Web Services for Computational Portals
Computational web portals provide uniform access to remote computational resources--hardware, software, and data--by hiding the complexity of the heterogeneous, distributed, high ...
Choon-Han Youn, Marlon E. Pierce, Geoffrey Fox