Sciweavers

5484 search results - page 1079 / 1097
» Almost-Everywhere Secure Computation
Sort
View
FCCM
2005
IEEE
132views VLSI» more  FCCM 2005»
15 years 5 months ago
Hardware Factorization Based on Elliptic Curve Method
The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best known method for factorization large integers is ...
Martin Simka, Jan Pelzl, Thorsten Kleinjung, Jens ...
ISCA
2005
IEEE
134views Hardware» more  ISCA 2005»
15 years 5 months ago
A High Throughput String Matching Architecture for Intrusion Detection and Prevention
Network Intrusion Detection and Prevention Systems have emerged as one of the most effective ways of providing security to those connected to the network, and at the heart of alm...
Lin Tan, Timothy Sherwood
TRIDENTCOM
2005
IEEE
15 years 5 months ago
TBI: End-to-End Network Performance Measurement Testbed for Empirical Bottleneck Detection
— Recent advances in networking include new bandwidth-intensive applications, sophisticated protocols that enable real-time data and multimedia delivery and aspects of network se...
Prasad Calyam, Dima Krymskiy, Mukundan Sridharan, ...
ANCS
2005
ACM
15 years 5 months ago
Fast and scalable pattern matching for content filtering
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packe...
Sarang Dharmapurikar, John W. Lockwood
WPES
2005
ACM
15 years 5 months ago
The privacy cost of the second-chance offer
This paper examines a generalization of a two-stage game common on eBay: an ascending-price auction followed by price discrimination (the second chance offer). High bids in the a...
Sumit Joshi, Yu-An Sun, Poorvi L. Vora
« Prev « First page 1079 / 1097 Last » Next »