We provide formal definitions and efficient secure techniques for • turning noisy information into keys usable for any cryptographic application, and, in particular, • reliably and securely authenticating biometric data. Our techniques apply not just to biometric information, but to any keying

Signature computation is frequently performed on insecure devices--e.g., mobile phones-- operating in an environment where the private (signing) key is likely to be exposed. Strong key-insulated signature schemes are one way to mitigate the damage done when this occurs. In the key-insulated model

We study keys and functional dependencies in the context of partial relations that permit null values with the interpre-tation no information. Based on Codd’s principle of entity integrity we propose the class of strong keys over partial database relations. These keys enforce both uniqueness

Consistency is a key property of statistical algorithms, when the data is drawn from some underlying probability distribution. Surprisingly, despite decades of work, little is known about consistency of most clustering algorithms. In this paper we investigate consistency of a popular family

-esteem, morale, locus of control, depression). Results revealed that positive relations with others, autonomy, purpose in life, and personal growth were not strongly tied to prior assessment indexes, thereby supporting the claim that key aspects of positive functioning have not been represented in the empirical

to yield alternative practical schemes with the same security characteristics as SKIE-OT, starting from other IBE schemes such as that of Cocks [14]. Finally, we show that the role of identity-based encryption is not coincidental by proving that IBE is equivalent to (not strongly) key-insulated encryption

How people intentionally change addictive behaviors with and without treatment is not well understood by behavioral scientists. This article summarizes research on self-initiated and professionally facilitated change of addictive behaviors using the key transtheoretical constructs of stages

Introduction This paper deals with the problem of estimating the quality of attributes with strong dependencies to other attributes which seems to be the key issue of machine learning in general. Namely, for particular problems (e.q. parity problems of higher degrees) the discovering of dependencies between

. The proposed scheme enjoys two attractive features: (i) it is strong key-insulated; (ii) it is provably secure without random oracles. Key words: key-insulated; identity-based signature; key-exposure; standard model

Abstract not found