Follow
Gayathri Garimella
Gayathri Garimella
Verified email at oregonstate.edu - Homepage
Title
Cited by
Cited by
Year
Oblivious key-value stores and amplification for private set intersection
G Garimella, B Pinkas, M Rosulek, N Trieu, A Yanai
Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021
1172021
Private set operations from oblivious switching
G Garimella, P Mohassel, M Rosulek, S Sadeghian, J Singh
IACR International Conference on Public-Key Cryptography, 591-617, 2021
612021
Structure-aware private set intersection, with applications to fuzzy matching
G Garimella, M Rosulek, J Singh
Annual International Cryptology Conference, 323-352, 2022
212022
Secret-shared joins with multiplicity from aggregation trees
S Badrinarayanan, S Das, G Garimella, S Raghuraman, P Rindal
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications …, 2022
152022
Malicious secure, structure-aware private set intersection
G Garimella, M Rosulek, J Singh
Annual International Cryptology Conference, 577-610, 2023
92023
Crash-tolerant consensus in directed graph revisited
A Choudhury, G Garimella, A Patra, D Ravi, P Sarkar
Structural Information and Communication Complexity: 25th International …, 2018
52018
Round efficient computationally secure multi-party computation revisited
L Bangalore, A Choudhury, G Garimella
Proceedings of the 20th International Conference on Distributed Computing …, 2019
22019
Computation Efficient Structure-Aware PSI from Incremental Function Secret Sharing
G Garimella, B Goff, P Miao
Annual International Cryptology Conference, 309-345, 2024
12024
Brief announcement: Crash-tolerant consensus in directed graph revisited
A Choudhury, G Garimella, A Patra, D Ravi, P Sarkar
31st International Symposium on Distributed Computing (DISC 2017), 2017
12017
Distributional Secure Merge
G Garimella, S Raghuramam, P Rindal
Cryptology ePrint Archive, 2024
2024
Communication efficient private set and database operations
GA Garimella
2023
The system can't perform the operation now. Try again later.
Articles 1–11