Sciweavers

153 search results - page 26 / 31
» Efficient lattice-based signature scheme
Sort
View
JCIT
2010
131views more  JCIT 2010»
13 years 2 months ago
A Secure Routing Protocol for Peer-to-Peer Network
In peer-to-peer networks, it is very difficult to route query successfully, since nodes in the routing path do not always behave according to pre-established routing protocols. To...
Xu Xiang, Jianguo Chen
JSAC
2006
172views more  JSAC 2006»
13 years 7 months ago
A Memory-Efficient Parallel String Matching Architecture for High-Speed Intrusion Detection
The ability to inspect both packet headers and payloads to identify attack signatures makes network intrusion detection system (NIDS) a promising approach to protect Internet syste...
Hongbin Lu, Kai Zheng, Bin Liu, Xin Zhang, Y. Liu
WAIFI
2010
Springer
158views Mathematics» more  WAIFI 2010»
13 years 5 months ago
On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings
Abstract. We focus on the implementation and security aspects of cryptographic protocols that use Type 1 and Type 4 pairings. On the implementation front, we report improved timing...
Sanjit Chatterjee, Darrel Hankerson, Alfred Meneze...
CCS
2008
ACM
13 years 9 months ago
Certificateless signcryption
Certificateless cryptography achieves the best of the two worlds: it inherits from identity-based techniques a solution to the certificate management problem in public-key encrypti...
Manuel Barbosa, Pooya Farshim
ASIACRYPT
2010
Springer
13 years 5 months ago
Constant-Size Commitments to Polynomials and Their Applications
We introduce and formally define polynomial commitment schemes, and provide two efficient constructions. A polynomial commitment scheme allows a committer to commit to a polynomial...
Aniket Kate, Gregory M. Zaverucha, Ian Goldberg