Sciweavers

1656 search results - page 127 / 332
» Secure Computation Without Authentication
Sort
View
PET
2010
Springer
14 years 2 months ago
Making a Nymbler Nymble Using VERBS
In this work, we propose a new platform to enable service providers, such as web site operators, on the Internet to block past abusive users of anonymizing networks (for example, T...
Ryan Henry, Kevin Henry, Ian Goldberg
ASIACRYPT
2006
Springer
14 years 2 months ago
A Scalable Password-Based Group Key Exchange Protocol in the Standard Model
This paper presents a secure constant-round password-based group key exchange protocol in the common reference string model. Our protocol is based on the group key exchange protoco...
Michel Abdalla, David Pointcheval
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
14 years 4 months ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
INFOCOM
2008
IEEE
14 years 5 months ago
A Security Architecture Achieving Anonymity and Traceability in Wireless Mesh Networks
—Anonymity has received increasing attention in the literature due to the users’ awareness of their privacy nowadays. Anonymity provides protection for users to enjoy network s...
Jinyuan Sun, Chi Zhang, Yuguang Fang
SP
1998
IEEE
116views Security Privacy» more  SP 1998»
14 years 2 months ago
Strand Spaces: Why is a Security Protocol Correct?
A strand is a sequence of events; it represents either the execution of legitimate party in a security protocol or else a sequence of actions by a penetrator. A strand space is a ...
F. Javier Thayer, Jonathan C. Herzog, Joshua D. Gu...