Sciweavers

144 search results - page 16 / 29
» Signature Schemes Based on Two Hard Problems Simultaneously
Sort
View
CCS
2008
ACM
13 years 9 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
AINA
2006
IEEE
14 years 1 months ago
Efficient Packet Matching for Gigabit Network Intrusion Detection using TCAMs
Ternary content-addressable memories (TCAMs) have gained wide acceptance in the industry for storing and searching patterns in routers. But two important problems block the way to...
Ming Gao, Kenong Zhang, Jiahua Lu
IMC
2004
ACM
14 years 1 months ago
On scalable attack detection in the network
Current intrusion detection and prevention systems seek to detect a wide class of network intrusions (e.g., DoS attacks, worms, port scans) at network vantage points. Unfortunatel...
Ramana Rao Kompella, Sumeet Singh, George Varghese
ASIACRYPT
2010
Springer
13 years 5 months ago
Faster Fully Homomorphic Encryption
Abstract. We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardn...
Damien Stehlé, Ron Steinfeld
EUROCRYPT
1999
Springer
13 years 12 months ago
On the Performance of Hyperelliptic Cryptosystems
In this paper we discuss various aspects of cryptosystems based on hyperelliptic curves. In particular we cover the implementation of the group law on such curves and how to genera...
Nigel P. Smart