Divya Gupta

Orcid: 0000-0002-5255-350X

Affiliations:
  • Microsoft Research India, Bangalore, India
  • UCLA, USA (PhD)


According to our database1, Divya Gupta authored at least 56 papers between 2012 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Enterprise AI Must Enforce Participant-Aware Access Control.
CoRR, September, 2025

Matchmaker: Fast Secure Inference across Deployment Scenarios.
IACR Cryptol. ePrint Arch., 2025

SHARK: Actively Secure Inference Using Function Secret Sharing.
Proceedings of the IEEE Symposium on Security and Privacy, 2025

2024
Communication Efficient Secure and Private Multi-Party Deep Learning.
IACR Cryptol. ePrint Arch., 2024

Private Benchmarking to Prevent Contamination and Improve Comparative Evaluation of LLMs.
CoRR, 2024

TrustRate: A Decentralized Platform for Hijack-Resistant Anonymous Reviews.
CoRR, 2024

Orca: FSS-based Secure Training and Inference with GPUs.
Proceedings of the IEEE Symposium on Security and Privacy, 2024

Securely Training Decision Trees Efficiently.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

Secure Sorting and Selection via Function Secret Sharing.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023
Orca: FSS-based Secure Training with GPUs.
IACR Cryptol. ePrint Arch., 2023

End-to-end Privacy Preserving Training and Inference for Air Pollution Forecasting with Data from Rival Fleets.
IACR Cryptol. ePrint Arch., 2023

SIGMA: Secure GPT Inference with Function Secret Sharing.
IACR Cryptol. ePrint Arch., 2023

Privacy Preserving Multi-Agent Reinforcement Learning in Supply Chains.
CoRR, 2023

Secure Floating-Point Training.
Proceedings of the 32nd USENIX Security Symposium, 2023

2022
LLAMA: A Low Latency Math Library for Secure Inference.
IACR Cryptol. ePrint Arch., 2022

Efficient ML Models for Practical Secure Inference.
CoRR, 2022

SIMC: ML Inference Secure Against Malicious Clients at Semi-Honest Cost.
Proceedings of the 31st USENIX Security Symposium, 2022

SecFloat: Accurate Floating-Point meets Secure 2-Party Computation.
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022

2021
SIRNN: A Math Library for Secure RNN Inference.
IACR Cryptol. ePrint Arch., 2021

Circuit-PSI with Linear Complexity via Relaxed Batch OPPRF.
IACR Cryptol. ePrint Arch., 2021

Production-level Open Source Privacy Preserving Inference in Medical Imaging.
CoRR, 2021

SiRnn: A Math Library for Secure RNN Inference.
Proceedings of the 42nd IEEE Symposium on Security and Privacy, 2021

Function Secret Sharing for Mixed-Mode and Fixed-Point Secure Computation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Secure Featurization and Applications to Secure Phishing Detection.
Proceedings of the CCSW@CCS '21: Proceedings of the 2021 on Cloud Computing Security Workshop, 2021

Efficient Linear Multiparty PSI and Extensions to Circuit/Quorum PSI.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020
Secure Medical Image Analysis with CrypTFlow.
CoRR, 2020

CrypTFlow: Secure TensorFlow Inference.
Proceedings of the 2020 IEEE Symposium on Security and Privacy, 2020

Blockene: A High-throughput Blockchain Over Mobile Devices.
Proceedings of the 14th USENIX Symposium on Operating Systems Design and Implementation, 2020

CrypTFlow2: Practical 2-Party Secure Inference.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019
SecureNN: 3-Party Secure Computation for Neural Network Training.
Proc. Priv. Enhancing Technol., 2019

EzPC: Programmable and Efficient Secure Two-Party Computation for Machine Learning.
Proceedings of the IEEE European Symposium on Security and Privacy, 2019

Explicit Rate-1 Non-malleable Codes for Local Tampering.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018
SecureNN: Efficient and Private Neural Network Training.
IACR Cryptol. ePrint Arch., 2018

Secure Computation Using Leaky Correlations (Asymptotically Optimal Constructions).
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Obfuscation from Low Noise Multilinear Maps.
Proceedings of the Progress in Cryptology - INDOCRYPT 2018, 2018

Non-malleable Codes Against Lookahead Tampering.
Proceedings of the Progress in Cryptology - INDOCRYPT 2018, 2018

2017
EzPC: Programmable, Efficient, and Scalable Secure Two-Party Computation.
IACR Cryptol. ePrint Arch., 2017

Constant-rate Non-malleable Codes in the Split-state Model.
IACR Cryptol. ePrint Arch., 2017

Laconic Oblivious Transfer and Its Applications.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016
Program Obfuscation: Applications and Optimizations.
PhD thesis, 2016

Secure Multiparty RAM Computation in Constant Rounds.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Optimal Computational Split-state Non-malleable Codes.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

2015
A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Hosting Services on an Untrusted Cloud.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Concurrent Secure Computation via Non-Black Box Simulation.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Secure Computation from Leaky Correlated Randomness.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Multi-input Functional Encryption for Unbounded Arity Functions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014
Explicit Optimal-Rate Non-malleable Codes Against Bit-wise Tampering and Permutations.
IACR Cryptol. ePrint Arch., 2014

Explicit Non-malleable Codes Resistant to Permutations and Perturbations.
IACR Cryptol. ePrint Arch., 2014

Explicit Non-Malleable Codes Resistant to Permutations.
Electron. Colloquium Comput. Complex., 2014

On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption.
Proceedings of the Progress in Cryptology - INDOCRYPT 2014, 2014

Efficient Round Optimal Blind Signatures.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

Optimizing Obfuscation: Avoiding Barrington's Theorem.
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

2013
What Information Is Leaked under Concurrent Composition?
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012
Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012


  Loading...