Sciweavers

315 search results - page 53 / 63
» Number Theoretic Attacks on Secure Password Schemes
Sort
View
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz
CCS
2007
ACM
14 years 1 months ago
SecureBus: towards application-transparent trusted computing with mandatory access control
The increasing number of software-based attacks has attracted substantial efforts to prevent applications from malicious interference. For example, Trusted Computing (TC) technolo...
Xinwen Zhang, Michael J. Covington, Songqing Chen,...
WECWIS
1999
IEEE
116views ECommerce» more  WECWIS 1999»
13 years 12 months ago
Towards a Scalable PKI for Electronic Commerce Systems
In an e-commerce system, security, in particular authentication, is of paramount importance. Public-key Infrastructure is often used to enforce authentication and the property of ...
Chenxi Wang, William A. Wulf
PERCOM
2008
ACM
14 years 7 months ago
Towards Robust Low Cost Authentication for Pervasive Devices
Low cost devices such as RFIDs, sensor network nodes, and smartcards are crucial for building the next generation pervasive and ubiquitous networks. The inherent power and footpri...
Erdinç Öztürk, Ghaith Hammouri, B...
ICDCS
2008
IEEE
14 years 2 months ago
Analysis of Maximum Executable Length for Detecting Text-Based Malware
The possibility of using purely text stream (keyboardenterable) as carrier of malware is under-researched and often underestimated. A text attack can happen at multiple levels, fr...
P. Kumar Manna, Sanjay Ranka, Shigang Chen