Ida Tucker

I am a Cryptography Engineer at Zondax AG. I work on embedded software allowing to provide ledger support for privacy preserving blockchain protocols.

Prior to this, I was a Post Doctoral researcher at the IMDEA Software Institute in Madrid under the direction of Dario Fiore, where I worked on the construction of provably secure advanced cryptographic primitives.

I did my PhD at the LIP laboratory, ENS de Lyon, between October 2017 and October 2020, under the direction of Guilhem Castagnos and Fabien Laguillaumie. During my PhD, I worked on enriching the CL framework, a class group based framework allowing for the design of cryptographic protocols. I also designed advanced cryptosystems from this framework, such as functional encryption schemes computing the inner product functionality, and threshold signature protocols for the ECDSA signing algorithm.

International Journals

1. A tighter proof for CCA secure inner product functional encryption: Genericity meets efficiency. G. Castagnos, F. Laguillaumie and I. Tucker. In Theor. Comput. Sci. 2022. [share link]
   
   
2. Hardware Security without Secure Hardware: How to Decrypt with a Password and a Server . O. Blazy, L. Brouilhet, C. Chevalier, P. Towa, I. Tucker, and D. Vergnaud. In Theor. Comput. Sci. 2021. [share link] [open access]
   
   

International Conferences

1. Additive-Homomorphic Functional Commitments and Applications to Homomorphic Signatures. D. Catalano, D. Fiore and I. Tucker. In Proc. of Asiacrypt 2022.
   
   
2. Threshold Linearly Homomorphic Encryption on Z/2^kZ. G. Castagnos, F. Laguillaumie and I. Tucker. In Proc. of Asiacrypt 2022. [open access]
   
   
3. Efficient Zero-Knowledge Proofs on Signed Data with Applications to Verifiable Computation on Data Streams. D. Fiore and I. Tucker. In ACM CCS 2022.
   
   
4. Ring Signatures with User-Controlled Linkability. D. Fiore, L. Garms, D. Kolonelos, C. Soriente and I. Tucker. In Computer Security – ESORICS 2022. [share link]
   
   
5. Practical Fully Secure Unrestricted Inner Product Functional Encryption modulo p. G. Castagnos, F. Laguillaumie and I. Tucker. In Proc. of Asiacrypt 2018. Copyright IACR [open access]
   
   
6. Two-Party ECDSA from Hash Proof Systems and Efficient Instantiations. D. Catalano, G. Castagnos, F. Laguillaumie, F. Savasta and I. Tucker. In Proc. of CRYPTO 2019. Copyright IACR [open access]
   
   
7. Bandwidth-efficient threshold EC-DSA. D. Catalano, G. Castagnos, F. Laguillaumie, F. Savasta and I. Tucker. In Proc. of PKC 2020. Copyright IACR [open access]
   
   

2019-2020

• Computer Algebra (2020) taught by Prof. Dr. Guillaume Hanrot, Prof. Dr. Stéphan Thomassé at the École Normale Supérieure de Lyon.
• Computer Architecture (LIFASR3) taught by Ladjal Hamid at the Université Claude Bernard Lyon 1.
• Cryptography and Security (M1IF29) taught by Fabien Laguillaumie at the Université Claude Bernard Lyon 1. You can download the works sheets here .

2018-2019

• Operating Systems (LIFASR5) taught by Nicolas Louvet at the Université Claude Bernard Lyon 1.
• Introduction to Web Programing and Networks (LIFASR2) taught by Olivier Glück at the Université Claude Bernard Lyon 1.
• Cryptography and Security (M1IF29) taught by Fabien Laguillaumie at the Université Claude Bernard Lyon 1.

2017-2018

• Introduction to Web Programing and Networks (LIFASR2) taught by Olivier Glück at the Université Claude Bernard Lyon 1.
• Cryptography and Security (M1IF29) taught by Fabien Laguillaumie at the Université Claude Bernard Lyon 1.

2016-2017

• Assisted in the practical teaching of the Software Security course, taught by Emanuel Fleury at the Université de Bordeaux.
• One to one tutoring in Mathematics to bachelor students of the Université de Bordeaux.