Sciweavers

588 search results - page 32 / 118
» Reducibility and Completeness in Private Computations
Sort
View
CORR
2008
Springer
166views Education» more  CORR 2008»
13 years 10 months ago
Information-Theoretically Secure Voting Without an Honest Majority
We present three voting protocols with unconditional privacy and information-theoretic correctness, without assuming any bound on the number of corrupt voters or voting authorities...
Anne Broadbent, Alain Tapp

Presentation
609views
15 years 9 months ago
Bus transit service planning and operations in a competitive environment
Transit services are currently facing several challenges in the United States and around the world. For many reasons, among which the fluctuations in gas prices and the state of t...
A. M. El-Geneidy, J. Hourdos, J. Horning
ORL
2002
78views more  ORL 2002»
13 years 10 months ago
Waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic service times: D-MAP/D
We derive the waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic (or constant) service times. We show that the procedure for...
Mohan L. Chaudhry, Bong K. Yoon, Kyung C. Chae
IPPS
2005
IEEE
14 years 4 months ago
Energy-Aware Task Scheduling: Towards Enabling Mobile Computing over MANETs
Enabling high performance, persistent mobile computing has recently become a very active research area. The widespread popularity of mobile computing devices, such as laptops, han...
Waleed Alsalih, Selim G. Akl, Hossam S. Hassanein
ICALP
2010
Springer
14 years 9 days ago
From Secrecy to Soundness: Efficient Verification via Secure Computation
d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz