The Secret Siphon

Although the siphon has been in use since ancient times, the exact mechanism of operation is still under discussion. For example, most dictionaries assert that atmospheric pressure is essential to the operation of a siphon rather than gravity. Although there is general agreement that gravity is the motivating force in a siphon, there is disagreement on how liquid enters a siphon – is it atmospheric push or tensile pull? This paper describes a classroom experiment that can serve as the basis for discussing how a siphon works. The experiment involves the construction of a siphon in which the water level in the upper reservoir is held constant during the operation of the siphon. Since the atmosphere is not doing any work on the water in the upper reservoir only gravity is at work. The special situation of a bubble-in-a-siphon is also discussed in which both atmospheric pressure and gravity are at work.

Including airport duty-free shopping in arriving passenger simulation and the opportunities this presents

Simulating passenger flows within airports is very important as it can provide an indication of queue lengths, bottlenecks, system capacity and overall level of service. To date, visual simulation tools such as agent based models have focused on processing formalities such as check-in, and not incorporate discretionary activities such as duty-free shopping. As airport retail contributes greatly to airport revenue generation, but also has potentially detrimental effects on facilitation efficiency benchmarks, this study developed a simplistic simulation model which captures common duty-free purchasing opportunities, as well as high-level behaviours of passengers. It is argued that such a model enables more realistic simulation of passenger facilitation, and provides a platform for simulating real-time revenue generation as well as more complex passenger behaviours within the airport. Simulations are conducted to verify the suitability of the model for inclusion in the international arrivals process for assessing passenger flow and infrastructure utilization.

An exploration of Online Shopping Cart Abandonment Syndrome – a matter of risk and reputation

ABSRACT. Despite the surge in online retail sales in recent years there still remains reluctance by consumers to complete the online shopping process. A number of authors have attributed consumers’ reluctance to purchase online to apparent barriers. However, such barriers as yet have not been fully examined within a theoretical context. This research explores the application of the perceived risk theoretical framework. Specifically, performance risk and the influence of perceived performance risk has on the phenomenon of Internet Abandoned Cart Syndrome (ACS) is evaluated. To explore this phenomenon, a number of extrinsic cues are identified as playing a major role in the performance evaluation process of online purchases. The results of this study suggest the extrinsic cues of brand, reputation, design and price have an overall impact on the performance evaluation process just prior to an online purchase. Varying these cues either positively or negatively had a strong impact on performance evaluation. Further, it was found that positive or negative reputation was heavily associated with shopping cart abandonment.

Virginia's secret

This catalogue essay was written to accompany the launch exhibition of LEVELari in Brisbane. It discusses the history of women-only exhibition spaces in Australia and contextualises LEVELari's place within that tradition.

A stranger's touch : effects of accidental interpersonal touch on consumer evaluations and shopping time

This article examines an unexplored area of consumer research—the effect of accidental interpersonal touch (AIT) from a stranger on consumer evaluations and shopping times. The research presents a field experiment in a retail setting. This study shows that men and women who have been touched by another consumer when examining products report more negative brand evaluations, negative product beliefs, less willingness to pay, and spend less time in-store than their control (no-touch) counterparts. Our findings indicate that the AIT effect is especially negative for touch from a male stranger for both men (same-sex touch) and women (opposite-sex touch). Directions are provided for future study that highlight potential moderators and process explanations underlying the AIT effect.

Toward a shopping typology of primary male grocery shoppers

Purpose – The purpose of this paper is to segment primary male grocery shoppers based on store and product attribute evaluations. A rich profile for each segment is developed. These developed contemporary shopper typologies are contrasted against earlier works. Design/methodology/approach – Data of 280 male grocery shoppers was attained by a survey questionnaire. Factor analysis, cluster analysis and ANOVA were employed to develop specific segments of male shoppers. Findings – Four distinct cohorts of male shoppers emerge from the data of eight constructs, measured by 46 items. One new shopper type, not found in earlier typology literature, emerged from this research. This shopper presented as young, well educated, at the commencement of their career and family lifecycle, attracted by a strong value offer and willingness to share the family food shopping responsibilities. Practical implications – Research outcomes encourage supermarket retailers to implement targeted marketing and rationalized operational strategies that deliver on attributes of importance. Originality/value – This research makes a contribution to segmentation literature and grocery retail practice in several ways. It presents the first retail typology of male supermarket shoppers, employing a cluster analysis technique. The research provides insights into the modern family food shopping behaviour of men, a channel in which men are now recognised as equal contributors. The research provides the basis for further gender comparative and cross-contextual studies.

Quantum direct secret sharing with efficient eavesdropping-check and authentication based on distributed fountain codes

We propose to use a simple and effective way to achieve secure quantum direct secret sharing. The proposed scheme uses the properties of fountain codes to allow a realization of the physical conditions necessary for the implementation of no-cloning principle for eavesdropping-check and authentication. In our scheme, to achieve a variety of security purposes, nonorthogonal state particles are inserted in the transmitted sequence carrying the secret shares to disorder it. However, the positions of the inserted nonorthogonal state particles are not announced directly, but are obtained by sending degrees and positions of a sequence that are pre-shared between Alice and each Bob. Moreover, they can confirm that whether there exists an eavesdropper without exchanging classical messages. Most importantly, without knowing the positions of the inserted nonorthogonal state particles and the sequence constituted by the first particles from every EPR pair, the proposed scheme is shown to be secure.

Multi-party computation with conversion of secret sharing

Classical results in unconditionally secure multi-party computation (MPC) protocols with a passive adversary indicate that every n-variate function can be computed by n participants, such that no set of size t < n/2 participants learns any additional information other than what they could derive from their private inputs and the output of the protocol. We study unconditionally secure MPC protocols in the presence of a passive adversary in the trusted setup (‘semi-ideal’) model, in which the participants are supplied with some auxiliary information (which is random and independent from the participant inputs) ahead of the protocol execution (such information can be purchased as a “commodity” well before a run of the protocol). We present a new MPC protocol in the trusted setup model, which allows the adversary to corrupt an arbitrary number t < n of participants. Our protocol makes use of a novel subprotocol for converting an additive secret sharing over a field to a multiplicative secret sharing, and can be used to securely evaluate any n-variate polynomial G over a field F, with inputs restricted to non-zero elements of F. The communication complexity of our protocol is O(ℓ · n 2) field elements, where ℓ is the number of non-linear monomials in G. Previous protocols in the trusted setup model require communication proportional to the number of multiplications in an arithmetic circuit for G; thus, our protocol may offer savings over previous protocols for functions with a small number of monomials but a large number of multiplications.

Decomposition construction for secret sharing schemes with graph access structures in polynomial time

The purpose of this paper is to describe a new decomposition construction for perfect secret sharing schemes with graph access structures. The previous decomposition construction proposed by Stinson is a recursive method that uses small secret sharing schemes as building blocks in the construction of larger schemes. When the Stinson method is applied to the graph access structures, the number of such “small” schemes is typically exponential in the number of the participants, resulting in an exponential algorithm. Our method has the same flavor as the Stinson decomposition construction; however, the linear programming problem involved in the construction is formulated in such a way that the number of “small” schemes is polynomial in the size of the participants, which in turn gives rise to a polynomial time construction. We also show that if we apply the Stinson construction to the “small” schemes arising from our new construction, both have the same information rate.

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.

Verifiable multi-secret sharing schemes for multiple threshold access structures

A multi-secret sharing scheme allows several secrets to be shared amongst a group of participants. In 2005, Shao and Cao developed a verifiable multi-secret sharing scheme where each participant’s share can be used several times which reduces the number of interactions between the dealer and the group members. In addition some secrets may require a higher security level than others involving the need for different threshold values. Recently Chan and Chang designed such a scheme but their construction only allows a single secret to be shared per threshold value. In this article we combine the previous two approaches to design a multiple time verifiable multi-secret sharing scheme where several secrets can be shared for each threshold value. Since the running time is an important factor for practical applications, we will provide a complexity comparison of our combined approach with respect to the previous schemes.

Cheating immune secret sharing

We consider secret sharing with binary shares. This model allows us to use the well developed theory of cryptographically strong boolean functions. We prove that for given secret sharing, the average cheating probability over all cheating and original vectors, i.e., ρ ¯= 1 n ⋅ 2 −n ∑ n c=1 ∑ α∈Vn ρ c,α , satisfies ρ ¯⩾ 1 2 , and the equality holds ⇔ ρc,α satisfies ρc,α = 1/2 for every cheating vector δc and every original vector α. In this case the secret sharing is said to be cheating immune. We further establish a relationship between cheating-immune secret sharing and cryptographic criteria of boolean functions. This enables us to construct cheating-immune secret sharing.

Cheating prevention in linear secret sharing

Cheating detection in linear secret sharing is considered. The model of cheating extends the Tompa-Woll attack and includes cheating during multiple (unsuccessful) recovery of the secret. It is shown that shares in most linear schemes can be split into subshares. Subshares can be used by participants to trade perfectness of the scheme with cheating prevention. Evaluation of cheating prevention is given in the context of different strategies applied by cheaters.

Cheating prevention in secret sharing over GF(pt)

The work investigates cheating prevention in secret sharing. It is argued that cheating is immune against cheating if the cheaters gain no advantage over honest participants by submitting invalid shares to the combiner. This work addresses the case when shares and the secret are taken from GF(pt). Two models are considered. The first one examines the case when cheaters consistently submit always invalid shares. The second modeldeal s with cheaters who submit a mixture of valid and invalid shares. For these two models, cheating immunity is defined, properties of cheating immune secret sharing are investigated and their constructions are given.

Constructions of cheating immune secret sharing

The work addresses the problem of cheating prevention in secret sharing. Two cheating scenarios are considered. In the first one, the cheaters always submit invalid shares to the combiner. In the second one, the cheaters collectively decide which shares are to be modified so the combiner gets a mixture of valid and invalid shares from the cheaters. The secret scheme is said to be k-cheating immune if any group of k cheaters has no advantage over honest participants. The paper investigates cryptographic properties of the defining function of secret sharing so the scheme is k-cheating immune. Constructions of secret sharing immune against k cheaters are given.