Satyanarayana V. Lokam

According to our database, Satyanarayana V. Lokam authored at least 38 papers between 1995 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

Dew: A Transparent Constant-Sized Polynomial Commitment Scheme.

Arasu Arun, Chaya Ganesh, Satya V. Lokam, Tushar Mopuri, Sriram Sridhar

Proceedings of the Public-Key Cryptography - PKC 2023, 2023

2022

Dew: Transparent Constant-sized zkSNARKs.

Arasu Arun, Chaya Ganesh, Satya V. Lokam, Tushar Mopuri, Sriram Sridhar

IACR Cryptol. ePrint Arch., 2022

2020

ϵ-MSR Codes: Contacting Fewer Code Blocks for Exact Repair.

Venkatesan Guruswami, Satyanarayana V. Lokam, Sai Vikneshwar Mani Jayaraman

IEEE Trans. Inf. Theory, 2020

2018

Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions.

Sourav Chakraborty, Sushrut Karmalkar, Srijita Kundu, Satyanarayana V. Lokam, Nitin Saurabh

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

∊-MSR Codes: Contacting Fewer Code Blocks for Exact Repair.

Venkatesan Guruswami, Satyanarayana V. Lokam, Sai Vikneshwar Mani Jayaraman

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

HOP: Hardware makes Obfuscation Practical.

Kartik Nayak, Christopher W. Fletcher, Ling Ren, Nishanth Chandran, Satya V. Lokam, Elaine Shi, Vipul Goyal

Proceedings of the 24th Annual Network and Distributed System Security Symposium, 2017

2016

On the Sensitivity Conjecture for Read-k Formulas.

Mitali Bafna, Satyanarayana V. Lokam, Sébastien Tavenas, Ameya Velingker

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

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

Restrictions of nondegenerate Boolean functions and degree lower bounds over different rings.

Chia-Jung Lee, Satyanarayana V. Lokam, Shi-Chun Tsai, Ming-Chuan Yang

Proceedings of the IEEE International Symposium on Information Theory, 2015

Upper Bounds on Fourier Entropy.

Sourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

Weight enumerators and higher support weights of maximally recoverable codes.

V. Lalitha, Satyanarayana V. Lokam

Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2012

On Black-Box Reductions between Predicate Encryption Schemes.

Vipul Goyal, Virendra Kumar, Satyanarayana V. Lokam, Mohammad Mahmoody

Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Reconstruction of depth-4 multilinear circuits with top fan-in 2.

Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

On-Line/Off-Line Leakage Resilient Secure Computation Protocols.

Chaya Ganesh, Vipul Goyal, Satyanarayana V. Lokam

Proceedings of the Progress in Cryptology, 2012

2011

Reconstruction of Depth-4 Multilinear Circuits with Top fanin 2.

Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam

Electron. Colloquium Comput. Complex., 2011

Efficient Reconstruction of Random Multilinear Formulas.

Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Forcing Out a Confession - Threshold Discernible Ring Signatures.

Swarun Kumar, Shivank Agrawal, Ramarathnam Venkatesan, Satyanarayana V. Lokam, C. Pandu Rangan

Proceedings of the SECRYPT 2010, 2010

Threshold Discernible Ring Signatures.

Swarun Kumar, Shivank Agrawal, Ramarathnam Venkatesan, Satyanarayana V. Lokam, C. Pandu Rangan

Proceedings of the e-Business and Telecommunications - 7th International Joint Conference, 2010

2009

Complexity Lower Bounds using Linear Algebra.

Satyanarayana V. Lokam

Found. Trends Theor. Comput. Sci., 2009

Using Elimination Theory to construct Rigid Matrices.

Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

2008

On The Diffie-Hellman Assumption.

Raghav Bhaskar, K. Chandrasekaran, Satyanarayana V. Lokam, Peter L. Montgomery, Ramarathnam Venkatesan, Yacov Yacobi

IACR Cryptol. ePrint Arch., 2008

Improved Bounds on Security Reductions for Discrete Log Based Signatures.

Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Lokam

Proceedings of the Advances in Cryptology, 2008

2007

Vulnerabilities in Anonymous Credential Systems.

Raghav Bhaskar, K. Chandrasekaran, Satyanarayana V. Lokam, Peter L. Montgomery, Ramarathnam Venkatesan, Yacov Yacobi

Proceedings of the 3rd International Workshop on Security and Trust Management, 2007

2006

An optimal lower bound for 2-query locally decodable linear codes.

Dungjade Shiowattana, Satyanarayana V. Lokam

Inf. Process. Lett., 2006

Quadratic Lower Bounds on Matrix Rigidity.

Satyanarayana V. Lokam

Proceedings of the Theory and Applications of Models of Computation, 2006

2005

Lower bounds for adaptive locally decodable codes.

Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan

Random Struct. Algorithms, 2005

2003

Communication Complexity of Simultaneous Messages.

László Babai, Anna Gál, Peter G. Kimmel, Satyanarayana V. Lokam

SIAM J. Comput., 2003

Graph Complexity and Slice Functions.

Satyanarayana V. Lokam

Theory Comput. Syst., 2003

Width-Based Algorithms for SAT and CIRCUIT-SAT: (Extended Abstract).

Elizabeth Broering, Satyanarayana V. Lokam

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

2002

Better Lower Bounds for Locally Decodable Codes.

Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam

Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

2001

Spectral Methods for Matrix Rigidity with Applications to Size-Depth Trade-offs and Communication Complexity.

Satyanarayana V. Lokam

J. Comput. Syst. Sci., 2001

Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity.

Jürgen Forster, Matthias Krause, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, Hans Ulrich Simon

Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

2000

On the rigidity of Vandermonde matrices.

Satyanarayana V. Lokam

Theor. Comput. Sci., 2000

Imroved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function.

Andris Ambainis, Satyanarayana V. Lokam

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1998

Remarks on Graph Complexity.

Satyanarayana V. Lokam

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

1995

Simultaneous Messages vs. Communication.

László Babai, Peter G. Kimmel, Satyanarayana V. Lokam

Proceedings of the STACS 95, 1995

Logspace Verifiers, NC, and NP.

Satyanarayana V. Lokam, Meena Mahajan, V. Vinay

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Spectral Methods for Matrix Rigidity with Applications to Size-Depth Tradeoffs and Communication Complexity.

Satyanarayana V. Lokam

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995