International Association for Cryptologic Research

# IACR News Central

You can also access the full news archive.

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

2015-07-16
18:11 [Pub][ePrint]

We unify the many prior variants of point-function obfuscation via a definitional framework in which security is parameterized by a class of algorithms we call target generators, with different notions corresponding to different choices of this class. This leads to an elegant question, namely whether it is possible to provide a generic construction, meaning one that takes an arbitrary class of target generators and returns a point-function obfuscator secure for it. We answer this in the affirmative with three generic constructions, the first based on indistinguishability obfuscation, the second on deterministic public-key encryption and the third on universal computational extractors. By exploiting known constructions of the primitives assumed, we obtain a host of new point-function obfuscators, including many under standard assumptions.

18:11 [Pub][ePrint]

We show general transformations from subexponentially-secure approximate indistinguishability obfuscation (IO) where the obfuscated circuit agrees with the original circuit on a $1/2+\\epsilon$ fraction of inputs, into exact indistinguishability obfuscation where the

obfuscated circuit and the original circuit agree on all inputs (except for a negligible probability over the coin tosses of the obfuscator). As a step towards our results, which is of independent interest, we also obtain an approximate-to-exact transformation for functional encryption. At the core of our techniques is a method for fooling\'\' the obfuscator into giving us the correct answer, while preserving the indistinguishability-based security. This is achieved based on various types of secure computation protocols that can be obtained from different standard assumptions.

Put together with the recent results of Canetti, Kalai and Paneth (TCC 2015), Pass and Shelat (Eprint 2015), and Mahmoody, Mohammed and Nemathaji (Eprint 2015), we show how to convert indistinguishability obfuscation schemes in various ideal models into exact obfuscation schemes in the plain model.

18:11 [Pub][ePrint]

We present a technique to achieve O(n) communication complexity per multiplication for a wide class of robust practical MPC protocols. Previously such a communication complexity was only known in the case of non-robust protocols in the full threshold, dishonest majority setting. In particular our technique applies to robust threshold computationally secure protocols in the case of t

2015-07-15
22:30 [Job][New]

Applications are invited for a full-time PhD position in the Security in Information Technology (SIT) Research Group at Technische Universität Darmstadt, Germany, under the direction of Prof. Dr. Michael Waidner.

The vacancy is within the newly established research training group \"Privacy and Trust for Mobile Users\", funded by DFG, the German Research Foundation.

We are looking for a candidate interested in working at the intersection of privacy engineering, identity management, applied cryptography, and machine learning, starting October 01, 2015.

2015-07-14
16:24 [Event][New]

Submission: 15 October 2015
From December 7 to December 8
Location: Beijing, China

2015-07-13
18:03 [Job][New]

We are looking for a research scientist or post-doc in cryptography to work on novel cryptographic concepts for emerging ICT domains (e.g. cloud computing or cyber physical systems). Ideally you have experience in fields like modern public-key cryptography, distributed cryptography, privacy enhancing technologies, or multi-party computation. You will be involved in a EU research project on identity management and research/improve cryptography for secure and privacy preserving cloud based identity management.

Further infos:

• Project site (avail. soon): https://www.credential.eu

• AIT Digital Safety & Security Department: http://www.ait.ac.at/departments/digital-safety-security

,

18:02 [Event][New]

Submission: 15 October 2015
From June 1 to October 15

18:02 [Event][New]

Submission: 14 September 2015
From June 1 to September 14

2015-07-08
15:16 [Event][New]

Submission: 4 September 2016
From November 2 to November 3
Location: Nijmegen, The Netherlands

15:13 [Job][New]

Simula Research Laboratory in Norway seeks a researcher in cryptography or computer security for an initial two-year contract with possibility for further employment. The successful candidate will also be responsible for leading the process of applying for EU-grants under H2020. Previous involvement in EU projects and experience in building and maintaining consortia will count as a big plus.

15:13 [Job][New]

The chair Modeling and Analysis of Information Systems (MAIS) of Prof. Dr.-Ing. Heiko Mantel in the Department of Computer Science at TU Darmstadt, Germany, is offering two PostDoc positions:

- Concurrent Program Security (detailed position announcement at http://www.mais.informatik.tu-darmstadt.de/assets/misc/2015-PostDoc-IFS-Concurrent.pdf)

- Information-Flow Security by Design (detailed position announcement at http://www.mais.informatik.tu-darmstadt.de/assets/misc/2015-PostDoc-IFS-SecurityEngineering.pdf)

The detailed announcements contain information about the position descriptions, benefits, qualifications, and the application procedure.

The positions are available from September 1st 2015, but a later start is also possible. We will consider applications until the positions are filled.