Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Danilo Francati"'
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031313707
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c9797672d5ba9a6e6eaac5d9ea813b52
https://doi.org/10.1007/978-3-031-31371-4_3
https://doi.org/10.1007/978-3-031-31371-4_3
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031313707
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e0fa1db5e7295e15ec18431ef51049fa
https://doi.org/10.1007/978-3-031-31371-4_23
https://doi.org/10.1007/978-3-031-31371-4_23
Publikováno v:
Advances in Cryptology – EUROCRYPT 2023 ISBN: 9783031306198
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::31e3899c96dd5e90d299956a2ff1bfd9
https://doi.org/10.1007/978-3-031-30620-4_19
https://doi.org/10.1007/978-3-031-30620-4_19
Publikováno v:
Ateniese, G, Francati, D, Magri, B & Venturi, D 2021, ' Immunization against complete subversion without random oracles ', Theoretical Computer Science, vol. 859, pp. 1-36 . https://doi.org/10.1016/j.tcs.2021.01.002
We seek constructions of general-purpose immunizers that take arbitrary cryptographic primitives, and transform them into ones that withstand a powerful “malicious but proud” adversary, who attempts to break security by possibly subverting the im
Publikováno v:
Pasquini, D, Francati, D & Ateniese, G 2022, Eluding Secure Aggregation in Federated Learning via Model Inconsistency . in CCS 2022-Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security . Association for Computing Machinery, Proceedings of the ACM Conference on Computer and Communications Security, pp. 2429-2443, 28th ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, United States, 07/11/2022 . https://doi.org/10.1145/3548606.3560557
Secure aggregation is a cryptographic protocol that securely computes the aggregation of its inputs. It is pivotal in keeping model updates private in federated learning. Indeed, the use of secure aggregation prevents the server from learning the val
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f73ac397714eb77c29a006283d042b8f
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030925178
Francati, D, Guidi, A, Russo, L & Venturi, D 2021, ' Identity-Based Matchmaking Encryption without Random Oracles ', 22nd International Conference on Cryptology in India, Jaipur, India, 13/12/2021-15/12/2021 .
Francati, D, Guidi, A, Russo, L & Venturi, D 2021, ' Identity-Based Matchmaking Encryption without Random Oracles ', 22nd International Conference on Cryptology in India, Jaipur, India, 13/12/2021-15/12/2021 .
Identity-based matchmaking encryption (IB-ME) is a generalization of identity-based encryption where the sender and the receiver can both specify a target identity: If both the chosen target identities match the one of the other party, the plaintext
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7dd149a375f4c2c9718925e3312947f1
https://doi.org/10.1007/978-3-030-92518-5_19
https://doi.org/10.1007/978-3-030-92518-5_19
Publikováno v:
Cryptology and Network Security ISBN: 9783030654108
CANS
CANS
This work presents Arcula, a new design for hierarchical deterministic wallets that brings identity-based public keys to the blockchain. Arcula is built on top of provably secure cryptographic primitives. It generates all its cryptographic secrets fr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::78f2efc513c23689dea920a9eabd26e8
https://doi.org/10.1007/978-3-030-65411-5_16
https://doi.org/10.1007/978-3-030-65411-5_16
Publikováno v:
Applied Cryptography and Network Security ISBN: 9783030215675
ACNS
Ateniese, G, Francati, D, Magri, B & Venturi, D 2019, Public immunization against complete subversion without random oracles . in R H Deng, V Gauthier-Umanã, M Ochoa & M Yung (eds), Applied Cryptography and Network Security . Springer, Cham, Lecture Notes in Computer Science, vol. 11464, pp. 465-485, 17th International Conference on Applied Cryptography and Network Security (ACNS), Bogota, Colombia, 05/06/2019 . https://doi.org/10.1007/978-3-030-21568-2_23
ACNS
Ateniese, G, Francati, D, Magri, B & Venturi, D 2019, Public immunization against complete subversion without random oracles . in R H Deng, V Gauthier-Umanã, M Ochoa & M Yung (eds), Applied Cryptography and Network Security . Springer, Cham, Lecture Notes in Computer Science, vol. 11464, pp. 465-485, 17th International Conference on Applied Cryptography and Network Security (ACNS), Bogota, Colombia, 05/06/2019 . https://doi.org/10.1007/978-3-030-21568-2_23
We seek constructions of general-purpose immunizers that take arbitrary cryptographic primitives, and transform them into ones that withstand a powerful "malicious but proud" adversary, who attempts to break security by possibly subverting the implem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::300d2e6f0181ff7a695047282795e8b0
http://hdl.handle.net/11573/1356468
http://hdl.handle.net/11573/1356468
Autor:
Giuseppe Giordano, Abdoulaye Faye, Danilo Francati, Andrea Maria Milazzo, Angelo Massimo Perillo, Luca Schiatti, Giuseppe Ateniese
The cloud changed the way we manage and store data. Today, cloud storage services offer clients an infrastructure that allows them a convenient source to store, replicate, and secure data online. However, with these new capabilities also come limitat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1f89564c2226544229d9caf4f8ad2099