IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
20 August 2021
Microsoft Research India, Bangalore
Job PostingClosing date for applications:
Contact: https://careers.microsoft.com/us/en/job/1129518/Research-SDE
More information: https://careers.microsoft.com/us/en/job/1129518/Research-SDE
Indian Institute of Science (IISc)
Job PostingThis position is open for post-graduate (MSc/MS/MTech/Dual degree/Integrated Mtech) students interested in getting more research experience. Applicants who have credited a cryptography course in their home institute and/or who have worked on a related topic for their master's thesis are preferred.
You can apply through and find further details regarding opportunities at CrIS here -
https://www.csa.iisc.ac.in/~cris/opportunities.html
Closing date for applications:
Contact: Arpita Patra
More information: https://www.csa.iisc.ac.in/~cris/about.html
Indian Institute of Science (IISc)
Job PostingThe applicant is expected to have completed a PhD degree (recently) in Cryptography or a related subject with strong publication records. A background in theoretical aspects of secure multiparty computation and/or experience in coding for practical aspects of secure computation is expected. Postdoctoral fellows are expected to actively interact with PhD students and contribute to the lab's projects. The tenure of the position is for one year and can be extended further.
You can apply through and find further details regarding opportunities at CrIS here -
https://www.csa.iisc.ac.in/~cris/opportunities.html
Closing date for applications:
Contact: Arpita Patra
More information: https://www.csa.iisc.ac.in/~cris/about.html
16 August 2021
InfoSec Global
Job PostingClosing date for applications:
Contact: Vladimir Soukharev
More information: https://www.infosecglobal.com/
University of Wuppertal, Germany
Job PostingFor more information about our research group, see https://itsc.uni-wuppertal.de/en/
Prerequisites for a Ph.D. candidate:
- M.Sc. or similar degree in computer science
- Strong background in cryptography and theoretical computer science
The official job announcement can be found at https://stellenausschreibungen.uni-wuppertal.de/ (unfortunately in German only). This announcement is in German only. However, German language skills are not required, the working language in the group is English.
If you have questions, please contact Tibor Jager by e-mail.
Closing date for applications:
Contact: Tibor Jager, see group web page for e-mail address.
More information: https://itsc.uni-wuppertal.de/en/
Lior Goldberg, Shahar Papini, Michael Riabzev
ePrint ReportYingyin Pan, Jianghua Zhong, Dongdai Lin
ePrint ReportPavel Atnashev, George Woltman
ePrint ReportHadrien Barral, Éric Brier, Rémi Géraud-Stewart, Arthur Léonard, David Naccache, Quentin Vermande, Samuel Vivien
ePrint ReportAlgebraic sieving initially comes from cryptanalysis, where it is used to solve factorization, discrete logarithms, or to produce signature forgeries in cryptosystems such as RSA. We repurpose the technique here to provide candidate identities, which can be tested and ultimately formally proven.
A limitation of our technique is the need for human intervention in the post-processing phase, to determine the most general form of conjectured identities, and to provide a proof for them. Nevertheless we report 29 identities that hitherto never appeared in the literature, 9 of which we could completely prove, the remainder being numerically valid over all tested values.
This work complements other instances in the literature where this type of automated symbolic computation has served as a productive step toward theorem proving; it can be extremely helpful in figuring out what it is that one should attempt to prove.
Sabyasachi Dey, Chandan Dey, Santanu Sarkar, Willi Meier
ePrint ReportIn the first part of this paper, we provide the theoretical framework for the distinguisher given by Beierle et. al. We mathematically derive the observed differential correlation for the particular position where the output difference is observed at $3.5$ rounds. Also, Beierle et. al. mentioned the issue of the availability of proper IVs to produce such distinguishers, and pointed out that not all keys have such IVs available. Here we provide a theoretical insight of this issue.
Next we revisit the work of Coutinho et. al. (Eurocrypt 2021). Using Differential-Linear attacks against ChaCha, they claimed distinguisher and key recovery with complexities $2^{218}$ and $2^{228.51}$ respectively. We show that the differential correlation for $3.5$ rounds is much smaller than the claim of Coutinho et. al. This makes the attack complexities much higher than their claim.
Hyunji Kim, Gyeongju Song, Kyoungbae Jang, Hwajeong Seo
ePrint ReportChun-I Fan, Cheng-Han Shie, Yi-Fan Tseng, Hui-Chun Huang
ePrint ReportChun-I Fan, Si-Jing Wu, Yi-Fan Tseng
ePrint ReportFrançois Garillot, Yashvanth Kondi, Payman Mohassel, Valeria Nikolaenko
ePrint ReportIn this work, we construct a dishonest majority threshold Schnorr protocol that enables such stateless deterministic nonce derivation using standardized block ciphers. Our core technical ingredients are new tools for the zero-knowledge from garbled circuits (ZKGC) paradigm to aid in verifying correct nonce derivation: - A mechanism based on UC Commitments that allows a prover to commit once to a witness, and prove an unbounded number of statements online with only cheap symmetric key operations. - A garbling gadget to translate intermediate garbled circuit wire labels to arithmetic encodings.
Our scheme prioritizes computation cost, with each proof requiring only a small constant number of exponentiations.
Alessandra Scafuro, Bihan Zhang
ePrint ReportOur one-time traceable ring signature scheme presents many advantages: it is fast, with a signing time of less than 1 second for a ring of $2^{10}$ signers (and much less for smaller rings); it is {\em post-quantum resistant}, as it only requires hash evaluations; it is extremely simple, as it requires only a black-box access to a generic hash function (modeled as a random oracle) and no other cryptographic operation is involved. From a theoretical standpoint our scheme is also the first anonymous signature scheme based on a black-box access to a symmetric-key primitive. All existing anonymous signatures are either based on specific hardness assumptions (e.g., LWE, SIS, etc.) or use the underlying symmetric-key primitive in a non-black-box way, i.e., they leverage the circuit representation of the primitive.