Sciweavers

619 search results - page 47 / 124
» Learning with Security
Sort
View
PET
2005
Springer
14 years 1 months ago
An Analysis of Parallel Mixing with Attacker-Controlled Inputs
Parallel mixing [7] is a technique for optimizing the latency of a synchronous re-encryption mix network. We analyze the anonymity of this technique when an adversary can learn the...
Nikita Borisov
ALT
2010
Springer
13 years 9 months ago
Optimal Online Prediction in Adversarial Environments
: In many prediction problems, including those that arise in computer security and computational finance, the process generating the data is best modeled as an adversary with whom ...
Peter L. Bartlett
PERCOM
2008
ACM
14 years 7 months ago
A tamper-proof and lightweight authentication scheme
We present a tamper-proof and lightweight challenge-response authentication scheme based on 2-level noisy Physically Unclonable Functions (PUF). We present a security reduction, w...
Ghaith Hammouri, Erdinç Öztürk, Berk Sunar
PODC
2004
ACM
14 years 1 months ago
Completely fair SFE and coalition-safe cheap talk
Secure function evaluation (SFE) enables a group of players, by themselves, to evaluate a function on private inputs as securely as if a trusted third party had done it for them. ...
Matt Lepinski, Silvio Micali, Chris Peikert, Abhi ...
SDMW
2004
Springer
14 years 1 months ago
A Structure Preserving Database Encryption Scheme
Abstract. A new simple and efficient database encryption scheme is presented. The new scheme enables encrypting the entire content of the database without changing its structure. I...
Yuval Elovici, Ronen Waisenberg, Erez Shmueli, Ehu...