The bed-book of happiness: being a colligation or assemblage of cheerful writings brought together from many quarters into this one compass for the diversion, distraction and delight of those who lie abed, -a friend to the invalid, a companion to the sleepless, an excuse to the tired.

Mode of access: Internet.

Privacy enhancements for hardware-based security modules

The increasing growth in the use of Hardware Security Modules (HSMs) towards identification and authentication of a security endpoint have raised numerous privacy and security concerns. HSMs have the ability to tie a system or an object, along with its users to the physical world. However, this enables tracking of the user and/or an object associated with the HSM. Current systems do not adequately address the privacy needs and as such are susceptible to various attacks. In this work, we analyse various security and privacy concerns that arise when deploying such hardware security modules and propose a system that allow users to create pseudonyms from a trusted master public-secret key pair. The proposed system is based on the intractability of factoring and finding square roots of a quadratic residue modulo a composite number, where the composite number is a product of two large primes. Along with the standard notion of protecting privacy of an user, the proposed system offers colligation between seemingly independent pseudonyms. This new property when combined with HSMs that store the master secret key is extremely beneficial to a user, as it offers a convenient way to generate a large number of pseudonyms using relatively small storage requirements.

Certified pseudonyms colligated with master secret key

A pseudonym provides anonymity by protecting the identity of a legitimate user. A user with a pseudonym can interact with an unknown entity and be confident that his/her identity is secret even if the other entity is dishonest. In this work, we present a system that allows users to create pseudonyms from a trusted master public-secret key pair. The proposed system is based on the intractability of factoring and finding square roots of a quadratic residue modulo a composite number, where the composite number is a product of two large primes. Our proposal is different from previously published pseudonym systems, as in addition to standard notion of protecting privacy of an user, our system offers colligation between seemingly independent pseudonyms. This new property when combined with a trusted platform that stores a master secret key is extremely beneficial to an user as it offers a convenient way to generate a large number of pseudonyms using relatively small storage.

Commuting Nonselfadjoint Operators and their Characteristic Operator-Functions

* Partially supported by Grant MM-428/94 of MESC.

The Operators Aγ = γA + -γA for a Class of Nondissipative Operators A with a Limit of the Corresponding Correlation Function

2000 Mathematics Subject Classification: Primary 47A48, Secondary 60G12

Triangular Models and Asymptotics of Continuous Curves with Bounded and Unbounded Semigroup Generators

2000 Mathematics Subject Classification: Primary 47A48, Secondary 60G12.

On Connection between Characterestic Functions and the Caratheodori Class Functions

2000 Mathematics Subject Classification: 47A65, 45S78.