IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
28 September 2015
University of Luxembourg, APSIA Group
Job Posting2 years extendable up to 5 years
Role
To contribute to the research goals of the group, as outlined above. Expertise outside those listed above, but complementary expertise will also be considered.
Profile
PhD in Computing Science, (Applied) Mathematics, Theoretical Physics or related domain.
Experience in cryptography, information assurance, mathematical modelling will be considered as an advantage
Fluent written and verbal communication skills in English.
A proven interest in information security is essential.
Strong background in mathematics is essential.
Commitment, team spirit and a critical mind.
We offer
The university offers a two year employment that may be extended up to five years. The University offers highly competitive salaries and is an equal opportunity employer. You will work in an exciting international environment and will have the opportunity to participate in the development of a newly created research centre.
Further Information<
27 September 2015
University of Washington Tacoma
Job PostingUniversity of Washington Tacoma
Job PostingHassan Noura, Damien Couroussé
ePrint Reportsimulation results.
Yongjun Zhao, Sherman S.M. Chow
ePrint ReportIn this paper, we focus on the case of STAS for threshold access structure, i.e. threshold secret transfer (TST). We also discuss how to replace it with linear secret sharing to make the access structure more expressive. Our proposed TST scheme enables a number of applications including a simple construction of oblivious transfer with threshold access control, and (a variant of) threshold private set intersection (t-PSI), which are the first of their kinds in the literature to the best of our knowledge. Moreover, we show that TST is useful a number of applications such as privacy-preserving matchmaking with interesting features.
The underlying primitive of STAS is a variant of oblivious transfer (OT) which we call OT for sparse array. We provide two constructions which are inspired from state-of-the-art PSI techniques including oblivious polynomial evaluation and garbled Bloom filter (GBF). We implemented the more efficient construction and provide its performance evaluation.
Antoine Joux, Cécile Pierrot
ePrint Report
Payman Mohassel, Mike Rosulek, Ye Zhang
ePrint ReportWe propose a new approach for secure three-party computation (3PC) that improves security while maintaining practical efficiency that is competitive with traditional information-theoretic protocols. Our protocol is based on garbled circuits and provides security against a single, malicious corrupt party. Unlike information-theoretic 3PC protocols, ours uses a constant number of rounds. Our protocol only uses inexpensive symmetric-key cryptography: hash functions, block ciphers, pseudorandom generators (in particular, no oblivious transfers) and has performance that is comparable to that of Yao\'s (semi-honest) 2PC protocol.
We demonstrate the practicality of our protocol with an implementation based on the JustGarble framework of Bellare et al. (S&P 2013). The implementation incorporates various optimizations including the most recent techniques for efficient circuit garbling. We perform experiments on several benchmarking circuits, in different setups. Our experiments confirm that, despite providing a more demanding security guarantee, our protocol has performance comparable to existing information-theoretic 3PC.
Sikhar Patranabis, Debapriya Basu Roy, Debdeep Mukhopadhyay
ePrint Reportnow major threats to even mathematically robust cryptographic
algorithms that are otherwise resistant to classical cryptanalysis.
It is necessary to design suitable countermeasures to protect
cryptographic primitives against such attacks. This paper focuses
on designing encryption schemes that are innately secure against
fault analysis. The paper formally proves that one such design
strategy, namely the use of key-dependent SBoxes, is only
partially secure against DFA. The paper then examines the
fault tolerance of encryption schemes that use a key-independent
secret tweak value for randomization. In particular, the paper
focuses on a linear tweak based and a non-linear tweak based
version of a recently proposed block cipher DRECON. The paper
demonstrates that while both versions are secure against classical
DFA, the non-linear tweak based version provides greater fault
coverage against stronger fault models. This fact, together with
the DPA resistance provided by the use of variable S-Boxes,
makes DRECON a strong candidate for the design of secure
cryptographic primitives. All claims have been validated by
experimental results on a SASEBO GII platform.
Jayaprakash Kar
ePrint Reportand obtain the partial-private key of the user.
Jung Hee Cheon, Changmin Lee, Hansol Ryu
ePrint ReportThe first candidate construction of multilinear maps was proposed by
Garg, Gentry, and Halevi (GGH13) in 2013,
and a bit later another candidate was suggested by Coron, Lepoint, and Tibouchi (CLT13) over the integers.
However, both of them turned out to be insecure from so-called zeroizing attack (HJ15, CHL$^+$15).
As a fix of CLT13, Coron, Lepoint, and Tibouchi proposed another candidate of new multilinear maps over the integers (CLT15).
In this paper, we describe an attack against CLT15.
Our attack shares the essence of cryptanalysis of CLT13
and exploits low level encodings of zero as well as other public parameters.
As in the CHL$^+$15, this leads to find all the secret parameters of $\\kappa$-multiliear maps in polynomial time of security parameter.
26 September 2015
Sky Faber, Stanislaw Jarecki, Hugo Krawczyk, Quan Nguyen, Marcel Rosu, Michael Steiner
ePrint Report
25 September 2015
Vadim N.Tsypyschev, Julia S.Vinogradova
ePrint ReportFurther A.S.Kuzmin has obtained analogous results for the case of Galois polynomial over primary residue ring of odd characteristic .
Later the first author of this article has carried the criterion of full period of the Galois polynomial over primary residue ring of odd characteristic obtained by A.S.Kuzmin to the case of Galois polynomial over nontrivial Galois ring of odd characteristic.
Using this criterion as a basis we have obtained criterion calling attention to.
This result is an example how to apply results of the previous work of V.N.Tsypyschev in order to construct polynomials of maximal period over nontrivial Galois ring of odd characteristic. During this it is assumed that period of polynomial modulo prime ideal is known and maximal .
University of Washington Tacoma
Job PostingUniversity of Washington Tacoma
Job Posting24 September 2015
University of Alabama at Birmingham
Job PostingApplicants must have recently completed or be about to complete their PhD degrees in computer science or a related field, and should have a solid understanding of modern cryptography and distributed computing as well as excellent skills in programming for various computing platforms ranging from smartphones and laptop computers to modern servers.
23 September 2015
Nanyang Technological University
Job PostingReview of applications will begin immediately and will continue until all positions are filled. Only shortlisted candidates will be contacted for interview.
Ruhr University Bochum
Job PostingOur research focus is on practice-oriented provable security. Topics of interest may include (but are not limited to):
- Provable security of cryptographic implementations
- Randomness generation
- Cryptographic protocols (e.g. cryptocurrencies)
Starting date: earliest possible
Send your documents to sebastian (dot) faust (at) rub (dot) de
Applicants are required to have completed (or be close to completing) a Master or Diploma with excellent grades in Computer Science, Mathematics, or closely related areas. Additional knowledge in related disciplines such as, e.g., complexity theory or IT security is welcome.
Please send your application to Sebastian Faust via e-mail. Applications should contain a CV, a 1-page letter of motivation, copies of transcripts and certificates, and (if possible) names of references. Review of applications will start immediately until the position has been filled.
Founded in 2001, the Horst-Görtz Institute at Ruhr-University Bochum is a leading interdisciplinary research center dedicated to research and education covering all aspects of IT security, with an excellent record of research in cryptography. The Horst-Görtz Institute has 15 professors and over 80 PhD students.
New Jersey Institute of Technology (NJIT), metro New York City, USA
Job PostingThe candidate will support research in applied encryption technologies at the NJIT cryptolab. The candidate will oversee the development of a new lattice encryption library written in C++. Experience with C++ and lattice encryption is essential. Experience writing software as part of technical software teams is essential. A PhD in CS, EE, CmpE, Applied Math or a related field is required.
The ideal candidate will have working knowledge of network security and C++ programming. Software engineering, software testing, high-performance computing, computer engineering and parallel programming experience would be beneficial but not critical. The candidate should be able to write and speak clearly. The ideal candidate will also have experience in embedded computing, open-source development, high performance computing and applications of encryption technologies.
The candidates will be supervised by Prof. Kurt Rohloff in the department of computer science at NJIT. The post-doc position can be renewed subject to continued availability of external funding and success in the position.
Department of Computer Science at the University of California, Santa Cruz
Job PostingChalmers University of Technology, Sweden
Job PostingThe post-doctoral researcher will join Katerina Mitrokotsa\'s research group, working in the area of information and communication security with a focus on authentication protocols, verifiable delegation of computation, and secure multi-party computation.
The post-doc position is available for one year which will be extended for one more year after a successful review.
The post-doctoral researcher is expected to have a PhD degree and strong background in theoretical computer science and cryptography.