Sciweavers

3751 search results - page 172 / 751
» Events in security protocols
Sort
View
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...
ASIACRYPT
2001
Springer
15 years 8 months ago
Unbelievable Security. Matching AES Security Using Public Key Systems
The Advanced Encryption Standard (AES) provides three levels of security: 128, 192, and 256 bits. Given a desired level of security for the AES, this paper discusses matching publi...
Arjen K. Lenstra
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
15 years 8 months ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
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 10 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...