1 citations · 1 across the 12 of their papers we have counts for
5 papers · 1 filter
Verifiable Homomorphic Linear Combinations in Multi-Instance Time-Lock Puzzles
Aydin Abadi
Time-Lock Puzzles (TLPs) have been developed to securely transmit sensitive information into the future without relying on a trusted third party. Multi-instance TLP is a scalable v…
Privacy-Preserving Data Deduplication for Enhancing Federated Learning of Language Models (Extended Version)
Aydin Abadi, Vishnu Asutosh Dasu, Sumanta Sarkar
Deduplication is a vital preprocessing step that enhances machine learning model performance and saves training time and energy. However, enhancing federated learning through dedup…
Delegated-Query Oblivious Transfer and its Practical Applications
Yvo Desmedt, Aydin Abadi
Databases play a pivotal role in the contemporary World Wide Web and the world of cloud computing. Unfortunately, numerous privacy violations have recently garnered attention in th…
Supersonic OT: Fast Unconditionally Secure Oblivious Transfer
Aydin Abadi, Yvo Desmedt
Oblivious Transfer (OT) is a fundamental cryptographic protocol with applications in secure Multi-Party Computation, Federated Learning, and Private Set Intersection. With the adve…
Tempora-Fusion: Time-Lock Puzzle with Efficient Verifiable Homomorphic Linear Combination
Aydin Abadi, Jakub K. Szelag
We present Tempora-Fusion, the first homomorphic TLP scheme with efficient public verification of both individual puzzle solutions and homomorphic linear combinations. Tempora-Fusi…