Sciweavers

346 search results - page 63 / 70
» The Secret Santa Problem
Sort
View
ASIACRYPT
2009
Springer
14 years 4 months ago
Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
Jonathan Katz, Vinod Vaikuntanathan
GECCO
2009
Springer
111views Optimization» more  GECCO 2009»
14 years 4 months ago
Evolving quorum sensing in digital organisms
For centuries it was thought that bacteria live asocial lives. However, recent discoveries show many species of bacteria communicate in order to perform tasks previously thought t...
Benjamin E. Beckmann, Philip K. McKinley
ACISP
2006
Springer
14 years 3 months ago
On Exact Algebraic [Non-]Immunity of S-Boxes Based on Power Functions
In this paper we are interested in algebraic immunity of several well known highly-nonlinear vectorial Boolean functions (or Sboxes), designed for block and stream ciphers. Unfortu...
Nicolas Courtois, Blandine Debraize, Eric Garrido
DIM
2006
ACM
14 years 3 months ago
Privacy preserving multi-factor authentication with biometrics
An emerging approach to the problem of reducing the identity theft is represented by the adoption of biometric authentication systems. Such systems however present however several...
Abhilasha Bhargav-Spantzel, Anna Cinzia Squicciari...
PLDI
2006
ACM
14 years 3 months ago
Combining type-based analysis and model checking for finding counterexamples against non-interference
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
Hiroshi Unno, Naoki Kobayashi, Akinori Yonezawa