Sciweavers

290 search results - page 41 / 58
» Pseudorandom Bits for Polynomials
Sort
View
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
14 years 1 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
ASIACRYPT
2009
Springer
14 years 3 months ago
Memory Leakage-Resilient Encryption Based on Physically Unclonable Functions
Abstract. Physical attacks on cryptographic implementations and devices have become crucial. In this context a recent line of research on a new class of side-channel attacks, calle...
Frederik Armknecht, Roel Maes, Ahmad-Reza Sadeghi,...
DATE
2008
IEEE
148views Hardware» more  DATE 2008»
14 years 2 months ago
On Analysis and Synthesis of (n, k)-Non-Linear Feedback Shift Registers
— Non-Linear Feedback Shift Registers (NLFSRs) have been proposed as an alternative to Linear Feedback Shift Registers (LFSRs) for generating pseudo-random sequences for stream c...
Elena Dubrova, Maxim Teslenko, Hannu Tenhunen
ASPLOS
2004
ACM
14 years 1 months ago
An ultra low-power processor for sensor networks
We present a novel processor architecture designed specifically for use in low-power wireless sensor-network nodes. Our sensor network asynchronous processor (SNAP/LE) is based on...
Virantha N. Ekanayake, Clinton Kelly IV, Rajit Man...
CCS
2001
ACM
14 years 3 days ago
Efficient State Updates for Key Management
Encryption is widely used to enforce usage rules for digital content. In many scenarios content is encrypted using a group key which is known to a group of users that are allowed ...
Benny Pinkas