A combinatorial approach to anonymous membership broadcast

A set system (X, F ) with X= {x 1,...,x m}) and F = {B1...,B n }, where B i ⊆ X, is called an (n, m) cover-free set system (or CF set system) if for any 1 ≤ i, j, k ≤ n and j ≠ k, |B i >2 |B j ∩ B k | +1. In this paper, we show that CF set systems can be used to construct anonymous membership broadcast schemes (or AMB schemes), allowing a center to broadcast a secret identity among a set of users in a such way that the users can verify whether or not the broadcast message contains their valid identity. Our goal is to construct (n, m) CF set systems in which for given m the value n is as large as possible. We give two constructions for CF set systems, the first one from error-correcting codes and the other from combinatorial designs. We link CF set systems to the concept of cover-free family studied by Erdös et al in early 80’s to derive bounds on parameters of CF set systems. We also discuss some possible extensions of the current work, motivated by different application.

New constructions of anonymous membership broadcasting schemes

An anonymous membership broadcast scheme is a method in which a sender broadcasts the secret identity of one out of a set of n receivers, in such a way that only the right receiver knows that he is the intended receiver, while the others can not determine any information about this identity (except that they know that they are not the intended ones). In a w-anonymous membership broadcast scheme no coalition of up to w receivers, not containing the selected receiver, is able to determine any information about the identity of the selected receiver. We present two new constructions of w-anonymous membership broadcast schemes. The first construction is based on error-correcting codes and we show that there exist schemes that allow a flexible choice of w while keeping the complexities for broadcast communication, user storage and required randomness polynomial in log n,. The second construction is based on the concept of collision-free arrays, which is introduced in this paper. The construction results in more flexible schemes, allowing trade-offs between different complexities.

Factors influencing bike share membership : an analysis of Melbourne and Brisbane

The number of bike share programs has increased rapidly in recent years and there are currently over 700 programs in operation globally. Australia’s two bike share programs have been in operation since 2010 and have significantly lower usage rates compared to Europe, North America and China. This study sets out to understand and quantify the factors influencing bike share membership in Australia’s two bike share programs located in Melbourne and Brisbane. An online survey was administered to members of both programs as well as a group with no known association with bike share. A logistic regression model revealed several significant predictors of membership including reactions to mandatory helmet legislation, riding activity over the previous month, and the degree to which convenience motivated private bike riding. In addition, respondents aged 18 - 34 and having docking station within 250m of their workplace were found to be statistically significant predictors of bike share membership. Finally, those with relatively high incomes increased the odds of membership. These results provide insight as to the relative influence of various factors impacting on bike share membership in Australia. The findings may assist bike share operators to maximize membership potential and help achieve the primary goal of bike share – to increase the sustainability of the transport system.

In pursuit of some appreciation: Assessment and group membership in children’s second stories

Group membership is central to social interaction. Within peer groups, social hierarchies and affiliations are matters to which members seriously attend (Corsaro, 2014). Studies of peer groups highlight how status is achieved through oppositional actions. This paper examines the way in which competition and collaboration in a children’s peer group accomplishes status during the production and management of “second stories” (Sacks 1992). We present analysis of the interaction of young boys in a preparatory year playground who are engaged in a single instance of storytelling “rounds”. Analysis highlights the pivotal role of members’ contributions, assessments and receipts in a series of second stories that enact a simultaneously competitive and collaborative local order.

Membership cards of Judith Rosenthal, Elma Rosenthal and Arthur Rosenthal to the Jüdischer Kulturbund Berlin Portraits Family

Digital Image

The neuroscience of inspirational leadership: the importance of collective-oriented language and shared group membership

Effective leaders are believed to inspire followers by providing inclusive visions of the future that followers can identify with. In the present study, we examined the neural mechanisms underlying this process, testing key hypotheses derived from transformational and social identity approaches to leadership. While undergoing functional MRI, supporters from the two major Australian political parties (Liberal vs. Labor) were presented with inspirational collective-oriented and noninspirational personal-oriented statements made by in-group and out-group leaders. Imaging data revealed that inspirational (rather than noninspirational) statements from in-group leaders were associated with increased activation in the bilateral rostral inferior parietal lobule, pars opercularis, and posterior midcingulate cortex: brain areas that are typically implicated in controlling semantic information processing. In contrast, for out-group leaders, greater activation in these areas was associated with noninspirational statements. In addition, noninspirational statements by in-group (but not out-group) leaders resulted in increased activation in the medial prefrontal cortex, an area typically associated with reasoning about a person’s mental state. These results show that followers processed identical statements qualitatively differently as a function of leaders’ group membership, thus demonstrating that shared identity acts as an amplifier for inspirational leadership communication.

Accounts of K. K. S. I--Membership, Debts, Bonds and Interest

Digital image

Membership models and the design of authentication protocols for MANETs

Authentication protocols are very much essential for secure communication in mobile ad hoc networks (MANETs). A number of authentication protocols for MANETs have been proposed in the literature which provide the basic authentication service while trying to optimize their performance and resource consumption parameters. A problem with most of these protocols is that the underlying networking environment on which they are applicable have been left unspecified. As a result, lack of specifications about the networking environments applicable to an authentication protocol for MANETs can mislead about the performance and the applicability of the protocol. In this paper, we first characterize networking environment for a MANET as its 'Membership Model' which is defined as a set of specifications related to the 'Membership Granting Server' (MGS) and the 'Membership Set Pattern' (MSP) of the MANET. We then identify various types of possible membership models for a MANET. In order to illustrate that while designing an authentication protocol for a MANET, it is very much necessary to consider the underlying membership model of the MANET, we study a set of six representative authentication protocols, and analyze their applicability for the membership models as enumerated in this paper. The analysis shows that the same protocol may not perform equally well in all membership models. In addition, there may be membership models which are important from the point of view of users, but for which no authentication protocol is available.

A Secure and Efficient Authentication Protocol (SEAP) for MANETs with Membership Revocation

In this paper, we propose a novel authentication protocol for MANETs requiring stronger security. The protocol works on a two-tier network architecture with client nodes and authentication server nodes, and supports dynamic membership. We use an external membership granting server (MGS) to provide stronger security with dynamic membership. However, the external MGS in our protocol is semi-online instead of being online, i.e., the MGS cannot initiate a connection with a network node but any network node can communicate with the MGS whenever required. To ensure efficiency, the protocol uses symmetric key cryptography to implement the authentication service. However, to achieve storage scalability, the protocol uses a pseudo random function (PRF) to bind the secret key of a client to its identity using the secret key of its server. In addition, the protocol possesses an efficient server revocation mechanism along with an efficient server re-assignment mechanism, which makes the protocol robust against server node compromise.

Je t'aime. El uso de la ambigüedad en la publicidad audiovisual

Raquel Merino Álvarez, José Miguel Santamaría, Eterio Pajares (eds.)