Sciweavers

1058 search results - page 186 / 212
» Secure Group Communications Using Key Graphs
Sort
View
TIT
2010
160views Education» more  TIT 2010»
14 years 4 months ago
Parameterized splitting systems for the discrete logarithm
Hoffstein and Silverman suggested the use of low Hamming weight product (LHWP) exponents to accelerate group exponentiation while maintaining the security level. With LHWP exponent...
Sungwook Kim, Jung Hee Cheon
EUROCRYPT
1999
Springer
15 years 2 months ago
Distributed Pseudo-random Functions and KDCs
Abstract. This work describes schemes for distributing between n servers the evaluation of a function f which is an approximation to a random function, such that only authorized su...
Moni Naor, Benny Pinkas, Omer Reingold
TDP
2010
140views more  TDP 2010»
14 years 4 months ago
Movement Data Anonymity through Generalization
In recent years, spatio-temporal and moving objects databases have gained considerable interest, due to the diffusion of mobile devices (e.g., mobile phones, RFID devices and GPS ...
Anna Monreale, Gennady L. Andrienko, Natalia V. An...
SOCIALCOM
2010
14 years 7 months ago
The Dynamics of Two Cognitive Heuristics for Coordination on Networks
Abstract--This paper is about how groups solve global coordination problems such as the distributed graph coloring problem. We focused on scenarios in which agents are not able to ...
Iyad Rahwan, Fatemeh Jahedpari, Sherief Abdallah
EUROCAST
2007
Springer
159views Hardware» more  EUROCAST 2007»
15 years 1 months ago
Ant Colony Optimization for Model Checking
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...
Enrique Alba, J. Francisco Chicano