*16:30* [Job][New]
Two PhD Positions, *University of Bristol*
The Government Communications Headquarters (GCHQ) in Cheltenham has agreed in principle to sponsor two PhD/Doctoral Studentships at Bristol University in the area of Cryptography. See the link below for the two project descriptions. The studentships are 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.

The studentships will be funded for a period of 3.5 years. GCHQ will cover the costs of university fees (currently £ 3828 per annum) and will provide an annual stipend to the student corresponding to the National Minimum Stipend (currently £ 13,590 per annum) plus an additional stipend of £ 7,000 per annum. Making a total tax-free stipend of £ 20,590 per annum. A generous travel budget is also provided to enable attendance at international conferences and workshops.

*13:03* [Job][New]
Two Post-Docs, *Nanyang Technological University, Singapore*
We are looking for two Post-Docs in coding and lattice based cryptography. Contact us if you have (or will have soon) a PhD in Cryptography or a related subject, an excellent publication record and would like to work in a fun environment in Singapore. More information on Coding and Crypto Research Group at Nanyang Technological University can be found at http://www1.spms.ntu.edu.sg/~ccrg/index.html

The applications will be considered immediately. The positions are for 1 year, but renewable up to 3 years.

*15:17* [Pub][ePrint]
Indistinguishability Obfuscation vs. Auxiliary-Input Extractable Functions: One Must Fall, by Nir Bitansky and Ran Canetti and Omer Paneth and Alon Rosen
We show that if there exist indistinguishability obfuscators for all circuits then there do not exist auxiliary-input extractable one-way functions. In particular, the knowledge of exponent assumption withrespect to adversaries with auxiliary input is false in any group where computing discrete logarithms is intractable. The proof uses the \"punctured programs\" technique of [Sahai-Waters 2013].