686 search results - page 66 / 138 » Secure Two-Party Computation Is Practical |
CCS
2010
ACM
13 years 10 months ago
2010
ACM
This paper presents the first large-scale study of the success of password expiration in meeting its intended purpose, namely revoking access to an account by an attacker who has ...
ASIACRYPT
2011
Springer
12 years 10 months ago
2011
Springer
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
ACSD
2003
IEEE
14 years 3 months ago
2003
IEEE
Modelling complex concurrent systems is often difficult and error-prone, in particular when new concepts coming from advanced practical applications are considered. These new appl...
WMASH
2003
ACM
14 years 3 months ago
2003
ACM
A serious challenge for seamless roaming between independent wireless LANs (WLANs) is how best to confederate the various WLAN service providers, each having different trust relat...
IJBC
2008
13 years 10 months ago
2008
Abstract-- In this paper, we propose a robust hyperchaotic system that is practically serviceable in digital securecommunication. The system consists of many coupled robust logisti...