Omkant Pandey
Affiliations:- University of California, Los Angeles, USA
According to our database1,
Omkant Pandey
authored at least 53 papers
between 2006 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on cs.ucla.edu
On csauthors.net:
Bibliography
2023
Proceedings of the Public-Key Cryptography - PKC 2023, 2023
2022
An Approach for Multi-Level Visibility Scoping of IoT Services in Enterprise Environments.
IEEE Trans. Mob. Comput., 2022
IACR Cryptol. ePrint Arch., 2022
2021
IACR Cryptol. ePrint Arch., 2021
2020
IACR Cryptol. ePrint Arch., 2020
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
Proceedings of the Computer Security - ESORICS 2019, 2019
2018
IACR Cryptol. ePrint Arch., 2018
2017
IACR Cryptol. ePrint Arch., 2017
2016
IACR Cryptol. ePrint Arch., 2016
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016
2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
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
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015
2014
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
Explicit Optimal-Rate Non-malleable Codes Against Bit-wise Tampering and Permutations.
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
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
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013
2012
IACR Cryptol. ePrint Arch., 2012
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma.
IACR Cryptol. ePrint Arch., 2012
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
Proceedings of the Progress in Cryptology - INDOCRYPT 2011, 2011
2010
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010
2009
2008
Non-black-box Techniques Are Not Necessary for Constant Round Non-malleable Protocols.
IACR Cryptol. ePrint Arch., 2008
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
Proceedings of the Advances in Cryptology, 2008
2007
2006
IACR Cryptol. ePrint Arch., 2006
Electron. Colloquium Comput. Complex., 2006