*14:09* [Job][New]
PostDoc Position in Lightweight Cryptography for the Internet of Things, *Laboratory of Algorithmics, Cryptology and Security (LACS), University of Luxembourg*
*LACS* at the University of Luxembourg is looking for a post-doctoral researcher in the area of lightweight cryptography. The successful candidate will contribute to a research project entitled *Applied Cryptography for the Internet of Things (ACRYPT)*, which is funded by the Fonds National de la Recherche (FNR). Besides conducting high-quality research, the tasks associated with this position include the co-supervision of a Ph.D. student and the dissemination of research results. The ACRYPT project is led by Prof. Alex Biryukov and expected to start in summer 2013.

Candidates must hold a Ph.D. degree (or be in the final stages of a Ph.D. program) in cryptography or a closely related discipline. Applications from researchers with experience in embedded systems security, network security, privacy/anonymity, or mobile/wireless security will also be considered. Preference will be given to candidates with a strong publication record including papers in top-tier crypto/security conference proceedings or journals. Candidates with an interest to conduct leading-edge research in one of the following areas are particularly encouraged to apply:

- Design and analysis of symmetric cryptographic primitives
- Efficient implementation of cryptosystems in hardware and/or software
- Physical attacks (SPA, DPA, fault attacks, etc.) and countermeasures

The position is offered on basis of a fixed-term contract for a duration of three years, which includes a probation period of six months. The monthly salary is roughly 3,600 € net (i.e. after deduction of taxes and social security contributions). Interested candidates are invited to submit their application by email to *lacs.acrypt(at)gmail.com*. The application material should contain a cover letter explaining the candidate\'s motivation and research interests, a detailed CV (including photo), a list of publications, copies of diploma certificates, and names and contact detai

*13:11* [Job][Update]
GCHQ Sponsored PhD Studentship , *Queen’s University Belfast, Centre for Secure Information Technologies (CSIT), UK*
The Government Communications Headquarters (GCHQ) in Cheltenham has agreed in principle to sponsor a PhD/Doctoral Studentship at CSIT, Queens University Belfast in the area of Novel Application of Advanced Machine Learning Techniques for use in Side Channel Analysis Attacks. This GCHQ-sponsored PhD studentship provides funding for 3.5 years and commences on 31 September 2013 with a proposed end date of March/April 2017. GCHQ will cover the costs of university fees and will provide an annual stipend to the student corresponding to the National Minimum Stipend (currently £13,590 per annum) plus an additional sum of £7,000 per annum (both tax free). For comparison this is **equivalent to approx. £26,555 annual salary**. A further £5k of funding will also be available per annum for travel to conferences, collaborative partners, and GCHQ visits.

The studentship is **only open to UK nationals** and the successful candidate will be required to spend in the region of 2 - 4 weeks per year at GCHQ headquarters in Cheltenham. To be considered for this studentship, candidates must **therefore be prepared to undergo GCHQ\\\'s security clearance procedures**.

*13:11* [Job][New]
GCHQ Sponsored PhD Studentship , *Queen’s University Belfast, Centre for Secure Information Technologies (CSIT)*
The Government Communications Headquarters (GCHQ) in Cheltenham has agreed in principle to sponsor a PhD/Doctoral Studentship at CSIT, Queens University Belfast in the area of Novel Application of Advanced Machine Learning Techniques for use in Side Channel Analysis Attacks. This GCHQ-sponsored PhD studentship provides funding for 3.5 years and commences on 31 September 2013 with a proposed end date of March/April 2017. GCHQ will cover the costs of university fees and will provide an annual stipend to the student corresponding to the National Minimum Stipend (currently £13,590 per annum) plus an additional sum of £7,000 per annum (both tax free). For comparison this is **equivalent to approx. £26,555 annual salary**. A further £5k of funding will also be available per annum for travel to conferences, collaborative partners, and GCHQ visits.

The studentship is **only open to UK nationals** and the successful candidate will be required to spend in the region of 2 - 4 weeks per year at GCHQ headquarters in Cheltenham. To be considered for this studentship, candidates must **therefore be prepared to undergo GCHQ\'s security clearance procedures**.

*22:17* [Pub][ePrint]
Verifiable Elections That Scale for Free, by Melissa Chase and Markulf Kohlweiss and Anna Lysyanskaya and Sarah Meiklejohn
In order to guarantee a fair and transparent voting process, electronic voting schemes must be verifiable. Most of the time, however, it is important that elections also be anonymous. The notion of a verifiable shuffle describes how to satisfy both properties at the same time: ballots are submitted to a public bulletin board in encrypted form, verifiably shuffled by several mix servers (thus guaranteeing anonymity), and then verifiably decrypted by an appropriate threshold decryption mechanism. To guarantee transparency, the intermediate shuffles and decryption results, together with proofs of their correctness, are posted on the bulletin board throughout this process.In this paper, we present a verifiable shuffle and threshold decryption scheme in which, for security parameter k, L voters, M mix servers, and N decryption servers, the proof that the end tally corresponds to the original encrypted ballots is only O(k(L + M + N)) bits long. Previous verifiable shuffle constructions had proofs of size O(kLM + kLN), which, for elections with thousands of voters, mix servers, and decryption servers, meant that verifying an election on an ordinary computer in a reasonable amount of time was out of the question.

The linchpin of each construction is a controlled-malleable proof (cm-NIZK), which allows each server, in turn, to take a current set of ciphertexts and a proof that the computation done by other servers has proceeded correctly so far. After shuffling or partially decrypting these ciphertexts, the server can also update the proof of correctness, obtaining as a result a cumulative proof that the computation is correct so far. In order to verify the end result, it is therefore sufficient to verify just the proof produced by the last server.

*22:17* [Pub][ePrint]
5PM: Secure Pattern Matching, by Joshua Baron and Karim El Defrawy and Kirill Minkovich and Rafail Ostrovsky and Eric Tressler
In this paper we consider the problem of secure pattern matching that allowssingle-character wildcards and substring matching in the malicious (stand-alone) setting.

Our protocol, called 5PM, is executed between

two parties: Server, holding a text of length $n$, and

Client, holding a pattern of length $m$ to be matched

against the text, where our notion of matching is more general and includes non-binary alphabets, non-binary Hamming distance and non-binary substring matching.

5PM is the first secure expressive pattern matching protocol designed to optimize round complexity by carefully specifying the entire protocol round by round. In the malicious model, 5PM requires $O((m+n)k^2)$ bandwidth and $O(m+n)$ encryptions, where $m$ is the pattern length and $n$ is the text length. Further, 5PM can hide pattern size with no asymptotic additional costs in either computation or bandwidth. Finally, 5PM requires only two rounds of communication

in the honest-but-curious model and eight rounds in the malicious model. Our techniques reduce

pattern matching and generalized Hamming distance problems to a novel linear algebra formulation that allows for generic solutions based on any additively homomorphic encryption. We believe our efficient algebraic techniques are of independent interest.

*22:17* [Pub][ePrint]
Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS, by Seung Geol Choi and Jonathan Katz and Hoeteck Wee and Hong-Sheng Zhou
We present a general framework for efficient, universally composable oblivious transfer (OT) protocols in which a single, global common reference string (CRS) can be used for multiple invocations of oblivious transfer, by arbitrary pairs of parties. In addition:* Our framework is round-efficient. In particular, under the DLIN or SXDH assumptions we achieve (round-optimal) two-round protocols with static security, or three-round protocols with adaptive security (assuming erasure).

* Our protocols are more efficient than any known previously, and in particular yield protocols for string OT using O(1) exponentiations and sending O(1) group elements. Our result improves upon that of Peikert et al. (Crypto 2008) which requires a CRS of length

linear in the number of parties and achieves only static security. Compared to Garay et al. (Crypto 2009), we achieve better efficiency and can rely on a larger class of assumptions.

*19:17* [Pub][ePrint]
Encoding Functions with Constant Online Rate or How to Compress Keys in Garbled Circuits, by Benny Applebaum and Yuval Ishai and Eyal Kushilevitz and Brent Waters
\\emph{Randomized encodings of functions} can be used to replace a ``complex\'\' function $f(x)$by a ``simpler\'\' randomized mapping $\\hat{f}(x;r)$ whose output

distribution on an input $x$ encodes the value of $f(x)$ and hides any other information.

One desirable feature of randomized encodings is low \\emph{online complexity}. That is, the goal is to obtain a randomized encoding

$\\hat{f}$ of $f$ in which most of the output can be precomputed and published before seeing the input $x$. When the input $x$ is available, it remains to publish only a short string $\\hat{x}$, where the online complexity of computing $\\hat{x}$ is independent of (and is typically much smaller than) the complexity of computing $f$. Yao\'s garbled circuit construction gives rise to such randomized encodings in which the online part $\\hat{x}$ consists of $n$ encryption keys of length $\\kappa$ each, where $n=|x|$ and $\\kappa$ is a security parameter. Thus, the {\\em online rate} $|\\hat{x}|/|x|$ of this encoding is proportional to the security parameter $\\kappa$.

In this paper, we show that the online rate can be dramatically improved. Specifically, we show how to encode any polynomial-time computable function $f:\\bit^n\\to\\bit^{m(n)}$ with online rate of $1+o(1)$ and with nearly linear online computation. More concretely, the online part $\\hat{x}$ consists of an $n$-bit string and a single encryption key. These constructions can be based on the decisional Diffie-Hellman assumption (DDH), the Learning with Errors assumption (LWE), or the RSA assumption. We also present a variant of this result which applies to \\emph{arithmetic formulas}, where the encoding only makes use of arithmetic operations, as well as several negative results which complement our positive results.

Our positive results can lead to efficiency improvements in most contexts where randomized encodings of functions are used. We demonstrate this by presenting several concrete applications. These include protocols for secure multiparty computation and for non-interactive verifiable computation in the preprocessing model which achieve, for the first time, an optimal online communication complexity, as well as non-interactive zero-knowledge proofs which simultaneously minimize the online communication and the prover\'s online computation.