IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
27 January 2021
Kelong Cong, Daniele Cozzo, Varun Maram, Nigel P. Smart
ePrint ReportEaswar Vivek Mangipudi, Donghang Lu, Aniket Kate
ePrint ReportSivanarayana Gaddam, Atul Luykx, Rohit Sinha, Gaven Watson
ePrint ReportEvgenios M. Kornaropoulos, Charalampos Papamanthou, Roberto Tamassia
ePrint ReportIn this work, we close the aforementioned gap by introducing a parametrized leakage-abuse attack that applies to practical response-hiding structured encryption schemes. The use of non-parametric estimation techniques makes our attack agnostic to both the data and the query distribution. At the very core of our technique lies the newly defined concept of a counting function with respect to a range scheme. We propose a two-phase framework to approximate the counting function for any range scheme. By simply switching one counting function for another, i.e., the so-called parameter of our modular attack, an adversary can attack different encrypted range schemes. We propose a constrained optimization formulation for the attack algorithm that is based on the counting functions. We demonstrate the effectiveness of our leakage-abuse attack on synthetic and real-world data under various scenarios.
Dieaa I. Nassr, M. Anwar, Hatem M. Bahig
ePrint ReportIlaria Chillotti, Marc Joye, Pascal Paillier
ePrint ReportBei Wang; Yi Ouyang; Honggang Hu ; Songsong Li
ePrint ReportGabrielle Beck, Julia Len, Ian Miers, Matthew Green
ePrint ReportMarc Fischlin, Arno Mittelbach
ePrint ReportThe paper here is not a research paper in the traditional sense. It mainly consists of an excerpt from the book "The Theory of Hash Functions and Random Oracles - An Approach to Modern Cryptography" (Information Security and Cryptography, Springer, 2021), providing a detailed discussion of the intricacies of the hybrid argument that we believe is of interest to the broader cryptographic community. The excerpt is reproduced with permission of Springer.
Boyuan Feng, Lianke Qin, Zhenfei Zhang, Yufei Ding, Shumo Chu
ePrint ReportMic Bowman, Debajyoti Das, Avradip Mandal, Hart Montgomery
ePrint ReportIn this work, we formally define a simplified version of PoET and Proof of Luck, which we call elapsed time (ET) consensus with a trusted timer. We prove the security of our ET consensus protocol with a trusted gimer given an honest majority assumption in a model very similar to the bitcoin backbone model proposed by Garay et al. which we call the elapsed time backbone model. Our model and protocol aims to capture the essence of PoeT and PoL while ignoring some of the more practical difficulties associated with such protocols, such as bootstrapping and setting up the TEE.
The PoET protocol also contains a function called the $z$-test that limits the number of blocks a player can publish in any particular larger set of blocks. Surprisingly, by improving this $z$-test a little bit we can prove the security of our ET consensus protocol without any TEEs with a (slightly stronger) honest majority assumption. This implies that Nakamoto-style consensus with rate limiting and no proofs of work can be used to obtained scalable consensus in a permissioned setting: in other words, ``bitcoin without proofs of work'' can be made secure without a TEE for private blockchains!
Suhri Kim
ePrint ReportGilles Macario-Rat, Jacques Patarin
ePrint ReportMichael Troncoso, Britta Hale
ePrint ReportJaskaran V. Singh, Nicholas J. Hopper
ePrint ReportHendrik Waldner, Tilen Marc, Miha Stopar, Michel Abdalla
ePrint Report24 January 2021
DTU Denmark
Job PostingClosing date for applications:
Contact: Professor Lars Ramkilde Knudsen, lrkn@dtu.dk. Please use the above link when applying for the position. Applications sent by email will not be considered.
More information: https://www.dtu.dk/english/about/job-and-career/vacant-positions/job?id=dd355396-a1f7-4960-8e94-af0f50a374dc
22 January 2021
Athens, Greece, 23 January 2021
Event CalendarCryptology and Data Security Group, University of Bern, Bern, Switzerland
Job PostingOur research addresses all aspects of security in distributed systems, especially cryptographic protocols, consistency, consensus, and cloud-computing security. We are particularly interested in blockchains, distributed ledger technology, cryptocurrencies, and their security and economics.
Candidates should have a strong background in computer science. They should like conceptual, rigorous thinking for working theoretically, or be interested in building innovative systems for working practically. Demonstrated expertise in cryptography, distributed computing, or blockchain technology is a plus. Applicants must hold a master degree in the relevant research fields.
Positions are available immediately and come with a competitive salary. The selection process runs until suitable candidates have been found. The University of Bern conducts excellent research and lives up its vision that “Knowledge generates value”. The city of Bern lies in the center of Switzerland and offers some of the highest quality of life worldwide.
If you are interested, please apply be sending email with one single PDF file and subject line set to Application for Ph.D., addressed directly to Prof. Christian Cachin at crypto (at) inf.unibe.ch.
Since we receive many applications, we encourage you to include material that demonstrates your interests and strengths and sets you apart from others.
For more information, please contact Christian Cachin (https://crypto.unibe.ch/cc/).
Closing date for applications:
Contact: Christian Cachin < crypto (at) inf.unibe.ch >
More information: https://crypto.unibe.ch/
Masaryk University, Brno, Czechia
Job PostingThe Dean of the Faculty of Informatics, Masaryk University, invites applications for one position of Assistant Professor in Cybersecurity, with the Department of Computer Systems and Communications.
Applications due: February 28, 2021
Employment start date: By mutual agreement
This position is aimed to strengthen the work of the Centre for Research on Cryptography and Security (CRoCS - https://crocs.fi.muni.cz/) at the Faculty of Informatics. CRoCS works to improve security and privacy of real-world solutions through applied research (often in cooperation with industry) and advanced education of future security professionals. System security or network security focus are most desired, yet the abilities to work with a team of graduate students and faculty on research targeting top security/crypto conferences and to engage both undergraduate and graduate students in both educational and research exercises are most critical.
Job description keypoints:
- Active international cooperation, in both research and education.
- Involvement in teaching in the cybersecurity area.
- Supervision of Master/Bachelor theses and consultancy or co-supervision of PhDs.
- Involvement in expanding industrial cooperation in the cybersecurity area.
- Expert knowledge in at least one of the areas covered by courses:
- PV181 Laboratory of security and applied cryptography {https://is.muni.cz/course/fi/podzim2019/PV181};
- PA193 Secure coding principles and practices {https://is.muni.cz/course/fi/podzim2019/PA193}.
- PA197 Secure Network Design {https://is.muni.cz/course/fi/jaro2020/PA197}.
Closing date for applications:
Contact: Vashek Matyas
More information: https://www.muni.cz/en/about-us/careers/vacancies/59434