Sciweavers

757 search results - page 125 / 152
» How secure are secure interdomain routing protocols
Sort
View
TCC
2009
Springer
177views Cryptology» more  TCC 2009»
14 years 8 months ago
Composability and On-Line Deniability of Authentication
Abstract. Protocols for deniable authentication achieve seemingly paradoxical guarantees: upon completion of the protocol the receiver is convinced that the sender authenticated th...
Yevgeniy Dodis, Jonathan Katz, Adam Smith, Shabsi ...
USS
2010
13 years 5 months ago
Realization of RF Distance Bounding
One of the main obstacles for the wider deployment of radio (RF) distance bounding is the lack of platforms that implement these protocols. We address this problem and we build a ...
Kasper Bonne Rasmussen, Srdjan Capkun
PERCOM
2004
ACM
14 years 7 months ago
One-Time Capabilities for Authorizations without Trust
This paper introduces and solves a security problem of pervasive computing: how to define authorizations for offline interactions when trust relationships among entities do not ex...
Laurent Bussard, Refik Molva
CORR
2011
Springer
187views Education» more  CORR 2011»
13 years 2 months ago
Failure of A Mix Network
A mix network by Wikstrom fails in correctness, provable privacy and soundness. Its claimed advantages in security and efficiency are compromised. The analysis in this paper illus...
Kun Peng
USS
2010
13 years 5 months ago
SEPIA: Privacy-Preserving Aggregation of Multi-Domain Network Events and Statistics
Secure multiparty computation (MPC) allows joint privacy-preserving computations on data of multiple parties. Although MPC has been studied substantially, building solutions that ...
Martin Burkhart, Mario Strasser, Dilip Many, Xenof...