This conference proceedings publication is the result of a merge of two independent and concurrent works. The two papers were authored by Goldwasser, Goyal, Jain, and Sahai; and by Gordon, Katz, Liu, Shi, and Zhou. Research supported by NSFEAGER award # CNS1347364 DARPA award # FA8750-11-2-0225 and the Simons Foundation -Investigation Award. Research supported by NSF awards #1111599 and #1223623, and by the US Army Research Laboratory and the UK Ministry of Defence under Agreement Number W911NF-06-3-0001. The views and conclusions contained herein are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the US Army Research Laboratory, the U.S. Government, the UK Ministry of Defense, or the UK Government. The US and UK Governments are authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation hereon. Multi-input Functional Encryption 579Abstract. We introduce the problem of Multi-Input Functional Encryption, where a secret key sk f can correspond to an n-ary function f that takes multiple ciphertexts as input. We formulate both indistinguishability-based and simulation-based definitions of security for this notion, and show close connections with indistinguishability and virtual black-box definitions of obfuscation. Assuming indistinguishability obfuscation for circuits, we present constructions achieving indistinguishability security for a large class of settings. We show how to modify this construction to achieve simulationbased security as well, in those settings where simulation security is possible.

Abstract. Group signature schemes allow users to sign messages on behalf of a group while (1) maintaining anonymity (within that group) with respect to an outside observer, yet (2) ensuring traceability of a signer (by the group manager) when needed. In this work we give the first construction of a group signature scheme based on lattices (more precisely, the learning with errors assumption), in the random oracle model. Towards our goal, we construct a new algorithm for sampling a basis for an orthogonal lattice, together with a trapdoor, that may be of independent interest.

We consider the problem of secret sharing among n rational players. This problem was introduced by Halpern and Teague (STOC 2004), who claim that a solution is impossible for n = 2 but show a solution for the case n ≥ 3. Contrary to their claim, we show a protocol for rational secret sharing among n = 2 players; our protocol extends to the case n ≥ 3, where it is simpler than the Halpern-Teague solution and also offers a number of other advantages. We also show how to avoid the continual involvement of the dealer, in either our own protocol or that of Halpern and Teague.Our techniques extend to the case of rational players trying to securely compute an arbitrary function, under certain assumptions on the utilities of the players.

Traditional approaches to generic secure computation begin by representing the function f being computed as a circuit. If f depends on each of its input bits, this implies a protocol with complexity at least linear in the input size. In fact, linear running time is inherent for non-trivial functions since each party must "touch" every bit of their input lest information about the other party's input be leaked. This seems to rule out many applications of secure computation (e.g., database search) in scenarios where inputs are huge.Adapting and extending an idea of Ostrovsky and Shoup, we present an approach to secure two-party computation that yields protocols running in sublinear time, in an amortized sense, for functions that can be computed in sublinear time on a random-access machine (RAM). Moreover, each party is required to maintain state that is only (essentially) linear in its own input size. Our protocol applies generic secure two-party computation on top of oblivious RAM (ORAM). We present an optimized version of our protocol using Yao's garbled-circuit approach and a recent ORAM construction of Shi et al.We describe an implementation of this protocol, and evaluate its performance for the task of obliviously searching a database with over 1 million entries. Because of the cost of our basic steps, our solution is slower than Yao on small inputs. However, our implementation outperforms Yao already on DB sizes of 2 18 entries (a quite small DB by today's standards).

Introduction Carers support programmes are commonly delivered in person, limiting attendance opportunities for rural carers and others who have access barriers. Studies using technology typically use text-based forums rather than real-time technology such as videoconferencing (VC). Delivering home-based carers support programmes by VC may mitigate barriers for accessing support. We report implementation findings for delivering a telehealth peer-support programme for isolated carers of people with dementia. Methods Participants were recruited through aged care providers, peak bodies and media activities. Inclusion criteria were primary dementia caregiver with Internet access and being socially or geographically isolated. The study design was a staggered randomised waitlist design. Measures included the UCLA Loneliness Scale (ULS-6) and selected scales from the e-Health Literacy Questionnaire. Recruitment activities utilised digital processes. Participants completed a six-week programme delivered by VC. Qualitative data comprised logs detailing administration and IT procedures and difficulties. Post programme, 28 participants undertook semi-structured interviews. Data were analysed using descriptive statistics and thematic analysis. Results There were 16 groups comprising 69 participants located throughout Australia, with 87% using their own devices. Technical issues were few but included connection problems, which were compounded by low digital literacy skills. Qualitative data themes included changing perceptions in using technology, differences in communicating by VC and technical support required. Recruitment activities were time-consuming and would benefit from IT tailored for group-based work. Eight groups continued to meet on a self-organised basis. Discussion Providing peer-support groups using telehealth may have the potential to develop self-sustaining peer networks for isolated caregivers of people with dementia.