IACR News
If you have a news item you wish to distribute, they should be sent to the communications secretary. See also the events database for conference announcements.
Here you can see all recent updates to the IACR webpage. These updates are also available:
18 June 2018
Vlad Constantin Craciun, Andrei Mogage, Emil Simion
Lauren De Meyer, Begül Bilgin, Oscar Reparaz
Ivan Damgård, Tomasz Kazana, Maciej Obremski, Varun Raj, Luisa Siniscalchi
Subhrajyoti Deb, Bubu Bhuyan, Sartaj Ul Hasan
14 June 2018
Per Austrin, Kai-Min Chung, Mohammad Mahmoody, Rafael Pass, Karn Seth
We also show that this result cannot be extended to primitives such as signature schemes and identification protocols: assuming the existence of one-way functions, such primitives can be made resilient to (\nicefrac{1}{\poly(n)})-tampering attacks where $n$ is the security~parameter.
weeve GmbH, Berlin, Germany
Smart Contracting and Blockchain applications (e.g. Ethereum, Hyperledger, Cardano),
Blockchain-enabled mechanism design and applications (e.g. graded token-curated registries),
Radically new voting schemes beyond “the richer get richer” (e.g. quadratic voting, token-curated voting),
Scalable consensus protocols ,
Cryptographic algorithms (e.g. NIZKs, SNARGs, STARKs) & privacy-enhancing/GDPR-friendly protocols (e.g. MPC,)
System Security (e.g. ARM Trustzone, Intel SGX)
We solicit applications at various entry levels, from junior to senior, covering the complete spectrum from full-time research to development. We also appreciate and support research internships of PhDs and PostDocs. We offer a competitive salary, an academic environment, and access to Berlin’s vibrant blockchain ecosystem. Weeve leaves much freedom for pursuing one’s own ideas and supports this with condensing research ideas into a PhD and disseminating those to the blockchain community (meetups, conferences, etc.).
Closing date for applications: 31 July 2018
Contact: For technical inquiries, please contact Prof. Dr. Sebastian Gajek: (sebastian.gajek (at) weeve.network)
For recruitment queries, contact NBT Tech Recruiter: Ayca (ayca.kuzuimamlar (at) nbt.ag).
More information: https://weeve.network
University of Versailles, France
The position is available immediately for one year, and is renewable, based on mutual interest and availability of funding. The starting date can be arranged as convenient.
The candidates are expected to:
- have completed their PhD degree in cryptography;
- have adequate cryptography research experience demonstrated through a strong publication record.
Applications should be sent via email and should include a CV, a list of publications, a short research proposal, and contact information for one or two persons who are willing to give references.
Closing date for applications: 30 June 2018
Contact: Contact: Prof. Louis Goubin, Louis.Goubin (at) uvsq.fr
More information: http://lmv.math.cnrs.fr/equipes/crypto/
12 June 2018
Sadegh Sadeghi, Nasour Bagheri
Anamaria Costache, Brooke Feigon, Kristin Lauter, Maike Massierer, Anna Puskas
Sergey Agievich
Sankhanil Dey, Ranjan Ghosh
Xiaoming Chen, Weiqing You
Ahmad Al Badawi, Yuriy Polyakov, Khin Mi Mi Aung, Bharadwaj Veeravalli, Kurt Rohloff
Guilherme Borges, Henrique Domingos, Bernardo Ferreira, João Leitão, Tiago Oliveira, Bernardo Portela
In this paper we tackle this tension by proposing BISEN, a new provably-secure boolean searchable symmetric encryption scheme that improves these three complementary dimensions by exploring the design space of isolation guarantees offered by novel commodity hardware such as Intel SGX, abstracted as Isolated Execution Environments (IEEs). BISEN is the first scheme to enable highly expressive and arbitrarily complex boolean queries, with minimal leakage of information regarding performed queries and accessed data. Furthermore, by exploiting trusted hardware and the IEE abstraction, BISEN reduces communication costs between the client and the cloud, boosting query execution performance. Experimental validation and comparison with the state of art shows that BISEN provides better performance with enriched search semantics and security
Tapas Pal, Ratna Dutta
In this work, we give constructions of the following cryptographic primitives without using multilinear maps and instantiating obfuscation from randomized encoding: We construct witness PRFs using a puncturable pseudorandom function and sub-exponentially secure randomized encoding scheme in common reference string (CRS) model. A sub-exponentially secure randomized encoding scheme in CRS model can be achieved from a sub-exponentially secure public key functional encryption scheme and learning with error assumptions with sub-exponential hardness. We turn our witness PRF into a multi-relation witness PRF where one can use the scheme with a class of relations related to an NP language. Furthermore, we construct an offline witness encryption scheme using our proposed witness PRF. The offline witness encryption scheme of Abusalah et al. [AFP16] was built from a plain public-key encryption, a statistical simulation-sound non-interactive zero knowledge (SSS-NIZK) proof system and obfuscation. In their scheme, a(n) SSS-NIZK proof is needed for the encryption whose efficiency depends on the underlying public key encryption. We replace SSS-NIZK by our witness PRF and construct an offline witness encryption scheme. More precisely, our scheme is based on a public-key encryption, a witness PRF and employs a sub-exponentially secure randomized encoding scheme in CRS model instantiating obfuscation. Our offline witness encryption can be turned into an offline functional witness encryption scheme where decryption releases a function of a message and witness as output.
Yoshinori Aono, Phong Q. Nguyen, Takanobu Seito, Junji Shikata
Jung Hee Cheon, Seungwan Hong, Changmin Lee, Yongha Son
Our main idea is to generically combine two abstract encryption schemes that satisfies some special properties. We also gives an instantiation of our scheme by combining ElGamal scheme and Ring-LWE based homomorphic encryption scheme, whose ciphertext length is exactly $2\ell+1,$ for any degree $d.$
Mugurel Barcau, Vicentiu Pasol
Mugurel Barcau, Vicentiu Pasol
11 June 2018
PQShield Ltd., Oxford, UK.
We invite experts in PQ cryptography to join our team as (Senior) Cryptographic Researchers. Candidates are expected to have a PhD degree in any PQ cryptography field or the equivalent in industrial experience with a solid publication record.
The company is offering competitive packages in addition to the chance to be affiliated with the Mathematical Institute at the University of Oxford.
Closing date for applications: 15 August 2018
Contact: Interested candidates, please send your CVs to Ali El Kaafarani on elkaafarani (at) pqshield.com or elkaafarani (at) maths.ox.ac.uk