469 search results - page 71 / 94 » On Adversary Models and Compositional Security |
FSTTCS
2003
Springer
14 years 26 days ago
2003
Springer
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...
CTRSA
2006
Springer
13 years 11 months ago
2006
Springer
We construct efficient universally composable oblivious transfer protocols in the multi-party setting for honest majorities. Unlike previous proposals our protocols are designed in...
CISC
2008
Springer
13 years 9 months ago
2008
Springer
The notion of anonymous signatures has recently been formalized by [18], which captures an interesting property that a digital signature can sometimes hide the identity of the sign...
ESORICS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We consider the problem of efficient key management and user revocation in cryptographic file systems that allow shared access to files. A performanceefficient solution t...
WPES
2006
ACM
14 years 1 months ago
2006
ACM
Connections in distributed systems, such as social networks, online communities or peer-to-peer networks, form complex graphs. These graphs are of interest to scientists in field...