Sciweavers

5476 search results - page 370 / 1096
» Resettably Secure Computation
Sort
View
AFRICACRYPT
2010
Springer
16 years 1 months ago
Avoiding Full Extension Field Arithmetic in Pairing Computations
Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...
Craig Costello, Colin Boyd, Juan Manuel Gonz&aacut...
CRYPTO
2009
Springer
121views Cryptology» more  CRYPTO 2009»
16 years 1 months ago
Collusion-Free Multiparty Computation in the Mediated Model
Collusion-free protocols prevent subliminal communication (i.e., covert channels) between parties running the protocol. In the standard communication model, if one-way functions ex...
Joël Alwen, Jonathan Katz, Yehuda Lindell, Gi...
FC
2007
Springer
117views Cryptology» more  FC 2007»
16 years 1 months ago
Using a Personal Device to Strengthen Password Authentication from an Untrusted Computer
Keylogging and phishing attacks can extract user identity and sensitive account information for unauthorized access to users’ financial accounts. Most existing or proposed solut...
Mohammad Mannan, Paul C. van Oorschot
MSWIM
2006
ACM
16 years 26 days ago
Performance modeling of critical event management for ubiquitous computing applications
A generic theoretical framework for managing critical events in ubiquitous computing systems is presented. The main idea is to automatically respond to occurrences of critical eve...
Tridib Mukherjee, Krishna M. Venkatasubramanian, S...
COMPSAC
2009
IEEE
16 years 1 months ago
Towards Validating Security Protocol Deployment in the Wild
As computing technology becomes increasingly pervasive and interconnected, mobility leads to shorter-lasting relationships between end-points with many different security requirem...
Luca Compagna, Ulrich Flegel, Volkmar Lotz