Sciweavers

5324 search results - page 1017 / 1065
» Internet Security Protocols
Sort
View
ICISC
2000
126views Cryptology» more  ICISC 2000»
13 years 9 months ago
Cryptographic Applications of Sparse Polynomials over Finite Rings
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...
IANDC
2007
152views more  IANDC 2007»
13 years 7 months ago
The reactive simulatability (RSIM) framework for asynchronous systems
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
Michael Backes, Birgit Pfitzmann, Michael Waidner
TPDS
2008
116views more  TPDS 2008»
13 years 7 months ago
Pseudo Trust: Zero-Knowledge Authentication in Anonymous P2Ps
Most trust models in Peer-to-Peer (P2P) systems are identity based, which means that in order for one peer to trust another, it needs to know the other peer's identity. Hence,...
Li Lu, Jinsong Han, Yunhao Liu, Lei Hu, Jinpeng Hu...
SIGIR
2002
ACM
13 years 7 months ago
Collaborative filtering with privacy via factor analysis
Collaborative filtering (CF) is valuable in e-commerce, and for direct recommendations for music, movies, news etc. But today's systems have several disadvantages, including ...
John F. Canny
JCS
2010
135views more  JCS 2010»
13 years 6 months ago
New filtering approaches for phishing email
Phishing emails usually contain a message from a credible looking source requesting a user to click a link to a website where she/he is asked to enter a password or other confide...
André Bergholz, Jan De Beer, Sebastian Glah...
« Prev « First page 1017 / 1065 Last » Next »