Sciweavers

197 search results - page 38 / 40
» Feasibility of Multi-Protocol Attacks
Sort
View
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,...
ASPLOS
2006
ACM
14 years 1 months ago
Temporal search: detecting hidden malware timebombs with virtual machines
Worms, viruses, and other malware can be ticking bombs counting down to a specific time, when they might, for example, delete files or download new instructions from a public we...
Jedidiah R. Crandall, Gary Wassermann, Daniela A. ...
CCS
2005
ACM
14 years 25 days ago
Tracking anonymous peer-to-peer VoIP calls on the internet
Peer-to-peer VoIP calls are becoming increasingly popular due to their advantages in cost and convenience. When these calls are encrypted from end to end and anonymized by low lat...
Xinyuan Wang, Shiping Chen, Sushil Jajodia
CIKM
2005
Springer
14 years 25 days ago
MailRank: using ranking for spam detection
Can we use social networks to combat spam? This paper investigates the feasibility of MailRank, a new email ranking and classification scheme exploiting the social communication ...
Paul-Alexandru Chirita, Jörg Diederich, Wolfg...
CRYPTO
2005
Springer
125views Cryptology» more  CRYPTO 2005»
14 years 25 days ago
Secure Computation Without Authentication
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...
Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pa...