Sciweavers

144 search results - page 10 / 29
» Signature Schemes Based on Two Hard Problems Simultaneously
Sort
View
ACISP
2000
Springer
13 years 12 months ago
An Extremely Small and Efficient Identification Scheme
We present a new identification scheme which is based on Legendre symbols modulo a certain hidden prime and which is naturally suited for low power, low memory applications. 1 Ove...
William D. Banks, Daniel Lieman, Igor Shparlinski
GLOBECOM
2010
IEEE
13 years 4 months ago
Filter-and-Forward Distributed Beamforming for Two-Way Relay Networks with Frequency Selective Channels
Abstract-- A new approach to distributed cooperative beamforming in two-way half-duplex relay networks with frequency selective channels is proposed. In our scheme, two transceiver...
Haihua Chen, Alex B. Gershman, Shahram Shahbazpana...
SIGCOMM
2010
ACM
13 years 7 months ago
NetShield: massive semantics-based vulnerability signature matching for high-speed networks
Accuracy and speed are the two most important metrics for Network Intrusion Detection/Prevention Systems (NIDS/NIPSes). Due to emerging polymorphic attacks and the fact that in ma...
Zhichun Li, Gao Xia, Hongyu Gao, Yi Tang, Yan Chen...
TIFS
2010
186views more  TIFS 2010»
13 years 5 months ago
An abuse-free fair contract-signing protocol based on the RSA signature
A fair contract signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in a f...
Guilin Wang
WWW
2005
ACM
14 years 8 months ago
An abuse-free fair contract signing protocol based on the RSA signature
A fair contract signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in a f...
Guilin Wang