Daniele Venturi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Daniele Venturi has a total of 105 co-authors. Here are the top co-authors by number of shared publications:
- Daniele Friolo
Sapienza University of Rome
10 shared publications - Danilo Francati
Royal Holloway, University of London
10 shared publications - Antonio Faonio
EURECOM
9 shared publications - Jesper Buus Nielsen
Aarhus University
8 shared publications Pratyay Mukherjee
Visa Research, Palo Alto, USA
8 shared publicationsSebastian Faust
Technical University of Darmstadt, Darmstadt, Germany
8 shared publications
Latest Publications
- Open Access
- 10 November 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (11) , 220
New directions in evolving secret sharing: adaptive security and more access structures
Evolving secret sharing (Komargodski, Naor, and Yogev, TCC 2016) allows a dealer to share a secret value in an online manner, without knowing the access structure or the maximum number of parties in advance, and without ever updating the shares of older players. In this paper, we continue the study of evolving secret sharing schemes in the computational setting, as first considered by Francati and Venturi (ASIACRYPT 2024), where the number of parties is upper bounded by an unknown polynomial and the privacy property only holds against computationally-bounded adversaries. We provide three main contributions. First, we formalize adaptive security for evolving secret sharing, introducing two natural notions—semi-adaptive and fully-adaptive—and establish a precise relationship between them. We show that semi-adaptive security implies fully-adaptive security with a loss that depends on the description size of the evolving access structure. For succinctly representable structures, this loss is polynomial. Second, we present generic compilers that transform non-evolving secret sharing schemes into evolving ones. Assuming one-way functions, we obtain evolving schemes in which the n -th share essentially aggregates the shares corresponding to the other $$n-1$$ parties; assuming trapdoor permutations in the random oracle model and starting from an adaptively secure non-evolving scheme, we obtain fully-adaptively secure evolving schemes, that incur the same aggregation cost, plus an additional overhead linear in the number of parties. Together, these results establish a natural upper bound on the share size of evolving secret sharing for natural families of access structures. Third, we prove that an existing construction for monotone circuits evolving access structures achieves adaptive security for constant-depth circuits, under standard cryptographic assumptions. Overall, our results provide a systematic treatment of adaptive security in evolving secret sharing and demonstrate that it can be generically achieved with controlled overhead under standard assumptions.- 10 November 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (11) , 220
Open AccessNew directions in evolving secret sharing: adaptive security and more access structures
Evolving secret sharing (Komargodski, Naor, and Yogev, TCC 2016) allows a dealer to share a secret value in an online manner, without knowing the access structure or the maximum number of parties in advance, and without ever updating the shares of older players. In this paper, we continue the study of evolving secret sharing schemes in the computational setting, as first considered by Francati and Venturi (ASIACRYPT 2024), where the number of parties is upper bounded by an unknown polynomial and the privacy property only holds against computationally-bounded adversaries. We provide three main contributions. First, we formalize adaptive security for evolving secret sharing, introducing two natural notions—semi-adaptive and fully-adaptive—and establish a precise relationship between them. We show that semi-adaptive security implies fully-adaptive security with a loss that depends on the description size of the evolving access structure. For succinctly representable structures, this loss is polynomial. Second, we present generic compilers that transform non-evolving secret sharing schemes into evolving ones. Assuming one-way functions, we obtain evolving schemes in which the n -th share essentially aggregates the shares corresponding to the other $$n-1$$ parties; assuming trapdoor permutations in the random oracle model and starting from an adaptively secure non-evolving scheme, we obtain fully-adaptively secure evolving schemes, that incur the same aggregation cost, plus an additional overhead linear in the number of parties. Together, these results establish a natural upper bound on the share size of evolving secret sharing for natural families of access structures. Third, we prove that an existing construction for monotone circuits evolving access structures achieves adaptive security for constant-depth circuits, under standard cryptographic assumptions. Overall, our results provide a systematic treatment of adaptive security in evolving secret sharing and demonstrate that it can be generically achieved with controlled overhead under standard assumptions. - 12 August 2026
- Published by Springer Nature
- p. 231-262
Towards Practical Committee Sizes in YOSO MPC
- Open Access
- 1 January 2026
- Published by Walter de Gruyter GmbH in Journal of Mathematical Cryptology
- Vol. 20 (1)
On integer sequences in cryptography
Integer sequences play a pivotal role in cryptography, acting as foundational elements for numerous cryptographic algorithms. This comprehensive investigation examines integer sequences that have significantly impacted the sector in domains such as key generation, hash function design, and encryption protocol development, including their specific implementations. We conduct an unprecedented systematic review of existing literature, analysing fundamental properties of these sequences and detailing their contributions to well-established cryptographic areas. In addition, the research emphasises the various strengths and limitations associated with these sequences, as well as their practical applications in the realm of digital information security. This is accomplished by developing a categorisation framework that facilitates mapping of their contributions. Furthermore, this framework can be used as a reference point for future analyses in this field. In conclusion, this research underscores the potential for further discovery and innovative applications of integer sequences in the cryptographic field.
- 1 January 2026
- Published by Walter de Gruyter GmbH in Journal of Mathematical Cryptology
- Vol. 20 (1)
Open AccessOn integer sequences in cryptography
Integer sequences play a pivotal role in cryptography, acting as foundational elements for numerous cryptographic algorithms. This comprehensive investigation examines integer sequences that have significantly impacted the sector in domains such as key generation, hash function design, and encryption protocol development, including their specific implementations. We conduct an unprecedented systematic review of existing literature, analysing fundamental properties of these sequences and detailing their contributions to well-established cryptographic areas. In addition, the research emphasises the various strengths and limitations associated with these sequences, as well as their practical applications in the realm of digital information security. This is accomplished by developing a categorisation framework that facilitates mapping of their contributions. Furthermore, this framework can be used as a reference point for future analyses in this field. In conclusion, this research underscores the potential for further discovery and innovative applications of integer sequences in the cryptographic field.
- 8 December 2025
- Published by Springer Nature
- p. 67-98
Taming Adaptive Security and New Access Structures in Evolving Secret Sharing
- 8 December 2025
- Published by Springer Nature
- p. 67-98
Taming Adaptive Security and New Access Structures in Evolving Secret Sharing
- 7 June 2025
- Published by Springer Nature
- p. 173-180
MARTSIA: A Tool for Confidential Data Exchange via Public Blockchain
- 7 June 2025
- Published by Springer Nature
- p. 173-180
MARTSIA: A Tool for Confidential Data Exchange via Public Blockchain
- Open Access
- 6 June 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- p. 1-53
Evolving secret sharing revisited: computational security and succinctness
Evolving secret sharing (Komargodski, Naor, and Yogev, TCC’16) generalizes the notion of secret sharing to the setting of evolving access structures, in which the share holders are added to the system in an online manner, and where the dealer does not know neither the access structure nor the maximum psnber of parties in advance. Here, the main difficulty is to distribute shares to the new players without updating the shares of old players; moreover, one would like to minimize the share size as a function of the psnber of players. In this paper, we initiate a systematic study of evolving secret sharing in the computational setting, where the maximum psnber of parties is polynomial in the security parameter, but the dealer still does not know this value, neither it knows the access structure in advance. Moreover, the privacy guarantee only holds against computationally bounded adversaries corrupting an unauthorized subset of the players. Our main result is that for many interesting, and practically relevant, evolving access structures, under standard hardness assumptions, there exist efficient secret sharing schemes with computational privacy and in which the shares are succinct (i.e., much smaller compared to the size of a natural computational representation of the evolving access structure). These access structures include evolving graphs access structures, threshold access structures, and monotone circuits/DNF/CNF access structures meeting an additional rigidity property that we show to be necessary if one wants to avoid updating the shares of old parties.
- 6 June 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- p. 1-53
Open AccessEvolving secret sharing revisited: computational security and succinctness
Evolving secret sharing (Komargodski, Naor, and Yogev, TCC’16) generalizes the notion of secret sharing to the setting of evolving access structures, in which the share holders are added to the system in an online manner, and where the dealer does not know neither the access structure nor the maximum psnber of parties in advance. Here, the main difficulty is to distribute shares to the new players without updating the shares of old players; moreover, one would like to minimize the share size as a function of the psnber of players. In this paper, we initiate a systematic study of evolving secret sharing in the computational setting, where the maximum psnber of parties is polynomial in the security parameter, but the dealer still does not know this value, neither it knows the access structure in advance. Moreover, the privacy guarantee only holds against computationally bounded adversaries corrupting an unauthorized subset of the players. Our main result is that for many interesting, and practically relevant, evolving access structures, under standard hardness assumptions, there exist efficient secret sharing schemes with computational privacy and in which the shares are succinct (i.e., much smaller compared to the size of a natural computational representation of the evolving access structure). These access structures include evolving graphs access structures, threshold access structures, and monotone circuits/DNF/CNF access structures meeting an additional rigidity property that we show to be necessary if one wants to avoid updating the shares of old parties.