Secure Montgomery Multiplication and Repeated Squares for Modular Exponentiation. - Justin Bloom; Lalita Devadas (CoRR, 2019)

Succinct LWE Sampling, Random Polynomials, and Obfuscation. - Lalita Devadas; Willy Quach; Vinod Vaikuntanathan; Hoeteck Wee; Daniel Wichs (IACR Cryptol. ePrint Arch., 2021)

Rate-1 Non-Interactive Arguments for Batch-NP and Applications. - Lalita Devadas; Rishab Goyal; Yael Kalai; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2022)

QuietOT: Lightweight Oblivious Transfer with a Public-Key Setup. - Geoffroy Couteau; Lalita Devadas; Srinivas Devadas; Alexander Koch 001; Sacha Servan-Schreiber (IACR Cryptol. ePrint Arch., 2024)

Batching Adaptively-Sound SNARGs for NP. - Lalita Devadas; Brent Waters; David J. Wu 001 (IACR Cryptol. ePrint Arch., 2024)

Non-Interactive Distributed Point Functions. - Elette Boyle; Lalita Devadas; Sacha Servan-Schreiber (IACR Cryptol. ePrint Arch., 2025)

Multi-Key Homomorphic Secret Sharing. - Geoffroy Couteau; Lalita Devadas; Aditya Hegde 003; Abhishek Jain 002; Sacha Servan-Schreiber (IACR Cryptol. ePrint Arch., 2025)

Succinct Witness Encryption for Batch Languages and Applications. - Lalita Devadas; Abhishek Jain 002; Brent Waters; David J. Wu 001 (IACR Cryptol. ePrint Arch., 2025)