*16:19* [Job][New]
Postdoc Positions in IT-Security, Privacy, and Cryptography, *Center for IT-Security, Privacy and Accountability, Saarland University, Saarbrücken, Germany*
The Information Security and Cryptography (IS&C) group at the Computer Science Department of Saarland University is currently offering several postdoc positions. The IS&C group is part of the Center for IT-Security, Privacy and Accountability (CISPA).

The IS&C group conducts research in various aspects of IT-security, privacy, and cryptography. Topics of particular interest include, but are not limited to:

Positions are being offered for two years, with the possibility of renewal for another year. Postdoc applicants are required to hold a doctoral degree in computer science or a closely related area, or have it completed at the time of taking up the position. We expect successful applicants to have a strong background in one or more of the aforementioned research topics, and to maintain an outstanding academic track record. The working and teaching language is English.

**Application Instructions**

Applications should contain a CV, copies of transcripts, certificates, as well as a research statement and two references. Applications will be accepted for evaluation until the positions have been filled. Please send your application to Michael Backes via e-mail.

*09:52* [Job][New]
Ph.D. Position in Lightweight Cryptography for the Internet of Things, *University of Luxembourg, Luxembourg*
The Laboratory of Algorithmics, Cryptology and Security (LACS) of the University of Luxembourg is looking a Ph.D. student in 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). The ACRYPT project is led by Prof. Alex Biryukov and has started in July 2013.

Candidates are expected to hold an M.Sc. degree in computer science, electrical engineering, or applied mathematics with outstanding grades (GPA > 80%). Applications from M.Sc. students who will graduate in spring 2014 will also be considered. A solid background in algorithms and data structures, discrete mathematics, probability theory and statistics, software development, computer architecture, and information security is a general requirement to qualify for a Ph.D. position in LACS. Hands-on experience in hardware design (VHDL, SystemC) or programming of embedded systems (AVR, MSP430, ARM, etc.) is a plus. Candidates with an interest to conduct research in one of the following areas are particularly encouraged to apply:

- Design and analysis of symmetric cryptographic primitives
- Efficient implementation of cryptosystems in HW and/or SW
- Side-channel attacks and countermeasures

The Ph.D. position is initially available for three years, but an extension to a fourth year is possible. LACS offers excellent working conditions in an attractive research environment and a competitive salary (> 2000€ net). 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 CV (including detailed information about the obtained degrees and overall GPA in both the undergraduate and graduate program), as well as a transcript of courses and grades. A

*15:40* [Job][New]
Two Ph.D. Positions in Cryptography/IT Security, *University of Luxembourg*
The Laboratory of Algorithmics, Cryptology and Security (LACS) of the University of Luxembourg is looking for two Ph.D. students in cryptography and IT security. The successful candidate for the first position 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). The second Ph.D. position can be in any area of research in which LACS is currently engaged (e.g. applied cryptography, network security, anonymity and privacy) and candidates are invited to submit their own proposals for possible projects.

Candidates are expected to hold an M.Sc. degree in computer science, electrical engineering, or applied mathematics with outstanding grades (GPA > 80%). A solid background in algorithms and data structures, discrete mathematics, probability theory and statistics, software development, computer architecture, and information security is a general requirement to qualify for a Ph.D. position in LACS. Hands-on experience in hardware design (VHDL, SystemC) or programming of embedded systems (AVR, MSP430, ARM, etc.) is an asset for the Ph.D. position related to the ACRYPT project. Candidates with an interest to conduct research in one of the following areas are particularly encouraged to apply:

- Design and analysis of symmetric cryptographic primitives
- Efficient implementation of cryptosystems
- Side-channel attacks and countermeasures

Both Ph.D. positions are initially offered for three years, but an extension to a fourth year is possible. LACS offers excellent working conditions in an attractive research environment and a competitive salary (> 2000 Euro net). 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 CV (including deta

*07:17* [Pub][ePrint]
Proofs of Space: When Space is of the Essence, by Giuseppe Ateniese and Ilario Bonacina and Antonio Faonio and Nicola Galesi
Proofs of computational effort were devised to control denial of service attacks.Dwork and Naor (CRYPTO \'92), for example, proposed to use such proofs to discourage spam.

The idea is to couple each email message with a proof of work that demonstrates the sender performed some computational task.

A proof of work can be either CPU-bound or memory-bound. In a CPU-bound proof, the prover must

compute a CPU-intensive function that is easy to check by the verifier. A memory-bound proof, instead, forces the prover to access the main memory several times, effectively replacing

CPU cycles with memory accesses.

In this paper we put forward a new concept dubbed {\\em proof of space}. To compute such a proof, the prover must use a specified amount of space, i.e., we are not interested in the number of accesses to the main memory (as in memory-bound proof of work) but rather on the amount of actual memory the prover must employ to compute the proof.

We give a complete and detailed algorithmic description of our model. We develop a full theoretical analysis which uses combinatorial tools from Complexity Theory (like pebbling games) which are essential in studying space lower bounds.

We remark that a similar concept

has recently been described by Dziembowski et al. (Workshop held in Warsaw, 2013), however their proof-of-space paradigm

is more in line with memory-bound proof of work since the prover can trade off space with computation while our definition disallow this prospect.

*07:17* [Pub][ePrint]
(Anonymous) Compact HIBE From Standard Assumptions, by Somindu C. Ramanna and Palash Sarkar
We present two hierarchical identity-based encryption (HIBE) schemes, denoted as $\\ahibe$ and $\\hibe$, from Type-3 pairings with constant sized ciphertexts. Scheme $\\ahibe$ is anonymous and $\\hibe$ is non-anonymous.

The constructions are obtained by extending the IBE scheme recently proposed by Jutla and Roy (Asiacrypt 2013).

Security is based on the standard decision Symmetric eXternal Diffie-Hellman (SXDH) assumption. In terms of provable

security properties, all previous

constructions of constant-size ciphertext HIBE schemes had one or more of the following drawbacks: secure in the weaker model of

selective-identity attacks; exponential security degradation in the depth of the HIBE; and use of non-standard assumptions.

The security arguments for $\\ahibe$ and $\\hibe$ avoid all of these drawbacks. Along with theoretically satisfying security,

the parameter sizes and efficiencies of the different algorithms of the two schemes compare very well with all previously known

constructions. Based on currently known techniques, $\\ahibe$ and $\\hibe$ fill an

important gap in the state-of-the-art on efficient (anonymous) HIBE constructions.