We present a technique to identify Twitter users we trust to be regular Twitter users and not spam or fake accounts. The technique starts with an initial set of trusted users based on Twitter’s verified users and recursively includes other users the trusted users communicate with. Conversations must be initiated by trusted users. We show that this technique produces a set of users that is over ...

This paper is concerned with key escrow protocols for use in international communications environments, where communication domains do not necessarily trust one another. It is concerned particularly with systems where users place their trust collectively with groups of trusted third parties. We consider two different protocols, discuss and improve their efficiency and generalise the type of key...

We present a new methodology that permits to reuse an existing hardware component that has not been developed within the B framework while maintaining a correct design flow. It consists of writing a specification of the component in B and proving that the VHDL description of the component implements the specification using the ACL2 system. This paper focuses on the translation of the B specific...

Your practice is vulnerable to business-related liabilities including billing errors and omissions, discrimination, and wrongful termination. ■ NORCAL’s Physicians Administrative Defense (PAD) coverage helps you defend against these claims whether filed by government agencies, regulatory boards or third-party payers. PAD also provides for practice interruption and legal consultation. ■ Focus on...

Recently, many payment schemes for digital money have been proposed. In most of these schemes money can be spent only once and must then immediately be returned to the bank. The purpose of this paper is to show the advantages of a scheme which allows the recipient of the money to use it directly for further purchases. We discuss why most existing schemes do not support such a payment scheme and...

Avoiding the partitioning of a cluster into cliques that are not able to communicate with each other is an important issue in the time-triggered communication protocol TTP/C. This is achieved by a mechanism called Clique Avoidance. The Clique Avoidance algorithm always selects one partition (clique) to win and causes all nodes of other partitions to shut down. In this paper, we are going to inv...

In this paper, working over Z(p) and using algebra perturbation results from [18], p-minimal homological models of twisted tensor products (TTPs) of Cartan’s elementary complexes are obtained. Moreover, making use of the notion of indecomposability of a TTP, we deduce that a homological model of a indecomposable p-minimal TTP of length ` (` ≥ 2) of exterior and divided power algebras is a tenso...

We propose a new protocol allowing the exchange of an item against a signature while assuring fairness. The proposed protocol, based on the Girault-Poupard-Stern signature scheme (a variation of the Schnorr scheme), assumes the existence of a trusted third party that, except in the setup phase, is involved in the protocol only when one of the parties does not follow the designated protocol or s...

Studies that combine data from multiple sources can tremendously improve the outcome of the statistical analysis. However, combining data from these various sources for analysis poses privacy risks. A number of protocols have been proposed in the literature to address the privacy concerns; however they do not fully deliver on either privacy or complexity. In this paper, we present a (theoretica...

We describe two simple, efficient and effective credential pseudonymous certificate systems, which also support anonymity without the need for a trusted third party. The second system provides cryptographic protection against the forgery and transfer of credentials. Both systems are based on a new paradigm, called self-blindable certificates. Such certificates can be constructed using the Weil ...