Sciweavers

1059 search results - page 71 / 212
» Modeling Security Protocols as Games
Sort
View
ASIACRYPT
1999
Springer
14 years 2 months ago
Approximation Hardness and Secure Communication in Broadcast Channels
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have...
Yvo Desmedt, Yongge Wang
JUCS
2006
86views more  JUCS 2006»
13 years 10 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...
CSFW
2012
IEEE
12 years 13 days 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...
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 10 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»
14 years 4 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...