Sciweavers

1294 search results - page 251 / 259
» Securing Against Insider Attacks
Sort
View
ACNS
2006
Springer
86views Cryptology» more  ACNS 2006»
13 years 11 months ago
Efficient Memory Bound Puzzles Using Pattern Databases
CPU bound client puzzles have been suggested as a defense mechanism against connection depletion attacks. However, the wide disparity in CPU speeds prevents such puzzles from being...
Sujata Doshi, Fabian Monrose, Aviel D. Rubin
CRYPTO
2006
Springer
107views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Cryptanalysis of 2R- Schemes
Abstract. In this paper, we study the security of 2Rschemes [17,18], which are the "minus variant" of two-round schemes. This variant consists in removing some of the n p...
Jean-Charles Faugère, Ludovic Perret
CHES
2010
Springer
189views Cryptology» more  CHES 2010»
13 years 8 months ago
Quark: A Lightweight Hash
The need for lightweight (that is, compact, low-power, low-energy) cryptographic hash functions has been repeatedly expressed by application designers, notably for implementing RFI...
Jean-Philippe Aumasson, Luca Henzen, Willi Meier, ...
IPL
2008
72views more  IPL 2008»
13 years 7 months ago
Reducing communication costs in robust peer-to-peer networks
Several recent research results describe how to design Distributed Hash Tables (DHTs) that are robust to adversarial attack via Byzantine faults. Unfortunately, all of these resul...
Jared Saia, Maxwell Young
IJNSEC
2006
113views more  IJNSEC 2006»
13 years 7 months ago
An Identity-based Mediated Signature Scheme from Bilinear Pairing
It has always been a critical issue to find efficient methods for fast revocation of a user's identity in identity (ID)based cryptosystems. Unfortunately, none of the previou...
Xiangguo Cheng, Lifeng Guo, Xinmei Wang