Omkant Pandey

Affiliations:
  • University of California, Los Angeles, USA


According to our database1, Omkant Pandey authored at least 49 papers between 2006 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Towards a Unified Approach to Black-Box Constructions of Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch., 2021

Compact Ring Signatures from Learning With Errors.
IACR Cryptol. ePrint Arch., 2021

2020
Black-Box Constructions of Bounded-Concurrent Secure Computation.
IACR Cryptol. ePrint Arch., 2020

Improved Black-Box Constructions of Composable Secure Computation.
IACR Cryptol. ePrint Arch., 2020

Random Walks and Concurrent Zero-Knowledge.
IACR Cryptol. ePrint Arch., 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

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

2018
Incremental Deterministic Public-Key Encryption.
J. Cryptol., 2018

A New Approach to Black-Box Concurrent Secure Computation.
IACR Cryptol. ePrint Arch., 2018

2017
On the Exact Round Complexity of Self-Composable Two-Party Computation.
IACR Cryptol. ePrint Arch., 2017

2016
Breaking the Sub-Exponential Barrier in Obfustopia.
IACR Cryptol. ePrint Arch., 2016

The Exact Round Complexity of Secure Computation.
IACR Cryptol. ePrint Arch., 2016

Secure Multiparty RAM Computation in Constant Rounds.
IACR Cryptol. ePrint Arch., 2016

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

2015
Textbook Non-Malleable Commitments.
IACR Cryptol. ePrint Arch., 2015

Do Distributed Differentially-Private Protocols Require Oblivious Transfer?
IACR Cryptol. ePrint Arch., 2015

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

Incremental Program Obfuscation.
IACR Cryptol. ePrint Arch., 2015

Block-wise Non-Malleable Codes.
IACR Cryptol. ePrint Arch., 2015

Optimal Computational Split-state Non-malleable Codes.
IACR Cryptol. ePrint Arch., 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
Relaxed Two-to-one Recoding Schemes.
IACR Cryptol. ePrint Arch., 2014

Deterministic Public-Key Encryption under Continual Leakage.
IACR Cryptol. ePrint Arch., 2014

Public-Coin Differing-Inputs Obfuscation and Its Applications.
IACR Cryptol. ePrint Arch., 2014

Interactive Proofs under Continual Memory Leakage.
IACR Cryptol. ePrint Arch., 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

2013
Obfuscation-based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP.
IACR Cryptol. ePrint Arch., 2013

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

2012
Achieving Constant Round Leakage-Resilient Zero-Knowledge.
IACR Cryptol. ePrint Arch., 2012

Cryptography Using CAPTCHA Puzzles.
IACR Cryptol. ePrint Arch., 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

2011
Non-Malleable Zero Knowledge: Black-Box Constructions and Definitional Relationships.
IACR Cryptol. ePrint Arch., 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

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

2007
Precise Concurrent Zero Knowledge.
IACR Cryptol. ePrint Arch., 2007

Private Locally Decodable Codes.
IACR Cryptol. ePrint Arch., 2007

2006
Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data.
IACR Cryptol. ePrint Arch., 2006

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

Fair Identification.
Proceedings of the Topics in Cryptology, 2006


  Loading...