( en | de | ru )

 

Disambiguation of "Nayak, Kartik"

Author of the publication

copydeleteadd this publication to your clipboard
Transparent Batchable Time-lock Puzzles and Applications to Byzantine Consensus.

, , , , , and . Public Key Cryptography (1), volume 13940 of Lecture Notes in Computer Science, page 554-584. Springer, (2023)

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.

Raghubhai Nayak

Kartik Jain

Sanjeev Kumar Nayak

Arnab Nayak

Sanjit Nayak

 

Other publications of authors with the same name

Perfectly Secure Oblivious Parallel RAM with O(log3 N/ log log N) Overhead., , , and . IACR Cryptol. ePrint Arch., (2020)Lumiere: Making Optimal BFT for Partial Synchrony Practical., , , and . CoRR, (2023)OptORAMa: Optimal Oblivious RAM., , , , , and . J. ACM, 70 (1): 4:1-4:70 (February 2023)TrustBoost: Boosting Trust among Interoperable Blockchains., , , , and . IACR Cryptol. ePrint Arch., (2022)Breaking the Chains of Rationality: Understanding the Limitations to and Obtaining Order Policy Enforcement., , , , , and . IACR Cryptol. ePrint Arch., (2023)Efficient Adaptively-Secure Byzantine Agreement for Long Messages., , , and . IACR Cryptol. ePrint Arch., (2021)Bucket Oblivious Sort: An Extremely Simple Oblivious Sort., , , , , and . SOSA, page 8-14. SIAM, (2020)OptRand: Optimistically Responsive Reconfigurable Distributed Randomness., , , and . NDSS, The Internet Society, (2023)Perfectly Secure Oblivious Parallel RAM., , and . TCC (2), volume 11240 of Lecture Notes in Computer Science, page 636-668. Springer, (2018)Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency., , , and . DISC, volume 179 of LIPIcs, page 47:1-47:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)