Sciweavers

89 search results - page 12 / 18
» Information Theoretic Bounds on Authentication Systems in Qu...
Sort
View
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 8 months ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs
ICB
2007
Springer
79views Biometrics» more  ICB 2007»
14 years 1 months ago
On Some Performance Indices for Biometric Identification System
This paper investigates a new approach to formulate performance indices of biometric system using information theoretic models. The performance indices proposed here (unlike conven...
Jay Bhatnagar, Ajay Kumar
LATIN
2004
Springer
14 years 1 months ago
Approximating the Expressive Power of Logics in Finite Models
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
Argimiro Arratia, Carlos E. Ortiz
PODS
2010
ACM
228views Database» more  PODS 2010»
13 years 9 months ago
Capturing missing tuples and missing values
Databases in real life are often neither entirely closed-world nor entirely open-world. Indeed, databases in an enterprise are typically partially closed, in which a part of the d...
Wenfei Fan, Floris Geerts
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 10 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich