Sciweavers

849 search results - page 37 / 170
» Secure Applications of Low-Entropy Keys
Sort
View
CCS
2008
ACM
13 years 12 months ago
Efficient security primitives derived from a secure aggregation algorithm
By functionally decomposing a specific algorithm (the hierarchical secure aggregation algorithm of Chan et al. [3] and Frikken et al. [7]), we uncover a useful general functionali...
Haowen Chan, Adrian Perrig
SCN
2010
Springer
163views Communications» more  SCN 2010»
13 years 7 months ago
Time-Specific Encryption
This paper introduces and explores the new concept of Time-Specific Encryption (TSE). In (Plain) TSE, a Time Server broadcasts a key at the beginning of each time unit, a Time Inst...
Kenneth G. Paterson, Elizabeth A. Quaglia
HICSS
2002
IEEE
130views Biometrics» more  HICSS 2002»
14 years 2 months ago
Experiences of Using a Public Key Infrastructure to Access Patient Confidential Data over the Internet
A project to enable health care professionals (GPs, practice nurses and diabetes nurse specialists) to access, via the Internet, confidential patient data held on a secondary care...
David W. Chadwick, Carmen Carroll, S. Harvey, John...
ICC
2008
IEEE
141views Communications» more  ICC 2008»
14 years 4 months ago
Secure Group-Based Information Sharing in Mobile Ad Hoc Networks
Abstract—Secure multicast has become an important component of many applications in wireless networks. In this paper, we investigate secure intra and inter group information shar...
Weichao Wang, Yu Wang 0003
CANS
2011
Springer
258views Cryptology» more  CANS 2011»
12 years 10 months ago
Fast Computation on Encrypted Polynomials and Applications
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
Payman Mohassel