Sciweavers

369 search results - page 58 / 74
» Security Analysis of Several Group Signature Schemes
Sort
View
EUROCRYPT
2000
Springer
15 years 3 months ago
Computing Inverses over a Shared Secret Modulus
We discuss the following problem: Given an integer shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e-1 mod . The most in...
Dario Catalano, Rosario Gennaro, Shai Halevi
WWW
2008
ACM
16 years 13 days ago
A systematic approach for cell-phone worm containment
Cell phones are increasingly becoming attractive targets of various worms, which cause the leakage of user privacy, extra service charges and depletion of battery power. In this w...
Liang Xie, Hui Song, Trent Jaeger, Sencun Zhu
IJBC
2006
93views more  IJBC 2006»
14 years 11 months ago
Some Basic Cryptographic Requirements for Chaos-Based Cryptosystems
In recent years, a large amount of work on chaos-based cryptosystems have been published. However many of the proposed schemes fail to explain or do not possess a number of featur...
Gonzalo Álvarez, Shujun Li
96
Voted
HPCA
2005
IEEE
16 years 4 days ago
Voltage and Frequency Control With Adaptive Reaction Time in Multiple-Clock-Domain Processors
Dynamic voltage and frequency scaling (DVFS) is a widely-used method for energy-efficient computing. In this paper, we present a new intra-task online DVFS scheme for multiple clo...
Qiang Wu, Philo Juang, Margaret Martonosi, Douglas...
CCS
2008
ACM
15 years 1 months ago
Secure neighbor discovery in wireless networks: formal investigation of possibility
Wireless communication enables a broad spectrum of applications, ranging from commodity to tactical systems. Neighbor discovery (ND), that is, determining which devices are within...
Marcin Poturalski, Panos Papadimitratos, Jean-Pier...