Sciweavers

104 search results - page 9 / 21
» A secret sharing scheme based on cellular automata
Sort
View
WADS
2007
Springer
130views Algorithms» more  WADS 2007»
14 years 3 months ago
Approximating the Maximum Sharing Problem
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
Amitabh Chaudhary, Danny Z. Chen, Rudolf Fleischer...
GLOBECOM
2006
IEEE
14 years 3 months ago
Symmetric Rate Capacity of Cellular Systems with Cooperative Base Stations
— Cooperation among base stations has demonstrated substantial capacity gain in cellular systems. The optimal transmission scheme under full base station cooperation requires all...
Yifan Liang, Andrea J. Goldsmith
GLOBECOM
2006
IEEE
14 years 3 months ago
User-Aided Adaptive TDMA for Real-Time Services in an OFDM Based Cellular System
—In this paper, a user-aided adaptive TDMA (UAAT) algorithm is developed for real-time services to improve the system efficiency of OFDM based cellular networks. In the UAAT sche...
Changqin Huo, Abu B. Sesay, Abraham O. Fapojuwo
CCS
2004
ACM
14 years 3 months ago
Concealing complex policies with hidden credentials
Hidden credentials are useful in protecting sensitive resource requests, resources, policies, and credentials. We propose a significant performance improvement when implementing ...
Robert W. Bradshaw, Jason E. Holt, Kent E. Seamons
IJNSEC
2011
78views more  IJNSEC 2011»
13 years 4 months ago
Multi-authority Electronic Voting Scheme Based on Elliptic Curves
In this paper, a new multi authority electronic voting scheme based on elliptic curves is proposed. According to the proposed scheme, each voter casts the vote as a point on the e...
Chinniah Porkodi, Ramalingam Arumuganathan, Krishn...