| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 39
reviews
|
|
|
 |
|
|
|
|
Provably-secure time-bound hierarchical key assignment schemes
Ateniese G., De Santis A., Ferrara A., Masucci B. Journal of Cryptology 25(2): 243-270, 2012. Type: Article
A hierarchical key assignment scheme is an algorithm for assigning cryptographic keys to users. Consider a set of users that needs to communicate securely. Using the assigned secret key and public information, a user should be able to ...
|
Oct 1 2012 |
|
|
|
|
|
|
Evaluation of dynamic channel and power assignment for cognitive networks
Deaton J., Ahmad S., Shukla U., Irwin R., DaSilva L., MacKenzie A. Wireless Personal Communications: An International Journal 62(2): 277-290, 2012. Type: Article
The dynamic channel and power assignment (DCPA) problem is formulated as a nonlinear optimization problem. Given a set L of communication links and a set C of frequency channels, the DCPA problem s...
|
Jul 17 2012 |
|
|
|
|
|
|
Idempotence is not a medical condition
Helland P. Communications of the ACM 55(5): 56-65, 2012. Type: Article
The title of this article is a play on words: idempotence is not impotence. The article sketches what can go wrong with messages used to coordinate work done in a distributed computing environment. Such messages may be broken into piec...
|
Jun 12 2012 |
|
|
|
|
|
|
Adaptive cryptographic access control
Kayem A., Akl S., Martin P., Springer Publishing Company, Incorporated, New York, NY, 2010. 138 pp. Type: Book (978-1-441966-54-4)
Data encryption--the main technique used to control access to data--is the subject of this book. Two assumptions underlie the presented algorithms: users are divided into groups (hierarchies) based on the portion of t...
|
Feb 10 2012 |
|
|
|
|
|
|
Improving IPS by network processors
Cascón P., Ortega J., Luo Y., Murray E., Díaz A., Rojas I. The Journal of Supercomputing 57(1): 99-108, 2011. Type: Article
The theme of this brief paper is the improvement of network throughput by offloading security protection logic to processors embedded in network interface cards (NICs). In particular, the authors have implemented an intrusion preventio...
|
Sep 27 2011 |
|
|
|
|
|
|
Finding frequent items over sliding windows with constant update time
Hung R., Lee L., Ting H. Information Processing Letters 110(7): 257-260, 2010. Type: Article
The authors present an algorithm for estimating the frequent items that occur in a sliding window of a data stream. If the window size is N data stream symbols, &thgr; is a user-defined threshold, and &egr; i...
|
Mar 17 2011 |
|
|
|
|
|
|
2PASS: bandwidth-optimized location cloaking for anonymous location-based services
Hu H., Xu J. IEEE Transactions on Parallel and Distributed Systems 21(10): 1458-1472, 2010. Type: Article
One favorite use of modern mobile phones is finding the nearest place to buy something. Such a place is called an object. If the processing of this type of request is to be done at the server, information about the mobile phoneR...
|
Jan 31 2011 |
|
|
|
|
|
|
A conceptual model for attribute aggregation
Chadwick D., Inman G., Klingenstein N. Future Generation Computer Systems 26(7): 1043-1052, 2010. Type: Article
When a user logs onto a service provider, there is usually only one identity provider. In this paper, the authors discuss the situation where there are multiple identity providers, and attributes from these identity providers need to b...
|
Nov 24 2010 |
|
|
|
|
|
|
Algorithmic cryptanalysis
Joux A., Chapman & Hall/CRC, Boca Raton, FL, 2009. 519 pp. Type: Book (978-1-420070-02-6), Reviews: (2 of 2)
The idea for this book stemmed from a master’s-level course at the University of Versailles. The book’s goals, as listed by author, are to serve as a basis for undergraduate- and graduate-level courses, and to serve...
|
Jun 8 2010 |
|
|
|
|
|
|
Alternation as a programming paradigm
Dvořák W., Gottlob G., Pichler R., Woltran S. PPDP 2009 (Proceedings of the 11th ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, Coimbra, Portugal, Sep 7-9, 2009) 61-72, 2009. Type: Proceedings
Many practical programming problems can be expressed in terms of alternation--sequences of “there exists” and “for all” statements. Examples of such problems are Horn problems, two-playe...
|
May 11 2010 |
|
|
|
|
|
| |
|
|
| |
|
|
