Sciweavers

1612 search results - page 80 / 323
» About models of security protocols
Sort
View
142
Voted
JUCS
2006
86views more  JUCS 2006»
15 years 3 months ago
Secure Service Discovery based on Trust Management for ad-hoc Networks
Abstract: In ad-hoc networks, mobile devices communicate via wireless links without the aid of any fixed networking infrastructure. These devices must be able to discover services ...
Celeste Campo, Florina Almenárez Mendoza, D...
171
Voted
CSFW
2012
IEEE
13 years 6 months ago
Provably Secure and Practical Onion Routing
The onion routing network Tor is undoubtedly the most widely employed technology for anonymous web access. Although the underlying onion routing (OR) protocol appears satisfactory...
Michael Backes, Ian Goldberg, Aniket Kate, Esfandi...
132
Voted
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 4 months ago
Bounded-concurrent secure multi-party computation with a dishonest majority
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
Rafael Pass
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
15 years 9 months ago
Universally Composable Security with Global Setup
Abstract. Cryptographic protocols are often designed and analyzed under some trusted set-up assumptions, namely in settings where the participants have access to global information...
Ran Canetti, Yevgeniy Dodis, Rafael Pass, Shabsi W...
170
Voted
SCN
2010
Springer
232views Communications» more  SCN 2010»
15 years 1 months ago
Authenticated Key Agreement with Key Re-use in the Short Authenticated Strings Model
Serge Vaudenay [20] introduced a notion of Message Authentication (MA) protocols in the Short Authenticated String (SAS) model. A SAS-MA protocol authenticates arbitrarily long mes...
Stanislaw Jarecki, Nitesh Saxena