Bid-rigging is a dangerous attack in electronic auction. Abe and Suzuki firstly introduced the idea of receipt-free to prevent this attack. In this paper we point out that Abe and Suzuki’s scheme only provides receipt-freeness for losing bidders. We argue that it is more important to provide receipt-freeness for winners and propose a new receipt-free sealed bid auction scheme using the homomorp...

Coercion resistance and receipt freeness are critical properties for any voting system. However, many different definitions of these properties have been proposed, some formal and some informal; and there has been little attempt to tie these definitions together or identify relations between them. We give here a general framework for specifying different coercion resistance and receipt freeness...

Chemical and enzymatic modifications intended to improve the reactivity of dissolving pulp rapidly decrease its yield. In this study, a beating posttreatment intended to increase the reactivity of bamboo dissolving pulp was investigated. Beating post-treatment can create microfibrils on the surface of fibers. The reactivity of unrefined bamboo dissolving pulp prepared via pre-hydrolysis and a s...

Understanding the local behaviour of structured multi-dimensional data is a fundamental problem in various areas of computer science. As the amount of data is often huge, it is desirable to obtain sublinear time algorithms, and specifically property testers, to understand local properties of the data. We focus on the natural local problem of testing pattern freeness: given a large d-dimensional...

We tackle local distributed testing of graph properties. This framework is well suited to contexts in which data dispersed among the nodes of a network can be collected by some central authority (like in, e.g., sensor networks). In local distributed testing, each node can provide the central authority with just a few information about what it perceives from its neighboring environment, and, bas...

We initiate the study of fairness among classes agents in online bipartite matching where there is a given set offline vertices (aka agents) and another items) that arrive must be matched irrevocably upon arrival. In this setting, are partitioned into required to fair with respect classes. adopt popular notions (e.g. envy-freeness, proportionality, maximin share) their relaxations setting deter...