( en | de | ru )

 

Disambiguation of "Pandey, Omkant"

Author of the publication

copydeleteadd this publication to your clipboard
On the Exact Round Complexity of Self-Composable Two-Party Computation.

, , and . IACR Cryptol. ePrint Arch., (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Shantanu Pandey

Dharmendra Pandey

Rakesh Pandey

Ankur Pandey

Rahul Pandey

 

Other publications of authors with the same name

Breaking the Sub-Exponential Barrier in Obfustopia., , , and . EUROCRYPT (3), volume 10212 of Lecture Notes in Computer Science, page 156-181. (2017)Incremental Program Obfuscation., and . IACR Cryptol. ePrint Arch., (2015)On the Exact Cryptographic Hardness of Finding a Nash Equilibrium., , and . IACR Cryptol. ePrint Arch., (2015)Towards a Unified Approach to Black-Box Constructions of Zero-Knowledge Proofs., and . CRYPTO (4), volume 12828 of Lecture Notes in Computer Science, page 34-64. Springer, (2021)Compact Ring Signatures from Learning with Errors., , , , , , , and . CRYPTO (1), volume 12825 of Lecture Notes in Computer Science, page 282-312. Springer, (2021)ProCSA: Protecting Privacy in Crowdsourced Spectrum Allocation., , , , and . ESORICS (1), volume 11735 of Lecture Notes in Computer Science, page 556-576. Springer, (2019)An Approach for Multi-Level Visibility Scoping of IoT Services in Enterprise Environments., , and . IEEE Trans. Mob. Comput., 21 (2): 408-420 (2022)Breaking the Sub-Exponential Barrier in Obfustopia., , , and . IACR Cryptol. ePrint Arch., (2016)On the Exact Round Complexity of Self-Composable Two-Party Computation., , and . IACR Cryptol. ePrint Arch., (2017)Incremental Deterministic Public-Key Encryption., , , and . J. Cryptol., 31 (1): 134-161 (2018)