Secure and scalable match: overcoming the universal circuit bottleneck using group programs

Confidential Content-Based Publish/Subscribe (C-CBPS) is an interaction model that allows parties to exchange content while protecting their security and privacy interests. In this paper we advance the state of the art in C-CBPS by showing how all predicate circuits in NC1 (logarithmic-depth, bounded fan-in) can be confidentially computed by a broker while guaranteeing perfect information-theoretic security. Previous work could handle only strictly shallower circuits (e.g. those with depth O(ℑ)). We present three protocols—UGP-Match, FSGP-Match and OFSGP-Match—based on 2-decomposable randomized encodings of group programs for circuits in NC1. UGP-Match is conceptually simple and has a clean proof of correctness but its running time is a polynomial with a high exponent and hence impractical. FSGP-Match uses a “fixed structure” construction that reduces the exponent drastically and achieves efficiency and scalability. OFSGP-Match optimizes the group programs further to shave off a linear factor.

Plane-Strain Tension Tests on Aluminum Alloy Sheet

A simple way of making plane-strain tension tests on sheet specimens has been developed. This method was used to test sheets of aluminum alloy 2008 T4 and the results were analyzed in terms of a high exponent yield criterion and isotropic hardening. Experimentally measured forces agreed with those calculated from strain measurements using uniaxial tension test curves.

Radio Source Counts at 408 MHz

Radio source counts at 408 MHz are investigated using the data from the first Molonglo catalogue (MC1) and an all-sky catalogue of strong sources. Earlier results are qualitatively confirmed. Possible explanations of the high exponent of the numberflux density relation between sources of strong and intermediate flux density are discussed briefly, but no firm conclusions seem possible.