IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
27 December 2022
Andreas Klinger, Ulrike Meyer
zhenfei zhang
Orestis Alpos, Zhipeng Wang, Alireza Kavousi, Sze Yiu Chau, Duc Le, Christian Cachin
This paper introduces the concept of digital signature with key extraction (DSKE). In such schemes, signers can have plausible deniability by demonstrating that a group of recipients can collectively extract the signing key, while, within a certain threshold, the signature deterministically proves message authenticity. We give a formal definition of DSKE, as well as two provably secure constructions, one based on hash-based digital signatures and the other based on polynomial commitments. Later, we propose a forward-forgeable signature construction, GroupForge, by combining DSKE constructions with Merkle trees and timestamps to have a "short-lived" signature with extractable sets that can act as deniable groups under a fixed public key. Finally, we demonstrate that GroupForge can replace Keyforge in the non-attributable email protocol of Specter, Park, and Green (USENIX Sec '21), hence eliminating the need to continuously disclose outdated private keys.
Shaza Elsharief, Lilas Alrahis, Johann Knechtel, Ozgur Sinanoglu
Here we propose IsoLock, a provably-secure locking scheme that utilizes isomorphic structures which ML models and other structural methods cannot discriminate. Unlike prior work, IsoLock’s security promise neither relies on re-synthesis nor on dedicated sub-circuits. Instead, IsoLock introduces isomorphic key-gate structures within the design via systematic routing obfuscation. We theoretically prove the security of IsoLock against modeling attacks. Further, we lock ISCAS-85 and ITC-99 benchmarks and launch state-of-the-art ML attacks, SCOPE and MuxLink, as well as the Redundancy and SAAM attacks, which only decipher an average of 0–6% of the key, well confirming the resilience of IsoLock. All in all, IsoLock is proposed to break the cycle of “cat and mouse” in locking and attack studies, through a provably-secure locking approach against structural ML attacks.
Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard
Kevin Carrier, Yixin Shen, Jean-Pierre Tillich
Paolo Santini, Marco Baldi, Franco Chiaraluce
25 December 2022
Pascal Lafourcade, Gael Marcadet, Léo Robert
Adithya Vadapalli, Ryan Henry, Ian Goldberg
Francisco Blas Izquierdo Riera, Magnus Almgren, Pablo Picazo-Sanchez, Christian Rohner
Aggelos Kiayias, Feng-Hao Liu, Yiannis Tselekounis
We show that this tool has many interesting applications to non-malleable cryptography. Particularly, we can derive efficient, continuously non-malleable, leakage-resilient codes against split-state attackers (TCC '14), both in the CRS and the RO model. Additionally, we can obtain succinct non-interactive non-malleable commitments both in the CRS and the RO model, satisfying a stronger definition than the prior ones by Crescenzo et al. (STOC '98), and Pass and Rosen (STOC '05), in the sense that the simulator does not require access to the original message, while the attacker's auxiliary input is allowed to depend on it.
Thomas Debris-Alazard, Nicolas Resch
Dario Fiore, Lydia Garms, Dimitris Kolonelos, Claudio Soriente, Ida Tucker
Lih-Chung Wang, Po-En Tseng, Yen-Liang Kuan, Chun-Yen Chou
Bhuvnesh Chaturvedi, Anirban Chakraborty, Ayantika Chatterjee, Debdeep Mukhopadhyay
23 December 2022
University of Surrey, UK
Closing date for applications:
Contact: Rizwan Asghar
More information: https://jobs.surrey.ac.uk/Vacancy.aspx?id=12976&forced=1
Worldline, Courbevoie - La Défense, France
Closing date for applications:
Contact: Kalpana Singh
More information: https://jobs.worldline.com/Worldline/job/Courbevoie-La-D%C3%A9fense-92-Stage-White-Box-Implementations-Attacks-and-Secure-Designs-Ile/760601602/
TU Darmstadt
Your profile:
- Completed Master's degree (or equivalent) with excellent grades in computer science, mathematics, or a similar area.
- Strong mathematical and/or algorithmic/theoretical CS background
- Good knowledge in one of the topics mentioned above is a plus.
- Fluent in English
TU Darmstadt is a top research university for IT Security, Cryptography, and Computer Science in Europe. We offer an excellent working environment in the heart of the Frankfurt Metropolitan Area, which is internationally well-known for its high quality of life. The review of applications starts immediately until the position is filled.
Closing date for applications:
Contact: Sebastian Faust (office.cac@cysec.de)
University of Surrey, UK
Applications are invited for a 1-year Research Fellow (with the possibility of extension) in Applied Cryptography, to work full-time on an EPSRC-funded project “AP4L: Adaptive PETs to Protect & emPower People during Life Transitions”. The successful post holder is expected to start on 1 Mar 2023 or as soon as possible thereafter and will be based in the Department of Computer Science and its highly regarded Surrey Centre for Cyber Security (SCCS), working with Dr. Cătălin Drăgan, Prof. Nishanth Sastry, Prof. Steve Schneider and Prof. Helen Treharne.
Application Details (including the application link) https://jobs.surrey.ac.uk/Vacancy.aspx?id=12909
Closing date for applications:
Contact: Dr. Cătalin Drăgan (c.dragan@surrey.ac.uk), or Prof. Nishanth Sastry (n.sastry@surrey.ac.uk), Prof. Steve Schneider (s.schneider@surrey.ac.uk).
More information: https://jobs.surrey.ac.uk/Vacancy.aspx?id=12909
Algemetric, Colorado Springs, Colorado, USA
Algemetric is a tech startup committed to delivering efficient, user-friendly, secure, and privacy-preserving solutions for organizations interested in extracting the most value from their data in all stages of the data lifecycle.
We have a customer-centric approach to privacy-preserving solutions with deployed applications in the real world. We are currently expanding our operations worldwide.
We are looking for a cryptography researcher with a track record of research and publications in cryptography in any area, preferably related to privacy-enhancing technologies. As a cryptography researcher, you will work directly with a team of mathematicians, research engineers, and computer scientists, engage with cryptography and industry experts, and work with exciting real-world applications in a straightforward expansion process.
Requirements:
- Track record of publications in cryptography.
- Ph.D. degree in cryptography, mathematics, computer science, or related degrees.
- 2-3 years of experience post-PhD (either in the industry or academia).
- Status/Visa that allows immediate employment in the US.
Preferable:
- Hands-on experience with multiparty computation and homomorphic encryption.
- Experience leading and/or willingness to lead other researchers.
This is an in-person role for our office in Colorado Springs, Colorado, United States.
What we offer:
- Competitive salary compatible with experience.
- Benefits include health, dental, vision, life, short/long-term disability insurance, workmen’s compensation insurance, participation in our Premium Only plan, and 401(k).
- Annual performance review.
- Relocation support.
Closing date for applications:
Contact: If you are interested, please email jobs@algemetric.com with a cover letter and your resume.
More information: https://www.algemetric.com/