Sciweavers

9 search results - page 2 / 2
» Divisibility, Smoothness and Cryptographic Applications
Sort
View
SOSP
2003
ACM
14 years 2 months ago
Implementing an untrusted operating system on trusted hardware
Recently, there has been considerable interest in providing “trusted computing platforms” using hardware — TCPA and Palladium being the most publicly visible examples. In th...
David Lie, Chandramohan A. Thekkath, Mark Horowitz
ARITH
2005
IEEE
13 years 11 months ago
Fast Modular Reduction for Large Wordlengths via One Linear and One Cyclic Convolution
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
Dhananjay S. Phatak, Tom Goff
CCS
2008
ACM
13 years 7 months ago
Efficient attributes for anonymous credentials
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...
Jan Camenisch, Thomas Groß
ICC
2009
IEEE
136views Communications» more  ICC 2009»
13 years 3 months ago
Maximizing the Sum Rate in Symmetric Networks of Interfering Links
We consider the power optimization problem of maximizing the sum rate of a symmetric network of interfering links in Gaussian noise. All transmitters have an average transmit power...
Sibi Raj Bhaskaran, Stephen V. Hanly, Nasreen Badr...