GIANLUCA BRIAN

Dottore di ricerca

ciclo: XXXV


co-supervisore: Prof. Daniele Venturi

Titolo della tesi: Non-malleable secret sharing against joint tampering attacks

Since thousands of years ago, the goal of cryptography has been to hide messages from prying eyes. In recent times, cryptography two important changes: first, cryptography itself evolved from just being about encryption to a broader class of situations coming from the digital era; second, the way of studying cryptography evolved from creating ``seemingly hard'' cryptographic schemes to constructing schemes which are provably secure. However, once the mathematical abstraction of cryptographic primitives started to be too hard to break, attackers found another way to defeat security. Side channel attacks have been proved to be very effective in this task, breaking the security of otherwise provably secure schemes. Because of this, recent trends in cryptography aim to capture this situation and construct schemes that are secure even against such powerful attacks. In this setting, this thesis specializes in the study of secret sharing, an important cryptographic primitive that allows to balance privacy and integrity of data and also has applications to multi-party protocols. Namely, continuing the trend which aims to protect against side channel attacks, this thesis brings some contributions to the state of the art of the so-called leakage-resilient and non-malleable secret sharing schemes, which have stronger guarantees against attackers that are able to learn information from possibly all the shares and even tamper with the shares and see the effects of the tampering. The main contributions of this thesis are twofold. First, we construct secret sharing schemes that are secure against a very powerful class of attacks which, informally, allows the attacker to jointly leak some information and tamper with the shares in a continuous fashion. Second, we study the capacity of continuously non-malleable secret sharing schemes, that is, the maximum achievable information rate. Roughly speaking, we find some lower bounds to the size that the shares must have in order to achieve some forms of non-malleability.

Produzione scientifica

11573/1673701 - 2022 - The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free
Brian, G.; Faonio, A.; Obremski, M.; Ribeiro, J.; Simkin, M.; Skorski, M.; Venturi, D. - 01a Articolo in rivista
rivista: IEEE TRANSACTIONS ON INFORMATION THEORY (IEEE / Institute of Electrical and Electronics Engineers Incorporated:445 Hoes Lane:Piscataway, NJ 08854:(800)701-4333, (732)981-0060, EMAIL: subscription-service@ieee.org, INTERNET: http://www.ieee.org, Fax: (732)981-9667) pp. 8197-8227 - issn: 0018-9448 - wos: WOS:000891796100029 (0) - scopus: 2-s2.0-85135765130 (0)

11573/1673698 - 2022 - Short Non-Malleable Codes from Related-Key Secure Block Ciphers, Revisited
Brian, G.; Faonio, A.; Ribeiro, J.; Venturi, D. - 01a Articolo in rivista
rivista: IACR TRANSACTION ON SYMMETRIC CRYPTOLOGY (Bochum: International Association for Cryptologic Research) pp. 1-19 - issn: 2519-173X - wos: WOS:000869410400001 (0) - scopus: 2-s2.0-85137697222 (2)

11573/1673696 - 2022 - Continuously Non-malleable Codes Against Bounded-Depth Tampering
Brian, Gianluca; Faust, Sebastian; Micheli, Elena; Venturi, Daniele - 04b Atto di convegno in volume
congresso: 28th Annual International Conference on the Theory and Application of Cryptology and Information Security (Taipei)
libro: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) - (978-3-031-22971-8; 978-3-031-22972-5)

11573/1575150 - 2021 - The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free
Brian, G.; Faonio, A.; Obremski, M.; Ribeiro, J.; Simkin, M.; Skorski, M.; Venturi, D. - 04b Atto di convegno in volume
congresso: 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2021 (hrv)
libro: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) - (978-3-030-77885-9; 978-3-030-77886-6)

11573/1618013 - 2021 - Continuously Non-malleable Secret Sharing: Joint Tampering, Plain Model and Capacity
Brian, G.; Faonio, A.; Venturi, D. - 04b Atto di convegno in volume
congresso: 19th International Conference on Theory of Cryptography, TCC 2021 (usa)
libro: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) - (978-3-030-90452-4; 978-3-030-90453-1)

11573/1469643 - 2020 - Non-malleable secret sharing against bounded joint-tampering attacks in the plain model
Brian, G.; Faonio, A.; Obremski, M.; Simkin, M.; Venturi, D. - 04b Atto di convegno in volume
congresso: 40th Annual International Cryptology Conference, CRYPTO 2020 (usa)
libro: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) - (978-3-030-56876-4; 978-3-030-56877-1)

11573/1356500 - 2019 - Continuously Non-malleable Secret Sharing for General Access Structures
Brian, G.; Faonio, A.; Venturi, D. - 04b Atto di convegno in volume
congresso: 17th International Conference on Theory of Cryptography, TCC 2019 (Nuremberg; Germany)
libro: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) - (978-3-030-36032-0; 978-3-030-36033-7)

© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma