Articoli con mandati relativi all'accesso pubblico - Omkant PandeyUlteriori informazioni
Disponibili pubblicamente: 17
Revisiting the cryptographic hardness of finding a nash equilibrium
S Garg, O Pandey, A Srinivasan
Annual International Cryptology Conference, 579-604, 2016
Mandati: US National Science Foundation
The exact round complexity of secure computation
S Garg, P Mukherjee, O Pandey, A Polychroniadou
Advances in Cryptology–EUROCRYPT 2016: 35th Annual International Conference …, 2016
Mandati: US National Science Foundation, Danish Council for Strategic Research
Breaking the sub-exponential barrier in obfustopia
S Garg, O Pandey, A Srinivasan, M Zhandry
Annual International Conference on the Theory and Applications of …, 2017
Mandati: US National Science Foundation, US Department of Defense
Block-wise non-malleable codes
N Chandran, V Goyal, P Mukherjee, O Pandey, J Upadhyay
Cryptology ePrint Archive, 2015
Mandati: European Commission
Secure multiparty RAM computation in constant rounds
S Garg, D Gupta, P Miao, O Pandey
Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing …, 2016
Mandati: US National Science Foundation
Compact ring signatures from learning with errors
R Chatterjee, S Garg, M Hajiabadi, D Khurana, X Liang, G Malavolta, ...
Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021
Mandati: US National Science Foundation, US Department of Defense
Incremental program obfuscation
S Garg, O Pandey
Annual International Cryptology Conference, 193-223, 2017
Mandati: US National Science Foundation, US Department of Defense
On the exact round complexity of self-composable two-party computation
S Garg, S Kiyoshima, O Pandey
Annual International Conference on the Theory and Applications of …, 2017
Mandati: US National Science Foundation, US Department of Defense
Improved black-box constructions of composable secure computation
R Chatterjee, X Liang, O Pandey
Cryptology ePrint Archive, 2020
Mandati: US National Science Foundation, US Department of Defense
Black-box constructions of bounded-concurrent secure computation
S Garg, X Liang, O Pandey, I Visconti
International Conference on Security and Cryptography for Networks, 87-107, 2020
Mandati: US National Science Foundation, US Department of Defense, European Commission
A new approach to efficient non-malleable zero-knowledge
A Kim, X Liang, O Pandey
Annual International Cryptology Conference, 389-418, 2022
Mandati: US National Science Foundation, US Department of Defense
A new approach to post-quantum non-malleability
X Liang, O Pandey, T Yamakawa
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
Mandati: US National Science Foundation, US Department of Defense
Towards a unified approach to black-box constructions of zero-knowledge proofs
X Liang, O Pandey
Annual International Cryptology Conference, 34-64, 2021
Mandati: US National Science Foundation, US Department of Defense
An Approach for Multi-Level Visibility Scoping of IoT Services in Enterprise Environments
Q Zhou, O Pandey, F Ye
IEEE Transactions on Mobile Computing 21 (2), 408-420, 2020
Mandati: US National Science Foundation
Credibility in Private Set Membership
S Garg, M Hajiabadi, A Jain, Z Jin, O Pandey, S Shiehian
IACR International Conference on Public-Key Cryptography, 159-189, 2023
Mandati: US National Science Foundation, US Department of Defense
Random walks and concurrent zero-knowledge
A Aiyer, X Liang, N Nalini, O Pandey
International Conference on Applied Cryptography and Network Security, 24-44, 2020
Mandati: US National Science Foundation
Argus: Multi-Level Service Visibility Scoping for Internet-of-Things in Enterprise Environments
Q Zhou, O Pandey, F Ye
2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2020
Mandati: US National Science Foundation
Le informazioni sulla pubblicazione e sul finanziamento vengono stabilite automaticamente da un software