Nishat Koti

Orcid: 0000-0003-4923-8215

According to our database1, Nishat Koti authored at least 26 papers between 2015 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Match Quest: Fast and Secure Pattern Matching.
Proc. Priv. Enhancing Technol., 2025

MultiCent: Secure and Scalable Computation of Centrality Measures on Multilayer Graphs.
Proc. Priv. Enhancing Technol., 2025

emGraph: Efficient Multiparty Secure Graph Computation.
IACR Cryptol. ePrint Arch., 2025

A note on the soundness of an optimized gemini variant.
IACR Cryptol. ePrint Arch., 2025

MultiCent: Secure and Scalable Centrality Measures on Multilayer Graphs.
IACR Cryptol. ePrint Arch., 2025

2024
Vogue: Faster Computation of Private Heavy Hitters.
IEEE Trans. Dependable Secur. Comput., 2024

Asterisk: Super-fast MPC with a Friend.
Proceedings of the IEEE Symposium on Security and Privacy, 2024

Graphiti: Secure Graph Computation Made More Scalable.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023
MPClan: Protocol Suite for Privacy-Conscious Computations.
J. Cryptol., July, 2023

CompactTag: Minimizing Computation Overheads in Actively-Secure MPC for Deep Neural Networks.
IACR Cryptol. ePrint Arch., 2023

Entrada to Secure Graph Convolutional Networks.
IACR Cryptol. ePrint Arch., 2023

sfAsterisk: Super-fast MPC with a Friend.
IACR Cryptol. ePrint Arch., 2023

Ruffle: Rapid 3-party shuffle protocols.
IACR Cryptol. ePrint Arch., 2023

Shield: Secure Allegation Escrow System with Stronger Guarantees.
Proceedings of the ACM Web Conference 2023, 2023

2022
MPClan: Protocol Suite for Privacy-Conscious Computations.
IACR Cryptol. ePrint Arch., 2022

Find Thy Neighbourhood: Privacy-Preserving Local Clustering.
IACR Cryptol. ePrint Arch., 2022

Tetrad: Actively Secure 4PC for Secure Training and Inference.
Proceedings of the 29th Annual Network and Distributed System Security Symposium, 2022

Poster MPClan: : Protocol Suite for Privacy-Conscious Computations.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

PentaGOD: Stepping beyond Traditional GOD with Five Parties.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

Poster: Vogue: Faster Computation of Private Heavy Hitters.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

Attaining GOD Beyond Honest Majority with Friends and Foes.
Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2021
SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning.
Proceedings of the 30th USENIX Security Symposium, 2021

2016
Group-oriented encryption for dynamic groups with constant rekeying cost.
Secur. Commun. Networks, 2016

2015
On the Security of an Efficient Group Key Agreement Scheme for MANETs.
IACR Cryptol. ePrint Arch., 2015

Non-tree Based Group Key Management Scheme With Constant Rekeying and Storage Cost.
Proceedings of the Third International Symposium on Women in Computing and Informatics, 2015

Security analysis of tree and non-tree based group key management schemes under strong active outsider attack model.
Proceedings of the 2015 International Conference on Advances in Computing, 2015


  Loading...