Spectral Methods for Matrix Rigidity with Applications to Size-Depth Tradeoffs and Communication Complexity. - Satyanarayana V. Lokam (FOCS, 1995)

Logspace Verifiers, NC, and NP. - Satyanarayana V. Lokam; Meena Mahajan; V. Vinay (ISAAC, 1995)

Simultaneous Messages vs. Communication. - László Babai; Peter G. Kimmel; Satyanarayana V. Lokam (STACS, 1995)

Remarks on Graph Complexity. - Satyanarayana V. Lokam (FSTTCS, 1998)

Imroved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function. - Andris Ambainis; Satyanarayana V. Lokam (LATIN, 2000)

On the rigidity of Vandermonde matrices. - Satyanarayana V. Lokam (Theor. Comput. Sci., 2000)

Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity. - Jürgen Forster; Matthias Krause 001; Satyanarayana V. Lokam; Rustam Mubarakzjanov; Niels Schmitt; Hans Ulrich Simon (FSTTCS, 2001)

Spectral Methods for Matrix Rigidity with Applications to Size-Depth Trade-offs and Communication Complexity. - Satyanarayana V. Lokam (J. Comput. Syst. Sci., 2001)

Better Lower Bounds for Locally Decodable Codes. - Amit Deshpande 001; Rahul Jain 001; Telikepalli Kavitha; Jaikumar Radhakrishnan; Satyanarayana V. Lokam (CCC, 2002)

Width-Based Algorithms for SAT and CIRCUIT-SAT: (Extended Abstract). - Elizabeth Broering; Satyanarayana V. Lokam (SAT, 2003)

Graph Complexity and Slice Functions. - Satyanarayana V. Lokam (Theory Comput. Syst., 2003)

Communication Complexity of Simultaneous Messages. - László Babai; Anna Gál; Peter G. Kimmel; Satyanarayana V. Lokam (SIAM J. Comput., 2003)

Lower bounds for adaptive locally decodable codes. - Amit Deshpande 001; Rahul Jain 001; Telikepalli Kavitha; Satyanarayana V. Lokam; Jaikumar Radhakrishnan (Random Struct. Algorithms, 2005)

Quadratic Lower Bounds on Matrix Rigidity. - Satyanarayana V. Lokam (TAMC, 2006)

An optimal lower bound for 2-query locally decodable linear codes. - Dungjade Shiowattana; Satyanarayana V. Lokam (Inf. Process. Lett., 2006)

Vulnerabilities in Anonymous Credential Systems. - Raghav Bhaskar; K. Chandrasekaran 003; Satyanarayana V. Lokam; Peter L. Montgomery; Ramarathnam Venkatesan; Yacov Yacobi (STM@ESORICS, 2007)

Improved Bounds on Security Reductions for Discrete Log Based Signatures. - Sanjam Garg; Raghav Bhaskar; Satyanarayana V. Lokam (CRYPTO, 2008)

On The Diffie-Hellman Assumption. - Raghav Bhaskar; K. Chandrasekaran 003; Satyanarayana V. Lokam; Peter L. Montgomery; Ramarathnam Venkatesan; Yacov Yacobi (IACR Cryptol. ePrint Arch., 2008)

Complexity Lower Bounds using Linear Algebra. - Satyanarayana V. Lokam (Found. Trends Theor. Comput. Sci., 2009)

Threshold Discernible Ring Signatures. - Swarun Kumar; Shivank Agrawal; Ramarathnam Venkatesan; Satyanarayana V. Lokam; C. Pandu Rangan (ICETE (Selected Papers), 2010)

Forcing Out a Confession - Threshold Discernible Ring Signatures. - Swarun Kumar; Shivank Agrawal; Ramarathnam Venkatesan; Satyanarayana V. Lokam; C. Pandu Rangan (SECRYPT, 2010)

Efficient Reconstruction of Random Multilinear Formulas. - Ankit Gupta 001; Neeraj Kayal; Satyanarayana V. Lokam (FOCS, 2011)

Reconstruction of Depth-4 Multilinear Circuits with Top fanin 2. - Ankit Gupta 001; Neeraj Kayal; Satyanarayana V. Lokam (Electron. Colloquium Comput. Complex., 2011)

On-Line/Off-Line Leakage Resilient Secure Computation Protocols. - Chaya Ganesh; Vipul Goyal; Satyanarayana V. Lokam (INDOCRYPT, 2012)

Reconstruction of depth-4 multilinear circuits with top fan-in 2. - Ankit Gupta 001; Neeraj Kayal; Satyanarayana V. Lokam (STOC, 2012)

On Black-Box Reductions between Predicate Encryption Schemes. - Vipul Goyal; Virendra Kumar; Satyanarayana V. Lokam; Mohammad Mahmoody (TCC, 2012)

Using Elimination Theory to Construct Rigid Matrices. - Abhinav Kumar 006; Satyanarayana V. Lokam; Vijay M. Patankar; Jayalal Sarma (Comput. Complex., 2014)

Weight enumerators and higher support weights of maximally recoverable codes. - V. Lalitha 001; Satyanarayana V. Lokam (Allerton, 2015)

Restrictions of nondegenerate Boolean functions and degree lower bounds over different rings. - Chia-Jung Lee; Satyanarayana V. Lokam; Shi-Chun Tsai; Ming-Chuan Yang (ISIT, 2015)

On Restricting No-Junta Boolean Function and Degree Lower Bounds by Polynomial Method. - Chia-Jung Lee; Satya V. Lokam; Shi-Chun Tsai; Ming-Chuan Yang (CoRR, 2015)

On the Sensitivity Conjecture for Read-k Formulas. - Mitali Bafna; Satyanarayana V. Lokam; Sébastien Tavenas; Ameya Velingker (Electron. Colloquium Comput. Complex., 2016)

Upper bounds on Fourier entropy. - Sourav Chakraborty 001; Raghav Kulkarni; Satyanarayana V. Lokam; Nitin Saurabh (Theor. Comput. Sci., 2016)

HOP: Hardware makes Obfuscation Practical. - Kartik Nayak; Christopher W. Fletcher; Ling Ren 001; Nishanth Chandran; Satya V. Lokam; Elaine Shi; Vipul Goyal (NDSS, 2017)

∊-MSR Codes: Contacting Fewer Code Blocks for Exact Repair. - Venkatesan Guruswami; Satyanarayana V. Lokam; Sai Vikneshwar Mani Jayaraman (ISIT, 2018)

Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions. - Sourav Chakraborty 001; Sushrut Karmalkar; Srijita Kundu; Satyanarayana V. Lokam; Nitin Saurabh (LATIN, 2018)

ϵ-MSR Codes: Contacting Fewer Code Blocks for Exact Repair. - Venkatesan Guruswami; Satyanarayana V. Lokam; Sai Vikneshwar Mani Jayaraman (IEEE Trans. Inf. Theory, 2020)

Dew: Transparent Constant-sized zkSNARKs. - Arasu Arun; Chaya Ganesh; Satya V. Lokam; Tushar Mopuri; Sriram Sridhar 001 (IACR Cryptol. ePrint Arch., 2022)

Dew: A Transparent Constant-Sized Polynomial Commitment Scheme. - Arasu Arun; Chaya Ganesh; Satya V. Lokam; Tushar Mopuri; Sriram Sridhar 001 (Public Key Cryptography (2), 2023)