Omkant Pandey

Affiliations:
  • University of California, Los Angeles, USA


According to our database1, Omkant Pandey authored at least 56 papers between 2006 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Almost-Total Puzzles and Their Applications.
IACR Cryptol. ePrint Arch., 2025

Round-Efficient Composable Two-Party Quantum Computation.
IACR Cryptol. ePrint Arch., 2025

The Round Complexity of Black-Box Post-quantum Secure Computation.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2023
Credibility in Private Set Membership.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

A New Approach to Post-Quantum Non-Malleability.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
An Approach for Multi-Level Visibility Scoping of IoT Services in Enterprise Environments.
IEEE Trans. Mob. Comput., 2022

A New Approach to Efficient Non-Malleable Zero-Knowledge.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
Towards a Unified Approach to Black-Box Constructions of Zero-Knowledge Proofs.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Compact Ring Signatures from Learning with Errors.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
Black-Box Constructions of Bounded-Concurrent Secure Computation.
Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

Argus: Multi-Level Service Visibility Scoping for Internet-of-Things in Enterprise Environments.
Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020

Improved Black-Box Constructions of Composable Secure Computation.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Random Walks and Concurrent Zero-Knowledge.
Proceedings of the Applied Cryptography and Network Security, 2020

2019
ProCSA: Protecting Privacy in Crowdsourced Spectrum Allocation.
Proceedings of the Computer Security - ESORICS 2019, 2019

2018
A New Approach to Black-Box Concurrent Secure Computation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

2017
Breaking the Sub-Exponential Barrier in Obfustopia.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

On the Exact Round Complexity of Self-composable Two-Party Computation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Incremental Program Obfuscation.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

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

Textbook non-malleable commitments.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Do Distributed Differentially-Private Protocols Require Oblivious Transfer?.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Block-Wise Non-Malleable Codes.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

The Exact Round Complexity of Secure Computation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Deterministic Public-Key Encryption Under Continual Leakage.
Proceedings of the Applied Cryptography and Network Security, 2016

2015
On the Exact Cryptographic Hardness of Finding a Nash Equilibrium.
IACR Cryptol. ePrint Arch., 2015

Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Public-Coin Differing-Inputs Obfuscation and Its Applications.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 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

Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 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

Achieving Constant Round Leakage-Resilient Zero-Knowledge.
Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

Relaxed Two-to-One Recoding Schemes.
Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

Non-Malleable Zero Knowledge: Black-Box Constructions and Definitional Relationships.
Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

Interactive Proofs under Continual Memory Leakage.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013
Cryptography Using Captcha Puzzles.
Proceedings of the Public-Key Cryptography - PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26, 2013

Accuracy-Privacy Tradeoffs for Two-Party Differentially Private Protocols.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma.
IACR Cryptol. ePrint Arch., 2012

Property Preserving Symmetric Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Incremental Deterministic Public-Key Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

2011
Publicly Verifiable Secret Sharing for Cloud-Based Key Management.
Proceedings of the Progress in Cryptology - INDOCRYPT 2011, 2011

2010
Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

2009
Computational Differential Privacy.
Proceedings of the Advances in Cryptology, 2009

2008
Improved algorithms for optimal embeddings.
ACM Trans. Algorithms, 2008

Non-black-box Techniques Are Not Necessary for Constant Round Non-malleable Protocols.
IACR Cryptol. ePrint Arch., 2008

Bounded Ciphertext Policy Attribute Based Encryption.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Precise Concurrent Zero Knowledge.
Proceedings of the Advances in Cryptology, 2008

Adaptive One-Way Functions and Applications.
Proceedings of the Advances in Cryptology, 2008

2007
Private Locally Decodable Codes.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006
Improved Algorithms for Optimal Embeddings.
Electron. Colloquium Comput. Complex., 2006

Fair Identification.
Proceedings of the Topics in Cryptology, 2006

Attribute-based encryption for fine-grained access control of encrypted data.
Proceedings of the 13th ACM Conference on Computer and Communications Security, 2006


  Loading...