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:
01 August 2018
Kallepu Raju, Appala Naidu Tentuand, V. Ch. Venkaiah
Megha Byali, Arun Joseph, Arpita Patra, Divya Ravi
Assuming the minimal model of pairwise-private channels, we present two protocols that involve computation and communication of a single GC-- (a) a 4-round 3PC with fairness, (b) a 5-round 4PC with guaranteed output delivery. Empirically, our protocols are on par with the best known 3PC protocol of Mohassel et al. [CCS 2015] that only achieves security with selective abort, in terms of the computation time, LAN runtime, WAN runtime and communication cost. In fact, our 4PC outperforms the 3PC of Mohassel et al. significantly in terms of per-party computation and communication cost. With an extra GC, we improve the round complexity of our 4PC to four rounds. The only 4PC in our setting, given by Ishai et al. [CRYPTO 2015], involves 12 GCs.
Assuming an additional broadcast channel, we present a 5-round 3PC with guaranteed output delivery that involves computation and communication of a single GC. A broadcast channel is inevitable in this setting for achieving guaranteed output delivery, owing to an impossibility result in the literature. The overall broadcast communication of our protocol is nominal and most importantly, is independent of the circuit size. This protocol too induces a nominal overhead compared to the protocol of Mohassel et al.
Vanessa Vitse
In this article, we propose a new simple oblivious transfer (OT) protocol, based on the Diffie-Hellman key exchange, that only uses exponentiations; we also revisit the older Wu-Zhang-Wang scheme. Both protocols can be directly instantiated on fast Kummer varieties; more importantly, they can also be transposed in the post-quantum SIDH setting. The security of our proposals relies on the hardness of non-standard versions of the (supersingular) Diffie-Hellman problem, that are investigated within this article. To the best of our knowledge, these protocols are the simplest secure discrete-log based OT schemes using only exponentiations, and the first isogeny-based OT schemes.
Alexandre Adomnicai, Jacques J.A. Fournier, Laurent Masson
Elette Boyle, Niv Gilboa, Yuval Ishai
FSS schemes are useful for applications that involve privately reading from or writing to distributed databases while minimizing the amount of communication. These include different flavors of private information retrieval (PIR), as well as a recent application of DPF for large-scale anonymous messaging. We improve and extend previous results in several ways:
- Simplified FSS constructions. We introduce a tensoring operation for FSS which is used to obtain a conceptually simpler derivation of previous constructions and present our new constructions.
- Improved 2-party DPF. We reduce the key size of the PRG-based DPF scheme of Boyle et al. roughly by a factor of 4 and optimize its computational cost. The optimized DPF significantly improves the concrete costs of 2-server PIR and related primitives.
- FSS for new function families. We present an efficient PRG-based 2-party FSS scheme for the family of decision trees, leaking only the topology of the tree and the internal node labels. We apply this towards FSS for multi-dimensional intervals. We also present a general technique for obtaining more expressive FSS schemes by increasing the number of parties.
- Verifiable FSS. We present efficient protocols for verifying that keys $(k^*_1,\ldots,k^*_m)$, obtained from a potentially malicious user, are consistent with some $f\in\mathcal F$. Such a verification may be critical for applications that involve private writing or voting by many users.
Paul Bunn, Jonathan Katz, Eyal Kushilevitz, Rafail Ostrovsky
As a building block of independent interest, we construct a 3-server distributed point function with security against two colluding servers that is simpler and has better concrete efficiency than prior work.
Russell W.F. Lai, Giulio Malavolta
Hisham S. Galal, Amr M. Youssef
Niek J. Bouman, Niels de Vreede
Ben Fisch
Tight proofs of space are necessary for proof-of-replication (PoRep), which is a publicly verifiable proof that the prover is dedicating unique resources to storing one or more retrievable replicas of a file. Our main PoS construction can be used as a PoRep, but data extraction is as inefficient as replica generation. We present a second variant of our construction called ZigZag PoRep that has fast/parallelizable data extraction compared to replica generation and maintains the same space tightness while only increasing the number of levels by roughly a factor two.
Yen-Lung Lai
This paper focuses on secure sketch. We propose a new technique to generate re-usable secure sketch. We show security to low entropy sources and enable error correction up to Shannon bound. Our security defined information theoretically with fuzzy min-entropy under distribution uncertain setting. In other words, our new technique offers security guarantee for all family of input distribution, as long as the sources possessing ``meaningful amount" of fuzzy min-entropy over some random distributions, parametrized by a chosen error correction code.
Hwajeong Seo, Zhe Liu, Patrick Longa, Zhi Hu
Raghvendra Rohit, Guang Gong
Our attack extends the number of previously attacked rounds by 4 and has a success probability 1. This reduces the security margin of both these ciphers to 16%. Up to our knowledge, this is currently the best attack on Simon-32/64 and Simeck-32/64.
Indian Statistical Institute, R. C. Bose Centre for Cryptology and Security, Kolkata
This is a rolling advertisement, and there is no last date. Interested applicants are encouraged to apply for the positions throughout the year. The recruitment committee(s) will meet regularly to consider the applications and arrange for seminars and/or interviews as the need arises.
For eligibility criteria, kindly visit the link below in \"More information\"
Interested candidates may send a copy of their current Curriculum Vitæ that clearly mentions the marks/grades/dissertations/honors at all academic levels (Grade 10, Grade 12, Bachelors, Masters, PhD), as applicable, and includes a complete list of peer-reviewed journal and conference publications in cryptology and security, to be considered for the positions.
The Curriculum Vitæ, as mentioned, should be sent to “Head, R. C. Bose Centre for Cryptology and Security, Indian Statistical Institute” at rcbose (at) isical.ac.in as a consolidated PDF file.
Closing date for applications: 31 December 2019
Contact: Head, R. C. Bose Centre for Cryptology and Security, Indian Statistical Institute
rcbose (at) isical.ac.in
More information: https://www.isical.ac.in/JobApplicationFiles/ASSOCIATE%20PROFESSOR%20and%20ASSISTANT%20PROFESSOR%20for%20R%20C%20Bose%20
31 July 2018
Paderborn University, Germany
The group has a strongly research-oriented focus and sufficient funds at disposal to buy necessary equipment, enable the attendance of scientific conferences, etc. The competitive salary is based on state tariff TV-L E13/14, 100% position, according to the current tariff in the German state North-Rhine Westphalia.
Applicants are expected to have a strong background and good publication record in modern cryptography, preferably in \"provable security\", a strong interest in theoretical foundations of real-world cryptography, and a strong motivation and ability to perform excellent research. The successful applicant is expected to actively contribute to the research agenda of an ERC-funded project on theoretically-sound real-world cryptography.
Knowledge of the German language is not mandatory. The language spoken within the group and large parts of the institute is English. All students and many people in the city speak good English, and the MSc study courses at the Institute of Computer Science are taught in English.
The position is initially offered for one year, with the option of an extension to two or more years. The starting date is November 1st or later. There is no closing date for applications, the position remains open until filled.
Applications should consist of a single pdf document, containing:
- Cover letter with a brief introduction of the applicant and a short personal statement on the applicant\'s interest in this particular position
- CV and a list of publications
- Optional: one or two letter(s) of recommendation
- Optional: further supporting material
Incomplete applications or obvious mass applications that do not specifically address the offered position can not be considered.
Please submit applications by e-mail to Tibor Jager (e-mail address below). If you need further information or have any questions, then please feel free to contact Tibor.
Closing date for applications: 31 December 2018
Contact: Tibor Jager, tibor.jager (at) upb.de
Singapore University of Technology and Design (SUTD), Singapore
I am looking for promising PhD students who are interested in working in the area of cyber security. The position is fully funded up to 4 years with very competitive scholarship. Candidates should have an excellent background (with Bachelor or Master degree and CGPA>80%) in mathematics or computer science/engineering and the ability to work on inter-disciplinary research projects. Acquaintance with cryptography and network/system security concepts as well as some programming skills will be considered as strong assets.
For the Jan 2019 intake, the application deadline is 30th September 2018. More information of the PhD program is available at https://istd.sutd.edu.sg/phd/phd-overview/.
Interested candidates please send your CV to Prof. Jianying Zhou.
Closing date for applications: 30 September 2018
Contact: Prof. Jianying Zhou
jianying_zhou (at) sutd.edu.sg
More information: http://jianying.space/
Montreal, Canada, 13 November - 15 November 2018
Submission deadline: 3 September 2018
Notification: 8 October 2018
29 July 2018
Irvine, USA, 17 September - 21 September 2018
27 July 2018
JP Morgan - ROAR Data
We’re guessing you know that one. If you enjoy privacy preserving computation and recognize the potential, you might want to join a team of top tier engineers, data scientists, mathematicians and cryptographers working on the ROAR platform. You will collaborate across engineering and business units to help build a next-generation prediction platform used by the bank, the bank’s clients, and eventually - we hope - the entire world.
You will:
• Design, implement and improve techniques for privacy preserving Machine Learning using whatever techniques are most appropriate (cryptographic, statistical and a combination of the two).
• Design, implement and improve partial structure preserving data obfuscation methodologies
• Design and analyze hypothetical statistical attacks, real and hypothetical
• Design and build into our contest framework new primitives, and combinations of the same, to expand the possibilities for crowd-sourcing data, predictions and models.
• Work with leading experts in secure multiparty computation.
• Collaborate with researchers and students as part of the JP Morgan/ ROAR partnership with MIT, which involves Sloan CIDL and MIT CSAIL.
• Adapt privacy methods to real-time data streams.
Closing date for applications: 25 July 2019
Contact: send CV to marc.gammon (at) jpmchase.com
Paderborn University
- Security Engineering
- Security of Cyber-Physical Systems
- Securing Long Term & Long Lived Systems
- Computer Architecture Security
- Language-based Security
A successful applicant should demonstrate experience in the application and execution of third party funding projects, such as DFG Projects. Candidates must be ready and willing to participate in collaborative applications of interdisciplinary research projects, and to actively integrate into existing projects. Paderborn University offers several possibilities for crossdisciplinary research, such as the CRC 901 “On-the-fly Computing”, as well as institutions such as the Software Innovation Campus Project (SICP), the Paderborn Center for Parallel Computing (PC²) and the Heinz-Nixdorf Institute (HNI). Another vital criterion is the willingness to work with other professors in the department.
Please see the referenced .pdf document for further information.
Closing date for applications: 30 September 2018
Contact: Prof. Dr. Holger Karl (eim-i-prodekan@uni[at]uni-paderborn.de) and Prof. Dr.-Ing. Tibor Jager (tibor.jager[at]upb.de).
More information: https://www.uni-paderborn.de/fileadmin/zv/4-4/stellenangebote/Kennziffer3427Englisch.pdf