Sciweavers

402 search results - page 79 / 81
» Cryptosystems using Linear Groups
Sort
View
SIGSOFT
2007
ACM
14 years 10 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
CRYPTO
2009
Springer
172views Cryptology» more  CRYPTO 2009»
14 years 4 months ago
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
We present a new methodology for proving security of encryption systems using what we call Dual System Encryption. Our techniques result in fully secure Identity-Based Encryption ...
Brent Waters
IPPS
2006
IEEE
14 years 3 months ago
k-anycast routing schemes for mobile ad hoc networks
— Anycast is a communication paradigm that was first introduced to the suit of routing protocols in IPv6 networks. In anycast, a packet is intended to be delivered to one of the...
Bing Wu, Jie Wu
CVPR
1996
IEEE
14 years 1 months ago
Extracting Salient Curves from Images: An Analysis of the Saliency Network
The Saliency Network proposed by Shashua and Ullman (1988) is a well-known approach to the problem of extracting salient curves from images while performing gap completion. This pa...
T. D. Alter, Ronen Basri
IDMS
2000
Springer
128views Multimedia» more  IDMS 2000»
14 years 1 months ago
Fast and Optimal Multicast-Server Selection Based on Receivers' Preference
Abstract. In this paper, we propose static and dynamic server selection techniques for multicast receivers who receive multiple streams from replicated servers. In the proposed sta...
Akihito Hiromori, Hirozumi Yamaguchi, Keiichi Yasu...