International Association for Cryptologic Research

IACR News Central

Get an update on changes of the IACR web-page here. For questions, contact newsletter (at) iacr.org. You can also get this service 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).

2013-06-28
14:02 [Job][New] Ph.D. Position in Applied Cryptography, University of Twente, The Netherlands

 

The Centre for Telematics and Information Technology (CTIT) at the University of Twente invites applications for a 4-year PhD position in cryptographically enforced privacy in electronic healthcare starting immediately. The position is funded by the THeCS project (Trusted HealthCare Services) as part of the Dutch national program COMMIT (www.commit-nl.nl).

The PhD candidate will be working with Prof. Pieter Hartel and Andreas Peter from the Distributed and Embedded Security Group (DIES, dies.ewi.utwente.nl) and with Prof. Willem Jonker from the Database Group (www.utwente.nl/ewi/db) of the University of Twente. The candidate will be expected to do active and internationally visible research on modern topics of applied cryptography and cryptographic protocols with a focus on privacy in electronic healthcare. The PhD candidate will be appointed for a period of four years, at the end of which he/she must have completed a PhD thesis. During this period, the PhD student has the opportunity to broaden his/her knowledge by joining international exchange programs, to participate in national and international conferences and workshops, and to visit other research institutes and universities worldwide.

Successful candidates must hold an outstanding M.Sc. degree (or equivalent) from the university study of Information Security/Cryptology, Mathematics, Computer Science, or similar. Applications from students that are about to finish their master thesis will be accepted as well. The candidate is expected to have excellent skills in the English language.

The position will be closed as soon as a suitable candidate is found. Applications must include:

  • CV and academic transcript (with grades)
  • motivation letter (including a description of prior activities with relevance to cryptography or information security)
  • <

11:21 [Job][New] Research Assistant, TU Darmstadt, Germany, EEA

  The Engineering Cryptographic Protocols Group in the Fachbereich Informatik of the Technische Universität Darmstadt is currently offering a position for a

Research Assistant in Engineering Cryptographic Protocols for Cloud Computing

with the goal to further develop the group\\\'s expertise in the area of engineering of cryptographic protocols, in particular for cloud computing environments. The position is initially assigned for 6 months, in which existing techniques for secure computation should be compared with regard to usage in cloud computing. In case third party funds are required, we aim to extend the position for up to three years and support the researcher to enroll in the Ph.D. program at Technische Universität Darmstadt.

Applicants must have completed (or be close to completing) a Master or Diplom with excellent grades in IT Security, Computer Science, Mathematics, Electrical Engineering, or a closely related subject. Knowledge in applied cryptography, IT security and programming skills are required. Additional knowledge in parallel computing, compiler construction, programming languages, and/or software engineering is a plus. We expect applicants to be highly qualified, self-motivated, and to conduct excellent, independent research within the context of EC SPRIDE, and actively support them in publishing their work on leading international conferences and journals.

Review of applications will start on July 10th, 2013 and applications will be accepted until the position has been filled.

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/




2013-06-26
09:30 [Job][Update] Assistant Professor (tenure track), Technische Universiteit Eindhoven, the Netherlands

  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.

09:04 [Job][Update] Assistant Professor (tenure track), Technische Universiteit Eindhoven, the Netherlands, Taaluni

  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.

09:03 [Job][Update] Assistant Professor (tenure track), Technische Universiteit Eindhoven

  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
22:35 [Job][New] PhD studentship, University College London, United Kingdom, European Union

  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.

18:17 [Pub][ePrint] Automated Security Proofs for Almost-Universal Hash for MAC verification, by Martin Gagné and Pascal Lafourcade and Yassine Lakhnech

  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.



18:17 [Pub][ePrint] Highly Controlled, Fine-grained Delegation of Signing Capabilities, by Michael Backes and Sebastian Meiser and Dominique Schröder

  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).



18:17 [Pub][ePrint] Order-Preserving Encryption Secure Beyond One-Wayness, by Tal Malkin and Isamu Teranishi and Moti Yung

  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.



18:17 [Pub][ePrint] Plug-and-Play IP Security: Anonymity Infrastructure Instead of PKI, by Yossi Gilad and Amir Herzberg

  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.