Sciweavers

15 search results - page 2 / 3
» The Unbounded-Error Communication Complexity of Symmetric Fu...
Sort
View
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
13 years 8 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
ASPLOS
2000
ACM
13 years 11 months ago
Architectural Support for Fast Symmetric-Key Cryptography
The emergence of the Internet as a trusted medium for commerce and communication has made cryptography an essential component of modern information systems. Cryptography provides ...
Jerome Burke, John McDonald, Todd M. Austin
COCO
2005
Springer
130views Algorithms» more  COCO 2005»
13 years 8 months ago
Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
Emanuele Viola
GI
2004
Springer
14 years 2 days ago
A Low-Cost Solution for Frequent Symmetric Key Exchange in Ad-hoc Networks
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...
Markus Volkmer, Sebastian Wallner
DEXAW
2005
IEEE
127views Database» more  DEXAW 2005»
14 years 9 days ago
A Key Establishment IP-Core for Ubiquitous Computing
A most critical and complex issue with regard to constrained devices in the ubiquitous and pervasive computing setting is secure key exchange. The restrictions motivate the invest...
Markus Volkmer, Sebastian Wallner