Sciweavers

2601 search results - page 202 / 521
» Secure Rewarding Schemes
Sort
View
139
Voted
IACR
2011
129views more  IACR 2011»
14 years 3 months ago
Bounded Vector Signatures and their Applications
Although malleability is undesirable in traditional digital signatures, schemes with limited malleability properties enable interesting functionalities that may be impossible to o...
Lei Wei, Scott E. Coull, Michael K. Reiter
137
Voted
CCS
2005
ACM
15 years 9 months ago
Direct chosen ciphertext security from identity-based techniques
We describe a new encryption technique that is secure in the standard model against adaptive chosen ciphertext (CCA2) attacks. We base our method on two very efficient Identity-Ba...
Xavier Boyen, Qixiang Mei, Brent Waters
CCS
2009
ACM
16 years 4 months ago
A generic construction of useful client puzzles
Denial of Service (DoS) attacks are serious threats for network societies. For dealing with DoS attacks, Jakobsson and Juels first proposed the notion of useful client puzzles (UC...
Rui Zhang 0002, Goichiro Hanaoka, Hideki Imai
119
Voted
CN
2007
80views more  CN 2007»
15 years 3 months ago
A queueing analysis for the denial of service (DoS) attacks in computer networks
In most network security analysis, researchers mainly focus on qualitative studies on security schemes and possible attacks, and there are few papers on quantitative analysis in t...
Yang Wang, Chuang Lin, Quan-Lin Li, Yuguang Fang
141
Voted
ET
2010
89views more  ET 2010»
15 years 2 months ago
On the Duality of Probing and Fault Attacks
In this work we investigate the problem of simultaneous privacy and integrity protection in cryptographic circuits. We consider a white-box scenario with a powerful, yet limited at...
Berndt M. Gammel, Stefan Mangard