IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
25 January 2022
Luke Pearson, Joshua Fitzgerald, Héctor Masip, Marta Bellés-Muñoz, Jose Luis Muñoz-Tapia
ePrint ReportAxin Wu, Jian Weng, Weiqi Luo, Anjia Yang, Jia-Nan Liu, Zike Jiang
ePrint Report24 January 2022
Status.im
Job Posting
You must have:
Bonus points if you have:
Closing date for applications:
Contact: Email: angel@status.im Discord: LilChiChi#0021
More information: https://jobs.status.im/?gh_jid=3704158
Monash University, Faculty of IT, Melbourne, Australia
Job PostingYou should have a PhD (or nearly finish PhD) and demonstrate expertise in one or more of the following research areas: cryptography (including zero-knowledge proofs, secure multi-party computation and other advanced primitives), interdisciplinary cybersecurity, human aspects of cybersecurity, secure critical infrastructures, blockchain technology, security of AI and machine learning, and security requirements engineering.
Interested party can apply through this link: https://careers.pageuppeople.com/513/cw/en/job/629426/lecturersenior-lecturer-identified-position-women
Closing date for applications:
Contact: Joseph Liu ( joseph . liu @ monash . edu )
More information: https://careers.pageuppeople.com/513/cw/en/job/629426/lecturersenior-lecturer-identified-position-women
National Sun Yat-sen University, Department of Computer Science and Engineering; Kaohsiung, Taiwan
Job PostingApplications are invited for the M.S. and Ph.D. positions in Information Security at the Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan. Successful candidates will work at CANSEC Lab on various topics in Applied Cryptology under the supervision of Arijit Karati. Expertise in post-quantum cryptography, secure vehicle communication, edge computing, satellite communication, and 6G security may be beneficial. We are seeking students dedicated to their research and are highly motivated. There are currently 05 openings (03 for M.S. and 02 are Ph.D.).
Responsibilities:
Aside from academic work, students must participate in various activities, either in a group or individually, including (but not limited to):
Requirements:
Students must meet the following major requirements in addition to the university's fundamental admission policies (https://cse.nsysu.edu.tw/?Lang=en):
Scholarship:
Method to join CANSEC:
Candidates must apply properly through the ONLINE portal after satisfying the prerequisites.
Closing date for applications:
Contact: Arijit Karati (arijit.karati@mail.cse.nsysu.edu.tw)
23 January 2022
Lucjan Hanzlik, Julian Loss, Benedikt Wagner
ePrint ReportIn contrast, due to limited memory, most existing FIDO2 tokens use one of the following approaches to handle an unlimited number of keys. Key derivation derives a fresh per-server secret key from a common seed. Key wrapping stores an encryption of the key on the server and retrieves them for each authentication. These approaches substantially complicate the protocols and their security analysis. In particular, they bear additional risks for privacy and security of FIDO2 that are not captured in the model Barbosa et al. model.
In this paper, we revisit the security of the FIDO2 as implemented in practice. Our contributions are as follows. (1) We adapt the model of Barbosa et al. so as to capture authentication tokens using key derivation or key wrapping. (2) In our adapted model, we provide the first formal definition of privacy for FIDO2 and show that these common FIDO2 token implementations are secure in our model, if the underlying building blocks are chosen appropriately. (3) Finally, we address the unsolved problem of global key revocation in FIDO2. We first provide appropriate syntax of a revocation procedure and extend our model to support this feature. We then provide the first secure global key revocation protocol for FIDO2. Our solution is based on the popular BIP32 standard used in cryptocurrency wallets.
Mathieu Baudet, Alberto Sonnino, Mahimna Kelkar, George Danezis
ePrint ReportCarsten Baum, Robin Jadoul, Emmanuela Orsini, Peter Scholl, Nigel P. Smart
ePrint ReportIn this work, we bridge this gap between designated-verifier proofs and public verifiability by {\em distributing the verifier}. Here, a set of verifiers can then verify a proof and, if a given threshold $t$ of the $n$ verifiers is honest and trusted, can act as guarantors for the validity of a statement. We achieve this while keeping the concrete efficiency of current designated-verifier proofs, and present constructions that have small concrete computation and communication cost. We present practical protocols in the setting of threshold verifiers with $t
Henry Corrigan-Gibbs, Alexandra Henzinger, Dmitry Kogan
ePrint ReportYu Long Chen, Stefano Tessaro
ePrint ReportWe present a tweakable one-call construction which matches the security of the most secure two-call construction -- the resulting security bound takes form O((p+q)q/2^n), where q is the number of construction evaluations and p is the number of direct adversarial queries to the underlying n-bit permutation, which is modeled as random. Moreover, we present a new two-call construction with much better security degradation -- in particular, for applications of interest, where only a constant number of evaluations per tweak are made, the security degrades as O((sqrt(q)p+q^2)/2^n).
Our security proof relies on on the sum-capture theorems (Babai ’02; Steinberger ’12, Cogliati and Seurin ’18), as well as on new balls-into-bins combinatorial lemmas for limited independence ball-throws.
Of independent interest, we also provide a self-contained concrete security treatment of oblivious transfer extension.
IRVINE, United States, 26 May 2022
Event CalendarSubmission deadline: 27 January 2022
Notification: 27 February 2022
Cyprus, Cyprus, 7 September - 9 September 2022
Event CalendarSubmission deadline: 23 May 2022
Notification: 11 July 2022
Barcelona, Spain, 10 July - 16 July 2022
Event CalendarSubmission deadline: 1 March 2022
Notification: 15 April 2022
Barcelona, Spain, 10 July - 16 July 2022
Event CalendarSubmission deadline: 1 March 2022
Notification: 15 April 2022
Poznan, Poland, 29 August - 31 August 2022
Event CalendarSubmission deadline: 25 March 2022
Notification: 25 May 2022
Chicago, USA, 7 November - 10 November 2022
TCCSubmission deadline: 24 May 2022
Notification: 28 August 2022
Šibenik, Croatia, 13 June - 17 June 2022
Event Calendar21 January 2022
Indian Institute of Technology Bhilai, Raipur, Chhattisgarh, INDIA
Job PostingFellowship: Rs. 42,000 per month + HRA
Age Limit: 40 years
Qualifications:
- Master's Degree in Engineering or Technology from a recognized University or equivalent; and
- Four years experience in Research and Development in Industrial and Academic Institutions or Science and Technology Organisations and Scientific activities and services
OR
Doctoral Degree in Science / Engineering / Technology from a recognized University or equivalent
How to Apply:
Candidates should only apply using the application form given in the link. A duly completed application form along with the candidate’s detailed CV must be mailed to the PI, Dr. Dhiman Saha at deciphered.recruitment@gmail.com
For more info on the research group visit: http://de.ci.phe.red
Closing date for applications:
Contact: Dr. Dhiman Saha
Assistant Professor
Department of EECS, IIT Bhilai
Email: dhiman@iitbhilai.ac.in, decipheredlab@iitbhilai.ac.in
Website: http://dhimans.in
More information: https://www.iitbhilai.ac.in/index.php?pid=adv_jan22_2
Monash Blockchain Technology Centre, Monash University, Melbourne, Australia
Job PostingWe are looking for a candidate with an outstanding PhD in cryptography and/or blockchain and a strong publication record in this field. The postdoc position will start asap and it is funded for 2 years.
To apply please send your detailed CV (with publication list) to Joseph Liu.
More information about our Blockchain Centre can be found here: https://www.monash.edu/blockchain
Closing date for applications:
Contact: Joseph Liu ( joseph . liu @ monash . edu )