We address the problem of realizing concurrently composable secure computation without setup assumptions. While provably impossible in the UC framework of [Can01], Prabhakaran and Sahai had recently suggested a relaxed framework called generalized Environmental Security (gES) [PS04], as well as a restriction of it to a “client-server” setting based on monitored functionalities [PS05]. In these ...

A pseudo-random number generator (PRNG) is a deterministic algorithm that produces numbers whose distribution is indistinguishable from uniform. A formal security model for PRNGs with input was proposed in 2005 by Barak and Halevi (BH). This model involves an internal state that is refreshed with a (potentially biased) external random source, and a cryptographic function that outputs random num...

In the cryptographic system a pseudorandom number generator is one of the basic primitives. We survey theoretically secure pseudorandom bit generators which are provably secure under certain reasonable number theoretic assumptions and some practical pseudorandom number generators based on assumptions about symmetric crypto-primitives. Recently, there was a noticeable result for the concrete sec...

We systematically analyze audio key finding to determine factors important to system design, and the selection and evaluation of solutions. First, we present a basic system, fuzzy analysis spiral array center of effect generator algorithm, with three key determination policies: nearest-neighbor (NN), relative distance (RD), and average distance (AD). AD achieved a 79% accuracy rate in an evalua...

Given a graph G, the security number of G is the cardinality of a minimum secure set of G, the smallest set of vertices S ⊆ V (G) such that for all X ⊆ S, |N [X] ∩ S| ≥ |N [X] − S|. It is believed to be computationally difficult to find the security number of large graphs, so we present techniques for reducing the difficulty of both finding a secure set and determining bounds on the security nu...

Variational methods for approximate Bayesian inference provide fast, flexible, deterministic alternatives to Monte Carlo methods. Unfortunately, unlike Monte Carlo methods, variational approximations cannot, in general, be made to be arbitrarily accurate. This paper develops grid-based variational approximations which endeavor to approximate marginal posterior densities in a spirit similar to t...

What structural features characterize individual performers’ styles? To what extent do eminent pianists agree on segmentation and rendering of musical phrases? How much do they agree on selection of score events (accents) for local emphasis, and how to emphasize them? How do these choices influence the emotional responses of listeners? How musical expertise and cognitive style of listening infl...

The use of the Social Security number (SSN) has expanded significantly since its inception in 1936. Created merely to keep track of the earnings history of U.S. workers for Social Security entitlement and benefit computation purposes, it has come to be used as a nearly universal identifier. Assigned at birth, the SSN enables government agencies to identify individuals in their records and busin...