*03:47*[Event][New] ISPEC '14: Information Security Practice & Experience Conference

Submission: 2 December 2013

Notification: 3 February 2014

From May 12 to May 14

Location: Fuzhou, China

More Information: http://icsd.i2r.a-star.edu.sg/ispec2014/

Get an update on changes of the IACR web-page here. For questions, contact *newsletter (at) iacr.org*.
You can also receive updates via:

To receive your credentials via mail again, please click here.

You can also access the full news archive.

Further sources to find out about changes are CryptoDB, ePrint RSS, ePrint Web, Event calender (iCal).

Submission: 2 December 2013

Notification: 3 February 2014

From May 12 to May 14

Location: Fuzhou, China

More Information: http://icsd.i2r.a-star.edu.sg/ispec2014/

2013-06-26

We are looking for a candidate who meets the following requirements:

- A PhD degree in Mathematics or Computer Science;
- Research experience in coding theory;
- Outstanding research achievements and promise for the future;
- Excellent track record of international publications in leading journals and high-ranked conferences;
- High potential for the acquisition of external research funds;
- Readiness to supervise PhD projects;
- Teaching experience and good teaching skills;
- Good English speaking and writing skills, and a willingness to learn Dutch (all Master\\\'s and some Bachelor courses are given in English);
- Basic Teaching Qualification (BKO): if the candidate in question is not in possession of a BKO certificate, he or she is required to meet this requirement within a maximum period of three years.
The Department of Mathematics and Computer Science of the Eindhoven University of Technology (TU/e) has a vacancy for a Tenure Track Assistant Professor position for five years in the Coding and Crypto group (section Discrete Mathematics, DM).

The tenure-track nature of the position will be as follows. The successful candidate will first be appointed for a fixed period of five years. Before the start of the contract, the department and the candidate negotiate a list of conditions for successful conversion. If the candidate meets these conditions at the end of the five years, the position becomes permanent; if not, the temporary position is not continued.

We are looking for a candidate who meets the following requirements:

- A PhD degree in Mathematics or Computer Science;
- Research experience in coding theory or coding theory;
- Outstanding research achievements and promise for the future;
- Excellent track record of international publications in leading journals and high-ranked conferences;
- High potential for the acquisition of external research funds;
- Readiness to supervise PhD projects;
- Teaching experience and good teaching skills;
- Good English speaking and writing skills, and a willingness to learn Dutch (all Master\\\'s and some Bachelor courses are given in English);
- Basic Teaching Qualification (BKO): if the candidate in question is not in possession of a BKO certificate, he or she is required to meet this requirement within a maximum period of three years.
The Department of Mathematics and Computer Science of the Eindhoven University of Technology (TU/e) has a vacancy for a Tenure Track Assistant Professor position for five years in the Coding and Crypto group (section Discrete Mathematics, DM).

The tenure-track nature of the position will be as follows. The successful candidate will first be appointed for a fixed period of five years. Before the start of the contract, the department and the candidate negotiate a list of conditions for successful conversion. If the candidate meets these conditions at the end of the five years, the position becomes permanent; if not, the temporary position is not continued.

We are looking for a candidate who meets the following requirements:

- A PhD degree in Mathematics or Computer Science;
- Research experience in coding theory or coding theory;
- Outstanding research achievements and promise for the future;
- Excellent track record of international publications in leading journals and high-ranked conferences;
- High potential for the acquisition of external research funds;
- Readiness to supervise PhD projects;
- Teaching experience and good teaching skills;
- Good English speaking and writing skills, and a willingness to learn Dutch (all Master\\\'s and some Bachelor courses are given in English);
- Basic Teaching Qualification (BKO): if the candidate in question is not in possession of a BKO certificate, he or she is required to meet this requirement within a maximum period of three years.
The Department of Mathematics and Computer Science of the Eindhoven University of Technology (TU/e) has a vacancy for a Tenure Track Assistant Professor position for five years in the Coding and Crypto group (section Discrete Mathematics, DM).

The tenure-track nature of the position will be as follows. The successful candidate will first be appointed for a fixed period of five years. Before the start of the contract, the department and the candidate negotiate a list of conditions for successful conversion. If the candidate meets these conditions at the end of the five years, the position becomes permanent; if not, the temporary position is not continued.

2013-06-25

We are looking for outstanding candidates for a fully funded PhD studentship in cryptography. The PhD studentship is funded by an ERC Starting Grant on Efficient Cryptographic Arguments and Proofs. The studentship will provide a tax-free annual stipend of £21,000, however, ERC funding does not cover student fees (currently £4,400 for UK/EU students and £20,250 for Overseas students).

The goal of the PhD studentship under the supervision of Dr Jens Groth is to develop new and efficient zero-knowledge techniques. Zero-knowledge proofs enable a prover to convince a verifier that a statement is true without revealing any other information and are widely used in cryptographic protocols.

University College London has been recognized by the EPSRC and GCHQ as an Academic Centre of Excellence in Cyber Security Research and is one of the highest ranked universities in Europe. The Computer Science Department is one of the largest in the UK and is located at UCL\\\'s main campus in the centre of London.

Message authentication codes (MACs) are an essential primitive in cryptography. They are used to ensure the integrity and authenticity of a message, and can also be used as a building block for larger schemes, such as chosen-ciphertext secure encryption, or identity-based encryption. MACs are often built in two steps: first, the `front end\' of the MAC produces a short digest of the long message, then the `back end\' provides a mixing step to make the output of the MAC unpredictable for an attacker. Our verification method follows this structure. We develop a Hoare logic for proving that the front end of the MAC is an almost-universal hash function. The programming language used to specify these functions is fairly expressive and can be used to describe many block-cipher and compression function-based MACs. We implemented this method into a prototype that can automatically prove the security of almost-universal hash functions. This prototype can prove the security of the front-end of many CBC-based MACs (DMAC, ECBC, FCBC and XCBC to name only a few), PMAC and HMAC. We then provide a list of options for the back end of the MAC, each consisting of only two or three instructions, each of which can be composed with an almost-universal hash function to obtain a secure MAC.

Delegation of signing rights is a central problem in security. Whereas delegating by giving power of attorney is well studied and digitally realized via delegatable anonymous credentials, directly delegating signing possibilities without the need for an external logic, can be done via malleable signature schemes. However, the existing schemes do not allow for privacy preserving, fine-grained malleability and they do not allow for a controlled way of further delegating the malleability. We bridge this gap by introducing delegatable functional signatures (DFS).

Semantic-security of individual bits under a ciphertext are fundamental notion in modern cryptography. In this work we present the first results about this fundamental problem for Order-Preserving Encryption (OPE): ``what plaintext information can be semantically hidden by OPE encryptions?\'\' While OPE has gained much attention in recent years due to its usefulness in secure databases, any partial-plaintext indistinguishability (semantic security) result for it was open. Here, we propose a new indistinguishability-based security notion for OPE, which can ensure \\emph{secrecy of lower bits of a plaintext} (under essentially a random ciphertext probing setting). We then propose a new scheme satisfying this security notion (while earlier schemes do not satisfy it!). We note that the known security notions tell us nothing about the above partial- plaintext indistinguishability because they are limited to being one-way-based. In addition, we show that our security notion with specific parameters implies the known security notion called WOW, and further, our scheme achieves WOW with better parameters than earlier schemes.

We present the Plug-and-Play IP Security (PnP-IPsec) protocol. PnP-IPsec automatically establishes IPsec security associations between gateways, avoiding the need for manual administration and coordination between gateways, and the dependency on IPsec public key certificates - the two problems which are widely believed to have limited the use of IPsec mostly to intra-organization communication.

PnP-IPsec builds on Self-validated Public Data Distribution (SvPDD), a protocol that we present to establish secure connections between remote peers/networks, without depending on pre-distributed keys or certification infrastructure. Instead, SvPDD uses available anonymous communication infrastructures such as Tor, which we show to allow detection of MitM attacker interfering with communication. SvPDD may also be used in other scenarios lacking secure public key distribution, such as the initial connection to an SSH server.

We provide an open-source implementation of PnP-IPsec and SvPDD, and show that the resulting system is practical and secure.

One of the key problems in Radio Frequency Identification (RFID) is security and privacy. Many RFID authentication protocols have been proposed to preserve security and privacy of the system. Nevertheless, most of these protocols are analyzed and it is shown that they can not provide security against some RFID attacks. In WISTP 2013, a new lightweight authentication protocol using AES S-box and some special function is presented. The new protocol has a good implementation in resource constrained tags. In this paper, we give the security analysis on this new authentication protocol. After impersonating the valid reader to query the tag and collecting the responses, we can deduce all the secrets shared between the reader and tag through analyzing the messages. The attack utilizes the structure of the invertible function and the property of the special function introduced in the new protocol.

We construct new randomized algorithms to find the exact solution to the shortest and closest vector problems (SVP and CVP) in Euclidean norm (l2) for the integral lattice. Not only the minimal norm of non-zero lattice vectors in SVP and the minimal distance in CVP, but also how many lattice vectors reach those minimums can be simultaneously computed by the algorithms. Our approach is based on some special properties of the generating function of lattice vectors\' (l2-)norms, the lattice-associated theta function, which is used in prior works mainly for hardness analysis on lattice problems but rarely for computational purposes. Such function\'s modular properties are exploited to develop our SVP and CVP solvers. In computational complexity perspective and take our SVP solver as an example, for the integral lattice family {Λn} of dimension dimΛn=n and level h=l(Λn) (the minimal positive integer such that the dual lattice Λn* scaled by h1/2 is integral) polynomial in n, the case frequently occurring in applications, this algorithm can find the minimal l2-norm of non-zero lattice vectors and the number of such shortest vectors in Λn with success probability 1-ε in asymptotic space complexity of polynomial in n and asymptotic time complexity of nO(n)log(1/ε). The only contribution to the algorithm\'s exponential time complexity nO(n)log(1/ε) comes from independently repeating a randomized lattice vector sampler nO(n)log(1/ε) times. All the rest of operations contribute to the algorithm\'s time-complexity only with an additive polynomial in n. Similar situations occur when solving the exact CVP by our algorithm. In other words, our solvers can be easily parallelized to be polynomial in time complexity. In addition, a variant of our CVP solver can solve the closest vector problem with preprocessing (CVPP) in polynomial time and nO(n)log(1/ε) space complexity.